On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology …, 2001 | 1811 | 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 | 771 | 1989 |

Natural proofs AA Razborov, S Rudich Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 712 | 1994 |

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 | 525 | 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 | 505 | 2012 |

Implicit representation of graphs S Kannan, M Naor, S Rudich Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 324 | 1988 |

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 | 316 | 1994 |

The expressive power of voting polynomials J Aspnes, R Beigel, M Furst, S Rudich Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991 | 257 | 1991 |

Representing Boolean functions as polynomials modulo composite numbers DAM Barrington, R Beigel, S Rudich Computational Complexity 4 (4), 367-382, 1994 | 114 | 1994 |

Learning a hidden matching N Alon, R Beigel, S Kasif, S Rudich, B Sudakov SIAM Journal on Computing 33 (2), 487-501, 2004 | 105 | 2004 |

Limitson the Provable Consequences of One-way Functions. S Rudich | 98 | 1988 |

Fast learning of *k*-term DNF formulas with queriesA Blum, S Rudich Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 97 | 1992 |

Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001 | 80 | 2001 |

Computational complexity theory S Rudich, A Wigderson American Mathematical Soc., 2004 | 59 | 2004 |

The Use of Interaction in Public Cryptosystems. extended abstract S Rudich Advances in Cryptology—CRYPTO’91: Proceedings 11, 242-251, 1992 | 58 | 1992 |

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 | 57 | 1998 |

Reducing the complexity of reductions M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich Computational Complexity 10 (2), 117-138, 2001 | 49 | 2001 |

Super-bits, demi-bits, and *NP/qpoly*-natural proofsS Rudich Randomization and Approximation Techniques in Computer Science …, 1997 | 47 | 1997 |

On the complexity of ranking LA Hemachandra, S Rudich Journal of Computer and System Sciences 41 (2), 251-271, 1990 | 38 | 1990 |

Inferring the structure of a Markov chain from its output S Rudich 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 321-326, 1985 | 34 | 1985 |