| 2004 |
|---|
| 17 | Learning a Hidden Matching. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov. SIAM J. Comput. (33): 487-501 (2004). Web SearchBibTeXDownload |
| 2002 |
|---|
| 16 | Learning a Hidden Matching. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov. FOCS 2002, 197. Web SearchBibTeXDownload |
| 2001 |
|---|
| 15 | Communication complexity towards lower bounds on circuit depth. Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall. Computational Complexity (10): 210-246 (2001). Web SearchBibTeXDownload |
| 14 | On the (Im)possibility of Obfuscating Programs. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang. CRYPTO 2001, 1-18. Web SearchBibTeXDownload |
| 1996 |
|---|
| 13 | The Wakeup Problem. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld. SIAM J. Comput. (25): 1331-1332 (1996). Web SearchBibTeXDownload |
| 12 | The future of computational complexity theory: part II. Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich. SIGACT News (27): 3-7 (1996). Web SearchBibTeXDownload |
| 1995 |
|---|
| 11 | Fast Learning of k-Term DNF Formulas with Queries. Avrim Blum, Steven Rudich. J. Comput. Syst. Sci. (51): 367-373 (1995). Web SearchBibTeXDownload |
| 1994 |
|---|
| 10 | The Expressive Power of Voting Polynomials. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich. Combinatorica (14): 135-148 (1994). Web SearchBibTeXDownload |
| 9 | Weakly learning DNF and characterizing statistical query learning using Fourier analysis. Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich. STOC 1994, 253-262. Web SearchBibTeXDownload |
| 1993 |
|---|
| 8 | On Dice and Coins: Models of Computation for Random Generation. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir. Inf. Comput. (104): 159-174 (1993). Web SearchBibTeXDownload |
| 1992 |
|---|
| 7 | Implicit Representation of Graphs. Sampath Kannan, Moni Naor, Steven Rudich. SIAM J. Discrete Math. (5): 596-603 (1992). Web SearchBibTeXDownload |
| 6 | Fast Learning of k-Term DNF Formulas with Queries. Avrim Blum, Steven Rudich. STOC 1992, 382-389. Web SearchBibTeXDownload |
| 1991 |
|---|
| 5 | Communication Complexity Towards Lower Bounds on Circuit Depth. Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall. FOCS 1991, 249-257. Web SearchBibTeXDownload |
| 4 | The Expressive Power of Voting Polynomials. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich. STOC 1991, 402-409. Web SearchBibTeXDownload |
| 1990 |
|---|
| 3 | The Wakeup Problem (Extended Abstract). Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld. STOC 1990, 106-116. Web SearchBibTeXDownload |
| 1989 |
|---|
| 2 | On Dice and Coins: Models of Computation for Random Generation. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir. ICALP 1989, 319-340. Web SearchBibTeXDownload |
| 1988 |
|---|
| 1 | Implicit Representation of Graphs. Sampath Kannan, Moni Naor, Steven Rudich. STOC 1988, 334-343. Web SearchBibTeXDownload |
