Conference Representing boolean functions as polynomials modulo composite numbers 1992 • Annual ACM Symposium on Theory of Computing • Part F129722:455-461 Barrington DAM, Beigel R, Rudich S
Conference THE USE OF INTERACTION IN PUBLIC CRYPTOSYSTEMS 1992 • Lecture Notes in Computer Science • 576:242-251 RUDICH S
Journal Article THE USE OF INTERACTION IN PUBLIC CRYPTOSYSTEMS 1992 • Lecture Notes in Computer Science • 576:242-251 RUDICH S
Conference Communication complexity towards lower bounds on circuit depth 1991 • Annual Symposium on Foundations of Computer Science • 249-257 Edmonds J, Impagliazzo R, Rudich S, Sgall J
Conference The expressive power of voting polynomials 1991 • Annual ACM Symposium on Theory of Computing • Part F130073:402-409 Aspnes J, Beigelt R, Furst M, Rudich S
Conference Limits on the provable consequences of one-way permutations 1990 • Lecture Notes in Computer Science • 403 LNCS:9-26 Impagliazzo R, Rudich S
Chapter Limits on the Provable Consequences of One-way Permutations 1990 • Lecture Notes in Computer Science • 403:8-26 Impagliazzo R, Rudich S
Journal Article ON THE COMPLEXITY OF RANKING 1990 • Journal of Computer and System Sciences • 41(2):251-271 HEMACHANDRA LA, RUDICH S
Conference Limits on the provable consequences of one-way permutations 1989 44-61 Impagliazzo R, Rudich S
Conference On dice and coins: models of computation for random generation 1989 • Lecture Notes in Computer Science • 372 LNCS:319-340 Feldman D, Impagliazzo R, Naor M, Nisan N, Rudich S, Shamir A
Conference Implicit representation of graphs 1988 • Annual ACM Symposium on Theory of Computing • 334-343 Kannan S, Naor M, Rudich S
Chapter Optimal circuits and transitive automorphism groups 1988 • Lecture Notes in Computer Science • 317:516-524 Rudich S, Berman L
Conference INFERRING THE STRUCTURE OF A MARKOV CHAIN FROM ITS OUTPUT. 1985 • Annual Symposium on Foundations of Computer Science • 321-326 Rudich S
Conference The bit extraction problem or t-resilient functions 1985 • Annual Symposium on Foundations of Computer Science • 396-407 Chor B, Goldreich O, Hasted J, Freidmann J, Rudich S, Smolensky R
