`Travelled to:`

1 × Finland

1 × Italy

2 × Canada

5 × USA

`Collaborated with:`

R.Impagliazzo A.Blum R.Beigel A.A.Razborov M.Naor L.Berman M.L.Furst D.A.M.Barrington S.Kannan J.Aspnes M.J.Fischer S.Moran G.Taubenfeld M.Agrawal E.Allender T.Pitassi J.C.Jackson M.J.Kearns Y.Mansour D.Feldman N.Nisan A.Shamir

`Talks about:`

learn (3) polynomi (2) queri (2) dnf (2) represent (1) character (1) automorph (1) implicit (1) function (1) composit (1)

## Person: Steven Rudich

### DBLP: Rudich:Steven

### Contributed to:

### Wrote 11 papers:

- STOC-1997-AgrawalAIPR #complexity #reduction
- Reducing the Complexity of Reductions (MA, EA, RI, TP, SR), pp. 730–738.
- STOC-1994-BlumFJKMR #analysis #fourier #learning #query #statistics #using
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis (AB, MLF, JCJ, MJK, YM, SR), pp. 253–262.
- STOC-1994-RazborovR #proving
- Natural proofs (AAR, SR), pp. 204–213.
- STOC-1992-BarringtonBR #representation
- Representing Boolean Functions as Polynomials Modulo Composite Numbers (DAMB, RB, SR), pp. 455–461.
- STOC-1992-BlumR #learning #performance #query
- Fast Learning of k-Term DNF Formulas with Queries (AB, SR), pp. 382–389.
- STOC-1991-AspnesBFR #power of
- The Expressive Power of Voting Polynomials (JA, RB, MLF, SR), pp. 402–409.
- STOC-1990-FischerMRT #problem
- The Wakeup Problem (MJF, SM, SR, GT), pp. 106–116.
- ICALP-1989-FeldmanINNRS #generative #modelling #on the #random
- On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.
- STOC-1989-ImpagliazzoR #permutation
- Limits on the Provable Consequences of One-Way Permutations (RI, SR), pp. 44–61.
- ICALP-1988-RudichB #morphism #transitive
- Optimal Circuits and Transitive Automorphism Groups (SR, LB), pp. 516–524.
- STOC-1988-KannanNR #graph #representation
- Implicit Representation of Graphs (SK, MN, SR), pp. 334–343.