default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven Rudich
2010 – 2019
- 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:1-6:48 (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) - [p1]Steven Rudich:
Complexity theory: From Gödel to Feynman. Computational Complexity Theory 2004: 5-87 - [e1]Steven Rudich, Avi Wigderson:
Computational Complexity Theory. IAS / Park City mathematics series 10, AMS Chelsea Publishing 2004, ISBN 978-0-8218-2872-4 [contents] - 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. Comput. Complex. 10(2): 117-138 (2001) - [j12]Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jirí Sgall:
Communication complexity towards lower bounds on circuit depth. Comput. Complex. 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. Electron. Colloquium Comput. Complex. TR01 (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 Cryptol. ePrint Arch. 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]Alexander A. Razborov, Steven Rudich:
Natural Proofs. J. Comput. Syst. Sci. 55(1): 24-35 (1997) - [c18]Steven Rudich:
Super-bits, Demi-bits, and NP/qpoly-natural Proofs. RANDOM 1997: 85-93 - [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. Comput. Complex. 4: 367-382 (1994) - [j4]James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich:
The Expressive Power of Voting Polynomials. Comb. 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]Alexander A. Razborov, Steven Rudich:
Natural proofs. STOC 1994: 204-213 - [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. Electron. Colloquium Comput. Complex. TR94 (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. Discret. Math. 5(4): 596-603 (1992) - [c13]Avrim Blum, Steven Rudich:
Fast Learning of k-Term DNF Formulas with Queries. STOC 1992: 382-389 - [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, Jirí 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]Sampath Kannan, Moni Naor, Steven Rudich:
Implicit Representation of Graphs. STOC 1988: 334-343 - 1985
- [c2]Steven Rudich:
Inferring the Structure of a Markov Chain from its Output. FOCS 1985: 321-326 - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
