dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Steven Rudich Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2004
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov: Learning a Hidden Matching. SIAM J. Comput. 33(2): 487-501 (2004)
2002
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov: Learning a Hidden Matching. FOCS 2002: 197-
2001
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoaz 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
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the complexity of reductions. Computational Complexity 10(2): 117-138 (2001)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall: Communication complexity towards lower bounds on circuit depth. Computational Complexity 10(3): 210-246 (2001)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoaz 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)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoaz 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)
1999
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoam Nisan, Steven Rudich, Michael E. Saks: Products and Help Bits in Decision Trees. SIAM J. Comput. 28(3): 1035-1050 (1999)
1998
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManindra 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
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteven Rudich: Super-bits, Demi-bits, and NP/qpoly-natural Proofs. RANDOM 1997: 85-93
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the Complexity of Reductions. STOC 1997: 730-738
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Razborov, Steven Rudich: Natural Proofs. J. Comput. Syst. Sci. 55(1): 24-35 (1997)
1996
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem. SIAM J. Comput. 25(6): 1331-1332 (1996)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric 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
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAvrim Blum, Steven Rudich: Fast Learning of k-Term DNF Formulas with Queries. J. Comput. Syst. Sci. 51(3): 367-373 (1995)
1994
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoam Nisan, Steven Rudich, Michael E. Saks: Products and Help Bits in Decision Trees FOCS 1994: 318-329
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Razborov, Steven Rudich: Natural proofs. STOC 1994: 204-213
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAvrim 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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJames Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich: The Expressive Power of Voting Polynomials. Combinatorica 14(2): 135-148 (1994)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid A. Mix Barrington, Richard Beigel, Steven Rudich: Representing Boolean Functions as Polynomials Modulo Composite Numbers. Computational Complexity 4: 367-382 (1994)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Razborov, Steven Rudich: Natural Proofs Electronic Colloquium on Computational Complexity (ECCC) 1(10): (1994)
1993
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid 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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAvrim Blum, Steven Rudich: Fast Learning of k-Term DNF Formulas with Queries STOC 1992: 382-389
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid A. Mix Barrington, Richard Beigel, Steven Rudich: Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) STOC 1992: 455-461
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSampath Kannan, Moni Naor, Steven Rudich: Implicit Representation of Graphs. SIAM J. Discrete Math. 5(4): 596-603 (1992)
1991
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteven Rudich: The Use of Interaction in Public Cryptosystems (Extended Abstract). CRYPTO 1991: 242-251
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall: Communication Complexity Towards Lower Bounds on Circuit Depth FOCS 1991: 249-257
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJames Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich: The Expressive Power of Voting Polynomials STOC 1991: 402-409
1990
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem (Extended Abstract) STOC 1990: 106-116
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemachandra, Steven Rudich: On the Complexity of Ranking. J. Comput. Syst. Sci. 41(2): 251-271 (1990)
1989
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRussell Impagliazzo, Steven Rudich: Limits on the Provable Consequences of One-Way Permutations STOC 1989: 44-61
1988
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRussell Impagliazzo, Steven Rudich: Limits on the Provable Consequences of One-way Permutations. CRYPTO 1988: 8-26
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteven Rudich, Leonard Berman: Optimal Circuits and Transitive Automorphism Groups. ICALP 1988: 516-524
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSampath Kannan, Moni Naor, Steven Rudich: Implicit Representation of Graphs STOC 1988: 334-343
1985
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteven Rudich: Inferring the Structure of a Markov Chain from its Output FOCS 1985: 321-326
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenny 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

1Manindra Agrawal [27] [29] [34]
2Eric Allender [24] [27] [29] [34]
3Noga Alon [36] [37]
4James Aspnes [10] [19]
5Boaz Barak [31] [32] [35]
6David A. Mix Barrington [14] [18]
7Richard Beigel [10] [14] [18] [19] [36] [37]
8Leonard Berman [4]
9Avrim Blum [15] [20] [23]
10Benny Chor [1]
11Jeff Edmonds [11] [33]
12Joan Feigenbaum [24]
13David Feldman [7] [16]
14Michael J. Fischer [9] [25]
15Joel Friedman [1]
16Merrick L. Furst [10] [19] [20]
17Oded Goldreich [1] [31] [32] [35]
18Judy Goldsmith [24]
19Johan Håstad [1]
20Lane A. Hemaspaandra (Lane A. Hemachandra) [8]
21Russell Impagliazzo [5] [6] [7] [11] [16] [27] [31] [32] [33] [34] [35]
22Jeffrey C. Jackson [20]
23Sampath Kannan [3] [13]
24Simon Kasif [36] [37]
25Michael Kearns (Michael J. Kearns, Michael S. Kearns) [20]
26Yishay Mansour [20]
27Shlomo Moran [9] [25]
28Moni Naor [3] [7] [13] [16]
29Noam Nisan [7] [16] [22] [30]
30Toniann Pitassi [24] [27] [34]
31Alexander A. Razborov [17] [21] [26]
32Amit Sahai [31] [32] [35]
33Michael E. Saks (Michael Saks) [22] [30]
34Jiri Sgall [11] [33]
35Adi Shamir [7] [16]
36Roman Smolensky [1]
37Benny Sudakov [36] [37]
38Gadi Taubenfeld [9] [25]
39Salil P. Vadhan [31] [32] [35]
40Ke Yang [31] [32] [35]

Colors in the list of coauthors

Last update Fri Feb 17 00:12:51 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page