Steven Rudich

5.1k total citations
36 papers, 1.6k citations indexed

About

Steven Rudich is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Steven Rudich has authored 36 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 2 papers in Computer Networks and Communications. Recurrent topics in Steven Rudich's work include Complexity and Algorithms in Graphs (16 papers), Machine Learning and Algorithms (12 papers) and Computability, Logic, AI Algorithms (10 papers). Steven Rudich is often cited by papers focused on Complexity and Algorithms in Graphs (16 papers), Machine Learning and Algorithms (12 papers) and Computability, Logic, AI Algorithms (10 papers). Steven Rudich collaborates with scholars based in United States, Israel and Canada. Steven Rudich's co-authors include Alexander Razborov, Russell Impagliazzo, Richard Beigel, Oded Goldreich, Merrick L. Furst, Avrim Blum, Moni Naor, Sampath Kannan, James Aspnes and Benny Chor and has published in prestigious journals such as The Journal of Chemical Physics, The Journal of Physical Chemistry and Journal of the ACM.

In The Last Decade

Steven Rudich

35 papers receiving 1.4k citations

Peers

Steven Rudich
S. Goldwasser United States
Richard Beigel United States
Frank Ruskey Canada
Leonid A. Levin United States
René Peralta United States
Eli Ben‐Sasson Israel
Eugene M. Luks United States
Ravi B. Boppana United States
Amnon Ta‐Shma Israel
Nader H. Bshouty Israel
S. Goldwasser United States
Steven Rudich
Citations per year, relative to Steven Rudich Steven Rudich (= 1×) peers S. Goldwasser

Countries citing papers authored by Steven Rudich

Since Specialization
Citations

This map shows the geographic impact of Steven Rudich's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Steven Rudich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Steven Rudich more than expected).

Fields of papers citing papers by Steven Rudich

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Steven Rudich. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Steven Rudich. The network helps show where Steven Rudich may publish in the future.

Co-authorship network of co-authors of Steven Rudich

This figure shows the co-authorship network connecting the top 25 collaborators of Steven Rudich. A scholar is included among the top collaborators of Steven Rudich based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Steven Rudich. Steven Rudich is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Barak, Boaz, Oded Goldreich, Russell Impagliazzo, et al.. (2012). On the (im)possibility of obfuscating programs. Journal of the ACM. 59(2). 1–48. 193 indexed citations
2.
Rudich, Steven. (2004). Complexity theory: From Gödel to Feynman. 5–87. 1 indexed citations
3.
Rudich, Steven, et al.. (2004). Computational Complexity Theory. 21 indexed citations
4.
Nisan, Noam, Steven Rudich, & Michael Saks. (2002). Products and help bits in decision trees. 318–329. 11 indexed citations
5.
Alon, Noga, Richard Beigel, Simon Kasif, Steven Rudich, & Benny Sudakov. (2002). Learning a Hidden Matching Combinatorial Identification of Hidden Matchings with Applications to Whole Genome Sequencing. 1 indexed citations
6.
Barak, Boaz, Oded Goldreich, Steven Rudich, et al.. (2001). On the (Im)possibility of Obfuscating Programs (Extended Abstract). 4 indexed citations
7.
Edmonds, Jeff, Russell Impagliazzo, Steven Rudich, & Jiřı́ Sgall. (2001). Communication complexity towards lower bounds on circuit depth. Computational Complexity. 10(3). 210–246. 27 indexed citations
8.
Agrawal, Manindra, Eric Allender, & Steven Rudich. (1998). Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. Journal of Computer and System Sciences. 57(2). 127–143. 21 indexed citations
9.
Nisan, Noam, Steven Rudich, & Michael Saks. (1998). Products and Help Bits in Decision Trees. SIAM Journal on Computing. 28(3). 1035–1050. 18 indexed citations
10.
Razborov, Alexander & Steven Rudich. (1997). Natural Proofs. Journal of Computer and System Sciences. 55(1). 24–35. 238 indexed citations
11.
Blum, Avrim & Steven Rudich. (1995). Fast Learning of k-Term DNF Formulas with Queries. Journal of Computer and System Sciences. 51(3). 367–373. 15 indexed citations
12.
Aspnes, James, Richard Beigel, Merrick L. Furst, & Steven Rudich. (1994). The expressive power of voting polynomials. COMBINATORICA. 14(2). 135–148. 93 indexed citations
13.
Barrington, David A. Mix, Richard Beigel, & Steven Rudich. (1994). Representing Boolean functions as polynomials modulo composite numbers. Computational Complexity. 4(4). 367–382. 59 indexed citations
14.
Feldman, David, Russell Impagliazzo, Moni Naor, et al.. (1993). On Dice and Coins: Models of Computation for Random Generation. Information and Computation. 104(2). 159–174. 10 indexed citations
15.
Blum, Avrim & Steven Rudich. (1992). Fast learning of k-term DNF formulas with queries. 382–389. 46 indexed citations
16.
Barrington, David A. Mix, Richard Beigel, & Steven Rudich. (1992). Representing Boolean functions as polynomials modulo composite numbers. 455–461. 14 indexed citations
17.
Kannan, Sampath, Moni Naor, & Steven Rudich. (1992). Implicat Representation of Graphs. SIAM Journal on Discrete Mathematics. 5(4). 596–603. 89 indexed citations
18.
Impagliazzo, Russell & Steven Rudich. (1990). Limits on the provable consequences of one-way permutations (invited talk). 8–26. 3 indexed citations
19.
Hemachandra, Lane A. & Steven Rudich. (1990). On the complexity of ranking. Journal of Computer and System Sciences. 41(2). 251–271. 13 indexed citations
20.
Chor, Benny, et al.. (1985). The bit extraction problem or t-resilient functions. 396–407. 176 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by S. Goldwasser Breakdown of academic impact, for papers by Richard Beigel Breakdown of academic impact, for papers by Frank Ruskey Breakdown of academic impact, for papers by Leonid A. Levin Breakdown of academic impact, for papers by René Peralta Breakdown of academic impact, for papers by Eli Ben‐Sasson Breakdown of academic impact, for papers by Eugene M. Luks Breakdown of academic impact, for papers by Ravi B. Boppana Breakdown of academic impact, for papers by Amnon Ta‐Shma Breakdown of academic impact, for papers by Nader H. Bshouty
Rankless by CCL
2026