137

A Fast MonteCarlo Test for Primality
– R Solovay, V Strassen
 1977

190

Probabilistic algorithm for testing primality
– M O Rabin
 1980

6

Asymptotic behavior of the random 3regular bipartite graph, preprint
– T Novikoff

43

Explicit Construction of Expanders
– G A Margulis
 1973

91

A proof of Alon’s second eigenvalue conjecture
– Joel Friedman
 2003

315

NonSunada Graphs
– Robert Brooks, In Memory Of Hubert Pesce, M Quotients Of M
 1998

218

Explicit grouptheoretic constructions for combinatorial designs with applications expanders and concentrators
– G A Margulis
 1988

9

Pseudorandom walks in biregular graphs and the RL vs. L problem
– O Reingold, L Trevisan, S Vadhan
 2005

125

Entropy waves, the zigzag graph product, and new constantdegree expanders
– Omer Reingold, Salil Vadhan, Avi Wigderson
 2002

280

Expander Codes
– Michael Sipser, Daniel A. Spielman
 1996

74

Derandomized graph products
– Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
 1995

148

Undirected STconnectivity in logspace
– O Reingold
 2008

88

Random walk in random groups
– M Gromov
 1980

207

Riemann’s hypothesis and tests for primality
– G L Miller
 1976

107

On distinguishing prime numbers from composite numbers
– L M Adleman, C Pomerance, R S Rumely
 1983

700

Factoring polynomials with rational coefficients
– A. K. Lenstra, H. W. Lenstra
 1982

526

Introduction to the theory of computation
– M Sipser
 1996

469

Reducibility among combinatorial problems. In Complexity of Computer Computations
– R Karp
 1972

721

Proof verification and hardness of approximation problems
– Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
 1992
