The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Steven Rudich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander A. Razborov, Steven Rudich
    Natural Proofs. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:1, pp:24-35 [Journal]
  2. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:1-18 [Conf]
  3. Russell Impagliazzo, Steven Rudich
    Limits on the Provable Consequences of One-way Permutations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:8-26 [Conf]
  4. Steven Rudich
    The Use of Interaction in Public Cryptosystems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:242-251 [Conf]
  5. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
    Learning a Hidden Matching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:197-0 [Conf]
  6. Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
    The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:396-407 [Conf]
  7. Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall
    Communication Complexity Towards Lower Bounds on Circuit Depth [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:249-257 [Conf]
  8. Noam Nisan, Steven Rudich, Michael E. Saks
    Products and Help Bits in Decision Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:318-329 [Conf]
  9. Steven Rudich
    Inferring the Structure of a Markov Chain from its Output [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:321-326 [Conf]
  10. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
    On Dice and Coins: Models of Computation for Random Generation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:319-340 [Conf]
  11. Steven Rudich, Leonard Berman
    Optimal Circuits and Transitive Automorphism Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:516-524 [Conf]
  12. Steven Rudich
    Super-bits, Demi-bits, and NP/qpoly-natural Proofs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:85-93 [Conf]
  13. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
    Reducing the Complexity of Reductions. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:730-738 [Conf]
  14. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
    The Expressive Power of Voting Polynomials [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:402-409 [Conf]
  15. David A. Mix Barrington, Richard Beigel, Steven Rudich
    Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:455-461 [Conf]
  16. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:253-262 [Conf]
  17. Avrim Blum, Steven Rudich
    Fast Learning of k-Term DNF Formulas with Queries [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:382-389 [Conf]
  18. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
    The Wakeup Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:106-116 [Conf]
  19. Russell Impagliazzo, Steven Rudich
    Limits on the Provable Consequences of One-Way Permutations [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:44-61 [Conf]
  20. Sampath Kannan, Moni Naor, Steven Rudich
    Implicit Representation of Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:334-343 [Conf]
  21. Alexander A. Razborov, Steven Rudich
    Natural proofs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:204-213 [Conf]
  22. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
    Reducing the complexity of reductions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:117-138 [Journal]
  23. Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall
    Communication complexity towards lower bounds on circuit depth. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:3, pp:210-246 [Journal]
  24. David A. Mix Barrington, Richard Beigel, Steven Rudich
    Representing Boolean Functions as Polynomials Modulo Composite Numbers. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:367-382 [Journal]
  25. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
    The Expressive Power of Voting Polynomials. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:135-148 [Journal]
  26. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:057, pp:- [Journal]
  27. Alexander A. Razborov, Steven Rudich
    Natural Proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:10, pp:- [Journal]
  28. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
    On Dice and Coins: Models of Computation for Random Generation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:159-174 [Journal]
  29. Manindra Agrawal, Eric Allender, Steven Rudich
    Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:2, pp:127-143 [Journal]
  30. Avrim Blum, Steven Rudich
    Fast Learning of k-Term DNF Formulas with Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:367-373 [Journal]
  31. Lane A. Hemachandra, Steven Rudich
    On the Complexity of Ranking. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:2, pp:251-271 [Journal]
  32. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
    Learning a Hidden Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:487-501 [Journal]
  33. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
    The Wakeup Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1331-1332 [Journal]
  34. Noam Nisan, Steven Rudich, Michael E. Saks
    Products and Help Bits in Decision Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:3, pp:1035-1050 [Journal]
  35. Sampath Kannan, Moni Naor, Steven Rudich
    Implicit Representation of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:596-603 [Journal]

Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002