Steven Rudich
机构: Professor of Computer Science, Carnegie Mellon University
每年引用次数
引用次数
引用: 6,661
H-指数: 24
I10-指数 : 27
出版物: 48
The wakeup problem
M. J. Fischer , S. Moran , R. Rudich , G. Taubenfeld
symposium on the theory of computing 106 -116
17
1990
Limits on the provable consequences of one-way permutations (invited talk)
R. Impagliazzo , S. Rudich
international cryptology conference 8 -26
3
1990
Communication complexity towards lower bounds on circuit depth
J. Edmonds , R. Impagliazzo , S. Rudich , J. Sgall
Computational Complexity 10 ( 3) 210 -246
36
2001
Reducing the complexity of reductions
M. Agrawal , E. Allender , R. Impagliazzo , T. Pitassi
Computational Complexity 10 ( 2) 117 -138
32
2001
The future of computational complexity theory: part II
E. Allender , J. Feigenbaum , J. Goldsmith , T. Pitassi
ACM SIGACT News 27 ( 4) 3 -7
1
1996
Products and help bits in decision trees
N. Nisan , S. Rudich , M. Saks
foundations of computer science 318 -329
24
1994
On dice and coins: models of computation for random generation
D. Feldman , R. Impagliazzo , M. Naor , N. Nisan
Information & Computation 104 ( 2) 159 -174
15
1993
Security and privacy in the information economy
J. Feigenbaum , S. Rudich , M. Blaze , K. McCurley
Proceedings of the National Academy of Sciences of the United States of America 94 ( 7) 2789 -2792
1997
Limits on the provable consequences of one-way permutations
R. Impagliazzo , S. Rudich
Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 44 -61
483
1989
ABITEBOUL, SERGE, 181
PAOLO ATZENI , FRANCOIS BANCILHON , DAVID A BARRINGTON , CATRIEL BEERI
Journal of Computer and System Sciences 41 468 -468
1990
On Dice and Coins: Models of
NOAM NISAN , STEVEN RUDICH
INFORMATION AND COMPUTATION 104 159474 -159474
1993
Fast Learning of k-Term DNF Formulas with Oueries
STEvEN RUDICH
1995
The Use of Interaction in Public Cryptosystems (Extended Abstract)
Steven Rudich
international cryptology conference 242 -251
29
1991
Complexity theory: From Gödel to Feynman.
Steven Rudich
Computational Complexity Theory 5 -87
2
2004
On the (Im)possibility of Obfuscating Programs.
Russell Impagliazzo , Oded Goldreich , Salil P. Vadhan , Steven Rudich
IACR Cryptology ePrint Archive 2001 69
1,783
2001
The expressive power of voting polynomials
James Aspnes , Richard Beigel , Merrick Furst , Steven Rudich
symposium on the theory of computing 402 -409
52
1991
Super-bits, Demi-bits, and NP/qpoly-natural Proofs
Steven Rudich
randomization and approximation techniques in computer science 85 -93
26
1997
Optimal Circuits and Transitive Automorphism Groups
Steven Rudich , Leonard Berman
international colloquium on automata languages and programming 516 -524
3
1988
Implicit representation of graphs
Sampath Kannan , Moni Naor , Steven Rudich
symposium on the theory of computing 334 -343
53
1988
On the (im)possibility of obfuscating programs
Boaz Barak , Oded Goldreich , Russell Impagliazzo , Steven Rudich
Journal of the ACM 59 ( 2) 1 -48
438
2012