Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Steven Rudich
2010 – today
- 2012
[j15]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (im)possibility of obfuscating programs. J. ACM 59(2): 6 (2012)
2000 – 2009
- 2004
- [j14]Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov: Learning a Hidden Matching. SIAM J. Comput. 33(2): 487-501 (2004)
- 2002
- [c20]Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov: Learning a Hidden Matching. FOCS 2002: 197-
- 2001
- [j13]Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the complexity of reductions. Computational Complexity 10(2): 117-138 (2001)
- [j12]Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall: Communication complexity towards lower bounds on circuit depth. Computational Complexity 10(3): 210-246 (2001)
- [c19]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs. CRYPTO 2001: 1-18
- [i3]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs. Electronic Colloquium on Computational Complexity (ECCC) 8(057) (2001)
- [i2]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs. IACR Cryptology ePrint Archive 2001: 69 (2001)
1990 – 1999
- 1999
- [j11]Noam Nisan, Steven Rudich, Michael E. Saks: Products and Help Bits in Decision Trees. SIAM J. Comput. 28(3): 1035-1050 (1999)
- 1998
- [j10]Manindra Agrawal, Eric Allender, Steven Rudich: Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. J. Comput. Syst. Sci. 57(2): 127-143 (1998)
- 1997
- [j9]
- [c18]
- [c17]Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the Complexity of Reductions. STOC 1997: 730-738
- 1996
- [j8]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem. SIAM J. Comput. 25(6): 1331-1332 (1996)
- [j7]Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich: The future of computational complexity theory: part II. SIGACT News 27(4): 3-7 (1996)
- 1995
- [j6]Avrim Blum, Steven Rudich: Fast Learning of k-Term DNF Formulas with Queries. J. Comput. Syst. Sci. 51(3): 367-373 (1995)
- 1994
- [j5]David A. Mix Barrington, Richard Beigel, Steven Rudich: Representing Boolean Functions as Polynomials Modulo Composite Numbers. Computational Complexity 4: 367-382 (1994)
- [j4]James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich: The Expressive Power of Voting Polynomials. Combinatorica 14(2): 135-148 (1994)
- [c16]Noam Nisan, Steven Rudich, Michael E. Saks: Products and Help Bits in Decision Trees. FOCS 1994: 318-329
- [c15]
- [c14]Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich: Weakly learning DNF and characterizing statistical query learning using Fourier analysis. STOC 1994: 253-262
- [i1]Alexander A. Razborov, Steven Rudich: Natural Proofs. Electronic Colloquium on Computational Complexity (ECCC) 1(10) (1994)
- 1993
- [j3]David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation. Inf. Comput. 104(2): 159-174 (1993)
- 1992
- [j2]Sampath Kannan, Moni Naor, Steven Rudich: Implicit Representation of Graphs. SIAM J. Discrete Math. 5(4): 596-603 (1992)
- [c13]
- [c12]David A. Mix Barrington, Richard Beigel, Steven Rudich: Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract). STOC 1992: 455-461
- 1991
- [c11]Steven Rudich: The Use of Interaction in Public Cryptosystems (Extended Abstract). CRYPTO 1991: 242-251
- [c10]Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall: Communication Complexity Towards Lower Bounds on Circuit Depth. FOCS 1991: 249-257
- [c9]James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich: The Expressive Power of Voting Polynomials. STOC 1991: 402-409
- 1990
- [j1]Lane A. Hemachandra, Steven Rudich: On the Complexity of Ranking. J. Comput. Syst. Sci. 41(2): 251-271 (1990)
- [c8]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem (Extended Abstract). STOC 1990: 106-116
1980 – 1989
- 1989
- [c7]David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation. ICALP 1989: 319-340
- [c6]Russell Impagliazzo, Steven Rudich: Limits on the Provable Consequences of One-Way Permutations. STOC 1989: 44-61
- 1988
- [c5]Russell Impagliazzo, Steven Rudich: Limits on the Provable Consequences of One-way Permutations. CRYPTO 1988: 8-26
- [c4]Steven Rudich, Leonard Berman: Optimal Circuits and Transitive Automorphism Groups. ICALP 1988: 516-524
- [c3]
- 1985
- [c2]
- [c1]Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky: The Bit Extraction Problem of t-Resilient Functions (Preliminary Version). FOCS 1985: 396-407
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:41 CET by the dblp team