Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 3-13

  Reingold, Omer ^a,b   Vadhan, Salil ^c   Wigdersont, Avi ^b,d  

^a AT AND T LABS RESEARCH   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c HARVARD UNIVERSITY   (United States)

^d HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EIGENVALUES AND EIGENFUNCTIONS; PROBABILITY DISTRIBUTIONS;

CONSTANT-DEGREE EXPANDERS;

COMPUTER SCIENCE;

EID: 0034503724     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892006     Document Type: Article

References (46)

1. M. Ajtai Recursive construction for 3-regular expanders Combinatorica 14 4 379 416 1994
2. M. Ajtai J. Komlós E. Szemerédi Deterministic simulation in LOGSPACE Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing 132 140 Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing New York City 1987-May-25-27
3. M. Ajtai J. Komlós E. Szemerédi Sorting in c log n parallel steps Combinatorica 3 1 1 19 1983
4. N. Alon Z. Galil V. D. Milman Better expanders and superconcentrators J. Algorithms 8 3 337 347 1987
5. N. Alon V. D. Milman λ1, isoperimetric inequalities for graphs, and superconcentrators J. Combin. Theory Ser. Β 38 1 73 88 1985
6. N. Alon Eigenvalues and expanders Combinatorica 6 2 83 96 1986
7. M. Bellare J. Rompel Randomness-efficient oblivious sampling 35th Annual Symposium on Foundations of Computer Science 276 287 35th Annual Symposium on Foundations of Computer Science Santa Fe New Mexico 1994-November-20-22
8. M. Blum Independent unbiased coin flips from a correlated biased source—a finite state Markov chain Combinatorica 6 2 97 108 1986
9. R. Canetti G. Even O. Goldreich Lower bounds for sampling algorithms for estimating the average Information Processing Letters 53 1 17 25 13 January 1995
10. B. Chor O. Goldreich Unbiased bits from sources of weak randomness and probabilistic communication complexity SIAM Journal on Computing 17 2 230 261 April 1988
11. B. Chor O. Goldreich On the power of two-point based sampling Journal of Complexity 5 1 96 106 March 1989
12. A. Cohen A. Wigderson Dispersers, deterministic amplification, and weak random sources 30th Annual Symposium on Foundations of Computer Science 14 19 30th Annual Symposium on Foundations of Computer Science Research Triangle Park North Carolina 1989
13. O. Gabber Z. Galil Explicit constructions of linear-sized superconcentrators Journal of Computer and System Sciences 22 3 407 420 June 1981
14. O. Goldreich R. Impagliazzo L. Levin R. Venkatesan D. Zuckerman Security preserving amplification of hardness 31st Annual Symposium on Foundations of Computer Science I 318 326 31st Annual Symposium on Foundations of Computer Science St. Louis Missouri 1990-October-22-24
15. O. Goldreich A. Wigderson Tiny families of functions with random properties: A quality-size trade-off for hashing Random Structures & Algorithms 11 4 315 343 1997
16. R. Impagliazzo N. Nisan A. Wigderson Pseudorandomness for network algorithms Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing 356 364 Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal Canada 1994-May-23-25
17. R. Impagliazzo A. Wigderson Ρ = BPP if E requires exponential circuits: Derandomizing the XOR lemma Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing 220 229 Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing El Paso Texas 1997-May-4-6
18. R. Impagliazzo D. Zuckerman How to recycle random bits 30th Annual Symposium on Foundations of Computer Science 248 253 30th Annual Symposium on Foundations of Computer Science Research Triangle Park North Carolina 1989
19. S. Jimbo A. Maruoka Expanders obtained from affine transformations Combinatorica 7 4 343 355 1987
20. R. Karp N. Pippenger M. Sipser A time-randomness tradeoff AMS Conference on Probabilistic Computational Complexity AMS Conference on Probabilistic Computational Complexity Durham New Hampshire 1985
21. A. Lubotzky R. Phillips P. Sarnak Ramanujan graphs Combinatorica 8 3 261 277 1988
22. G. A. Margulis Explicit constructions of expanders Problemy Peredači Informacii 9 4 71 80 1973
23. G. A. Margulis Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators Problemy Peredachi Informatsii 24 1 51 60 1988
24. M. Morgenstern Existence and explicit constructions of q +1 regular Ramanujan graphs for every prime power q. J. Combin. Theory Ser. B 62 1 44 62 1994
25. J. Naor M. Naor Small-bias probability spaces: Efficient constructions and applications SIAM Journal on Computing 22 4 838 856 August 1993
26. A. Nilli On the second eigenvalue of a graph Discrete Math. 91 2 207 210 1991
27. N. Nisan A. Ta-Shma Extracting randomness: A survey and new constructions Journal of Computer and System Sciences 58 1 148 173 1999
28. N. Nisan D. Zuckerman Randomness is linear in space Journal of Computer and System Sciences 52 1 43 52 February 1996
29. M. Pinsker On the complexity of a concentrator 7th Annual Teletraffic Conference 318/1 318/4 7th Annual Teletraffic Conference Stockholm 1973
30. N. Pippenger A.C. Yao Rearrangeable networks with limited depth SIAM J. Algebraic and Discrete Methods 3 411 417 1982
31. N. Pippenger Sorting and selecting in rounds SIAM Journal on Computing 16 6 1032 1038 December 1987
32. J. Radhakrishnan A. Ta-Shma Tight bounds for depth-two superconcentrators 38th Annual Symposium on Foundations of Computer Science 585 594 38th Annual Symposium on Foundations of Computer Science Miami Beach Florida 1997-October-20-22
33. R. Raz O. Reingold On recycling the randomness of the states in space bounded computation Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing Atlanta GA 1999-May
34. O. Reingold R. Shaltiel A. Wigderson Extracting randomness via repeated condensing 41st Annual Symposium on Foundations of Computer Science 41st Annual Symposium on Foundations of Computer Science Redondo Beach California 2000-November-12-14
35. M. Santha U. V. Vazirani Generating quasi-random sequences from semi-random sources Journal of Computer and System Sciences 33 1 75 87 August 1986
36. M. Sipser Expanders, randomness, or time versus space Journal of Computer and System Sciences 36 3 379 383 June 1988
37. M. Sipser D. A. Spielman Expander codes IEEE Trans. Inform. Theory 42 6 1710 1722 1996
38. D. A. Spielman Linear-time encodable and decodable error-correcting codes IEEE Trans. Inform. Theory 42 6 1723 1731 1996
39. M. R. Tanner Explicit concentrators from generalized n-gons SIAM Journal on Algebraic Discrete Methods 5 3 287 293 1984
40. L. Trevisan Construction of extractors using pseudo-random generators Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing 141 148 Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing Atlanta GA 1999-May
41. A. Urquhart Hard examples for resolution J. Assoc. Comput. Mach. 34 1 209 219 1987
42. L. G. Valiant Mathematical foundations of computer science 53 162 176 1977 Springer Berlin Graph-theoretic arguments in low-level complexity
43. U. V. Vazirani V. V. Vazirani Random polynomial time is equal to slightly-random polynomial time 26th Annual Symposium on Foundations of Computer Science 417 428 26th Annual Symposium on Foundations of Computer Science Portland Oregon 1985-October-21-23
44. A. Wigderson D. Zuckerman Expanders that beat the eigenvalue bound: explicit construction and applications Combinatorica 19 1 125 138 1999
45. D. Zuckerman Simulating BPP using a general weak random source Algorithmica 16 4/5 367 391 October/November 1996
46. D. Zuckerman Randomness-optimal oblivious sampling Random Structures & Algorithms 11 4 345 367 1997