Documents Related by Co-Citation

137 A fast Monte-Carlo test for primality – R Solovay, V Strassen - 1977
192 A probabilistic algorithm for testing primality – Michael Rabin - 1980
8 Pseudorandom walks in biregular graphs and the RL vs. L problem – O Reingold, L Trevisan, S Vadhan - 2005
6 Asymptotic behavior of the random 3-regular bipartite graph, preprint – T Novikoff
317 Non-Sunada Graphs – Robert Brooks, In Memory Of Hubert Pesce, M Quotients Of M - 1998
43 Explicit Construction of Expanders – G A Margulis - 1973
222 Explicit group theoretic constructions of combinatorial schemes and their application to the design of expanders and concentrators – G Margulis - 1988
125 Entropy waves, the zig-zag graph product, and new constant-degree expanders – Omer Reingold, Salil Vadhan, Avi Wigderson - 2002
275 Expander Codes – Michael Sipser, Daniel A. Spielman - 1996
92 A proof of Alon’s second eigenvalue conjecture – Joel Friedman - 2003
74 Derandomized graph products – Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman - 1995
143 Undirected st-connectivity in log-space – O Reingold - 2005
90 Random walk in random groups – M Gromov - 2003
207 Riemann’s hypothesis and tests for primality – Gary L Miller - 1976
107 On distinguishing prime numbers from composite numbers – L M Adleman, C Pomerance, R S Rumely - 1983
706 Factoring polynomials with rational coefficients – A. K. Lenstra, H. W. Lenstra - 1982
526 Introduction to the Theory of Computation – Michael Sipser - 1997
167 Clique is hard to approximate within |V | 1−ɛ – J H˚astad - 1999
467 Reducibility among combinatorial problems,” in Complexity of computer computations – R M Karp - 1972