| On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Annual international cryptology conference, 1-18, 2001 | 1562 | 2001 |
| 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 …, 1989 | 637 | 1989 |
| Natural proofs AA Razborov, S Rudich Journal of Computer and System Sciences 55 (1), 24-35, 1997 | 509 | 1997 |
| The bit extraction problem or t-resilient functions B Chor, O Goldreich, J Hasted, J Freidmann, S Rudich, R Smolensky 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 396-407, 1985 | 466 | 1985 |
| On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Journal of the ACM (JACM) 59 (2), 1-48, 2012 | 406 | 2012 |
| Implicat representation of graphs S Kannan, M Naor, S Rudich SIAM Journal on Discrete Mathematics 5 (4), 596-603, 1992 | 280 | 1992 |
| Weakly learning DNF and characterizing statistical query learning using Fourier analysis A Blum, M Furst, J Jackson, M Kearns, Y Mansour, S Rudich Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 278 | 1994 |
| The expressive power of voting polynomials J Aspnes, R Beigel, M Furst, S Rudich Combinatorica 14 (2), 135-148, 1994 | 234 | 1994 |
| Natural proofs AA Razborov, S Rudich Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 125 | 1994 |
| Representing Boolean functions as polynomials modulo composite numbers DAM Barrington, R Beigel, S Rudich Computational Complexity 4 (4), 367-382, 1994 | 109 | 1994 |
| Preparation and characterization of [rac-5, 7, 7, 12, 14, 14,-hexamethyl-1, 4, 8, 11-tetraazocyclotetradecane] copper (II) o-mercaptobenzoate hydrate,[Cu (tet b)(o-SC6H4CO2 … JL Hughey IV, TG Fawcett, SM Rudich, RA Lalancette, JA Potenza, ... Journal of the American Chemical Society 101 (10), 2617-2623, 1979 | 104 | 1979 |
| Fast learning of k-term DNF formulas with queries A Blum, S Rudich Journal of Computer and System Sciences 51 (3), 367-373, 1995 | 99 | 1995 |
| Learning a hidden matching N Alon, R Beigel, S Kasif, S Rudich, B Sudakov SIAM Journal on Computing 33 (2), 487-501, 2004 | 88 | 2004 |
| Limits on the provable consequences of one-way functions S Rudich Ph. D. Thesis, University of California, 1988 | 86 | 1988 |
| Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001 | 64 | 2001 |
| Studies of chelation therapy. Crystal and molecular structure of Cu [H2N (CH2) 2NH (CH2) 3NH (CH2) 2NH2](ClO4) 2 Cu (2, 3, 2-tet)(ClO4) 2 TG Fawcett, SM Rudich, BH Toby, RA LaLancette, JA Potenza, ... Inorganic Chemistry 19 (4), 940-945, 1980 | 61 | 1980 |
| The Use of Interaction in Public Cryptosystems. S Rudich Annual International Cryptology Conference, 242-251, 1991 | 55 | 1991 |
| Reductions in circuit complexity: An isomorphism theorem and a gap theorem M Agrawal, E Allender, S Rudich Journal of Computer and System Sciences 57 (2), 127-143, 1998 | 53 | 1998 |
| Computational complexity theory S Rudich, A Wigderson American Mathematical Soc., 2004 | 47 | 2004 |
| Reducing the complexity of reductions M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich Computational Complexity 10 (2), 117-138, 2001 | 46 | 2001 |
