Extractors with weak random seeds

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 11-20

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Condensers; Explicit Constructions; Extractors; Mergers; Pseudorandomness; Ramsey Graphs; Random Sources; Randomness Extraction

Indexed keywords

EXPLICIT CONSTRUCTIONS; EXTRACTORS; MERGERS; PSEUDORANDOMNESS; RAMSEY GRAPHS; RANDOM SOURCES; RANDOMNESS EXTRACTION;

CAPACITORS; ENTROPY; ERROR ANALYSIS; GRAPH THEORY; PROBABILITY;

RANDOM PROCESSES;

EID: 34848882226     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060593     Document Type: Conference Paper

References (23)

1. Noga Alon. Tools from Higher Algebra. In Handbook of Combinatorics, R.L. Graham, M. Grotschel and L. Lovasz, eds, North Holland (1995), Chapter 32: 1749-1783
2. Noga Alon, Oded Goldreich, Johan Hastad, Rene Peralta. Simple Construction of Almost k-wise Independent Random Variables. Random Struct. Algorithms 3(3): 289-304 (1992)
3. Noga Alon, Oded Goldreich, Johan Hastad, Rene Peralta. Addendum to "Simple Construction of Almost k-wise Independent Random Variables". Random Struct. Algorithms 4(1): 119-120 (1993)
4. Boaz Barak, Russell Impagliazzo, Avi Wigderson. Extracting Randomness from Few Independent Sources. FOCS 2004: 384-393
5. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers and Extractors. STOC 2005 (this proceeding)
6. Benny Chor, Oded Goldreich. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comput. 17(2): 230-261 (1988)
7. Yevgeniy Dodis, Roberto Oliveira. On Extracting Private Randomness over a Public Channel. RANDOM-APPROX 2003: 252-263
8. Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz. Improved Randomness Extraction from Two Independent Sources. RANDOM-APPROX 2004: 334-344
9. Oded Goldreich. Three XOR-Lemmas - An Exposition. Electronic Colloquium on Computational Complexity (ECCC) 2(56): (1995)
10. Ronald Graham, Joel Spencer. A Constructive Solution to a Tournament Problem. Canad. Math. Bull. 14: 45-48 (1971)
11. Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson. Extractors: Optimal up to Constant Factors. STOC 2003: 602-611
12. Joseph Naor, Moni Naor. Small-bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22(4): 838-856 (1993)
13. Noam Nisan, Amnon Ta-Shma. Extracting Randomness: A Survey and New Constructions. J. Comput. Syst. Sci. 58(1): 148-173 (1999)
14. Noam Nisan, David Zuckerman. Randomness is Linear in Space. J. Comput. Syst. Sci. 52(1): 43-52 (1996)
15. Ran Raz, Omer Reingold, Salil P. Vadhan. Error Reduction for Extractors. FOCS 1999: 191-201
16. Ronen Shaltiel. Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS 77: 67-95 (2002)
17. Amnon Ta-Shma. On Extracting Randomness From Weak Random Sources. STOC 1996: 276-285
18. Luca Trevisan, Salil P. Vadhan. Extracting Randomness from Samplable Distributions. FOCS 2000: 32-42
19. Salil P. Vadhan. Randomness Extractors and their Many Guises (Tutorial given at FOCS 2002). http://www.eecs.harvard.edu/~salil/extractors-focs02.ppt
20. Umesh V. Vazirani. Strong Communication Complexity or Generating Quasirandom Sequences form Two Communicating Semi-Random Sources. Combinatorica 7(4): 375-392 (1987)
21. Umesh V. Vazirani. Efficiency Considerations in Using Semi-Random Sources. STOC 1987: 160-168
22. Avi Wigderson, David Zuckerman. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. Combinatorica 19(1): 125-138 (1999)
23. David Zuckerman. Randomness-Optimal Oblivious Sampling. Random Struct. Algorithms 11(4): 345-367 (1997)