The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) - Benny Chor; Oded Goldreich 001; Johan Håstad; Joel Friedman; Steven Rudich; Roman Smolensky (FOCS, 1985)

Inferring the Structure of a Markov Chain from its Output - Steven Rudich (FOCS, 1985)

Optimal Circuits and Transitive Automorphism Groups. - Steven Rudich; Leonard Berman (ICALP, 1988)

Limits on the Provable Consequences of One-Way Permutations - Russell Impagliazzo; Steven Rudich (STOC, 1989)

The Wakeup Problem (Extended Abstract) - Michael J. Fischer; Shlomo Moran; Steven Rudich; Gadi Taubenfeld (STOC, 1990)

On the Complexity of Ranking. - Lane A. Hemachandra; Steven Rudich (J. Comput. Syst. Sci., 1990)

The Use of Interaction in Public Cryptosystems (Extended Abstract). - Steven Rudich (CRYPTO, 1991)

Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) - David A. Mix Barrington; Richard Beigel; Steven Rudich (STOC, 1992)

Implicit Representation of Graphs. - Sampath Kannan; Moni Naor; Steven Rudich (SIAM J. Discret. Math., 1992)

On Dice and Coins: Models of Computation for Random Generation - David Feldman; Russell Impagliazzo; Moni Naor; Noam Nisan; Steven Rudich; Adi Shamir (Inf. Comput., 1993)

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)

Representing Boolean Functions as Polynomials Modulo Composite Numbers. - David A. Mix Barrington; Richard Beigel; Steven Rudich (Comput. Complex., 1994)

The Expressive Power of Voting Polynomials. - James Aspnes; Richard Beigel; Merrick L. Furst; Steven Rudich (Comb., 1994)

Fast Learning of k-Term DNF Formulas with Queries. - Avrim Blum; Steven Rudich (J. Comput. Syst. Sci., 1995)

The Wakeup Problem. - Michael J. Fischer; Shlomo Moran; Steven Rudich; Gadi Taubenfeld (SIAM J. Comput., 1996)

The future of computational complexity theory: part II. - Eric Allender; Joan Feigenbaum; Judy Goldsmith; Toniann Pitassi; Steven Rudich (SIGACT News, 1996)

Super-bits, Demi-bits, and NP/qpoly-natural Proofs. - Steven Rudich (RANDOM, 1997)

Natural Proofs. - Alexander A. Razborov; Steven Rudich (J. Comput. Syst. Sci., 1997)

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. - Manindra Agrawal; Eric Allender; Steven Rudich (J. Comput. Syst. Sci., 1998)

Products and Help Bits in Decision Trees. - Noam Nisan; Steven Rudich; Michael E. Saks (SIAM J. Comput., 1999)

Reducing the complexity of reductions. - Manindra Agrawal; Eric Allender; Russell Impagliazzo; Toniann Pitassi; Steven Rudich (Comput. Complex., 2001)

Communication complexity towards lower bounds on circuit depth. - Jeff Edmonds; Russell Impagliazzo; Steven Rudich; Jirí Sgall (Comput. Complex., 2001)

On the (Im)possibility of Obfuscating Programs - Boaz Barak; Oded Goldreich 001; Russell Impagliazzo; Steven Rudich; Amit Sahai; Salil P. Vadhan; Ke Yang 005 (Electron. Colloquium Comput. Complex., 2001)

Complexity theory: From Gödel to Feynman. - Steven Rudich (Computational Complexity Theory, 2004)

Learning a Hidden Matching. - Noga Alon; Richard Beigel; Simon Kasif; Steven Rudich; Benny Sudakov (SIAM J. Comput., 2004)