On extracting randomness from weak random sources

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 276-285

  Ta Shma, Amnon ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ENTROPY; MERGERS AND ACQUISITIONS; FUNCTIONS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; STATISTICAL METHODS;

MIN-ENTROPY; RANDOM SOURCES;

RANDOM PROCESSES; COMPUTATION THEORY;

EXTRACTORS; MERGER; MIN ENTROPY;

EID: 0029703427     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237877     Document Type: Conference Paper

References (12)

1. M. Ajtai, J. Komlos, W. Steiger, and E. Szemeredi. Almost sorting in one round. In Advances in Computer Research, volume 5, pages 117-125, 1989.
2. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, 1988.
3. O. Goldreich and A. Wigderson. Tiny families of functions with random properties: A quality-size trade-off for hashing. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM, pages 574-583, 1994.
4. N. Nisan and D. Zuckerman. More deterministic simulation in logspace. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, ACM, pages 235-244, 1993.
5. N. Pippenger. Sorting and selecting in rounds. SIAM Journal on Computing, 16:1032-1038, 1987.
6. M. Saks, A. Srinivasan, and S. Zhou. Explicit dispersers with polylog degree. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM, 1995.
7. A. Srinivasan and D. Zuckerman. Computing with very weak random sources. In Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, 1994.
8. A. Wigderson and D. Zuckerman. Expanders that beat the eigenvalue bound: Explicit construction and applications. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, ACM, pages 245-251, 1993.
9. D. Zuckerman. Randomness-optimal sampling, extractors, and constructive leader election. Private Communication.
10. D. Zuckerman. General weak random sources. In Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, pages 534-543, 1990.
11. D. Zuckerman. Simulating BPP using a general weak random source. In Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science, pages 79-89, 1991.
12. D. Zuckerman. NP-complete problems have a version that's hard to approximate. In Proceedings of the 8th Structures in Complexity Theory, IEEE, pages 305-312, 1993.