Journal Article On the (Im)possibility of Obfuscating Programs 2012 • Journal of the ACM • 59(2): Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S, Yang K
Journal Article Learning a hidden matching 2004 • SIAM journal on computing (Print) • 33(2):487-501 Alon N, Beigel R, Kasif S, Rudich S, Sudakov B
Conference Learning a hidden matching 2002 • Annual Symposium on Foundations of Computer Science • 197-206 Alon N, Beigel R, Kasif S, Rudich S, Sudakov B
Journal Article Communication complexity towards lower bounds on circuit depth 2001 • Computational Complexity • 10(3):210-246 Edmonds J, Impagliazzo R, Rudich S, Sgall J
Conference On the (Im)possibility of obfuscating programs 2001 • Lecture Notes in Computer Science • 2139 LNCS:1-18 Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S, Yang K
Journal Article Reducing the complexity of reductions 2001 • Computational Complexity • 10(2):117-138 Agrawal M, Allender E, Impagliazzo R, Pitassi T, Rudich S
Journal Article Products and help bits in decision trees 1999 • SIAM journal on computing (Print) • 28(3):1035-1050 Nisan N, Rudich S, Saks M
Journal Article Reductions in circuit complexity: An isomorphism theorem and a gap theorem 1998 • Journal of Computer and System Sciences • 57(2):127-143 Agrawal M, Allender E, Rudich S
Journal Article Natural proofs 1997 • Journal of Computer and System Sciences • 55(1):24-35 Razborov AA, Rudich S
Conference Reducing the complexity of reductions 1997 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 730-738 Agrawal M, Allender E, Impagliazzo R, Pitassi T, Rudich S
Journal Article Security and privacy in the information economy 1997 • Proceedings of the National Academy of Sciences of the United States of America • 94(7):2789-2792 Feigenbaum J, Rudich S, Blaze M, McCurley K
Conference Super-bits, demi-bits, and NP/qpoly-natural proofs 1997 • Lecture Notes in Computer Science • 1269:85-93 Rudich S
Journal Article Strategic directions in computer science education 1996 • ACM Computing Surveys • 28(4):836-845 Tucker AB, Astrachan O, Bruce K, Cupper R, Denning P, Drysdale S, Horton T, Kelemen C, McGeoch C, Patt Y, Proulx V, Rada R, Rasala R, Roberts E, Rudich S, Stein L, Tucker A, Van Loan C
Journal Article The future of computational complexity theory: part II 1996 • ACM SIGACT News • 27(4):3-7 Allender E, Feigenbaum J, Goldsmith J, Pitassi T, Rudich S
Journal Article The wakeup problem 1996 • SIAM journal on computing (Print) • 25(6):1332-1357 Fischer MJ, Moran S, Rudich S, Taubenfeld G
Journal Article Fast learning of k-term DNF formulas with queries 1995 • Journal of Computer and System Sciences • 51(3):367-373 Blum A, Rudich S
Conference Natural proofs 1994 • Annual ACM Symposium on Theory of Computing • Part F129502:204-213 Razborov AA, Rudich S
Journal Article Representing Boolean functions as polynomials modulo composite numbers 1994 • Computational Complexity • 4(4):367-382 Barrington DAM, Beigel R, Rudich S
Journal Article THE EXPRESSIVE POWER OF VOTING POLYNOMIALS 1994 • Combinatorica • 14(2):135-148 ASPNES J, BEIGEL R, FURST M, RUDICH S
Conference Weakly learning DNF and characterizing statistical query learning using fourier analysis 1994 • Annual ACM Symposium on Theory of Computing • Part F129502:253-262 Blum A, Furst M, Jackson J, Kearns M, Mansour Y, Rudich S
Journal Article ON DICE AND COINS - MODELS OF COMPUTATION FOR RANDOM GENERATION 1993 • Information and Computation • 104(2):159-174 FELDMAN D, IMPAGLIAZZO R, NAOR M, NISAN N, RUDICH S, SHAMIR A
Conference Fast learning of κ-term DNF formulas with queries 1992 • Annual ACM Symposium on Theory of Computing • Part F129722:382-389 Blum A, Rudich S
Journal Article IMPLICIT REPRESENTATION OF GRAPHS 1992 • SIAM Journal on Discrete Mathematics • 5(4):596-603 KANNAN S, NAOR M, RUDICH S
