Randomness-optimal sampling, extractors, and constructive leader election

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 286-295

  Zuckerman, David ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY CONSTANTS; CONSTANT FACTORS; EXTRACTOR CONSTRUCTION; FULL INFORMATIONS; LEADER ELECTION; OPTIMAL EXTRACTORS; OPTIMAL SAMPLING; POLYNOMIAL LENGTH;

COMPUTATION THEORY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

CONSTRUCTIVE LEADER ELECTION; EXTRACTORS; INTERACTIVE PROOFS; OBLIVIOUS SAMPLERS; OPTIMAL SAMPLING; RANDOMNESS;

EID: 0029703647     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237878     Document Type: Conference Paper

References (31)

1. M. Ajtai, J. Komlós, and E. Szemerédi. Deterministic simulation in Logspace. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 132-140, 1987.
2. N. Alon and M. Naor. Coin-flipping games immune against linear-sized coalitions. SIAM Journal on Computing, 22:403-417, 1993.
3. R. Armoni and A. Wigderson. Pseudorandomness for space-bounded computations. Unpublished manuscript.
4. M. Bellare, O. Goldreich, and S. Goldwasser. Randomness in interactive proofs. Computational Complexity, 3(4):319-354, 1993.
5. M. Blum. Independent unbiased coin flips from a correlated biased source: a finite Markov chain. Combinatorica, 6(2):97-108, 1986.
6. R. Boppana and B. Narayanan. Perfectinformation leader election with optimal resilience. Unpublished manuscript.
7. M. Bellare and J. Rompel. Randomnessefficient oblivious sampling. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 276-287, 1994.
8. R. Canetti, G. Even, and O. Goldreich. Lower bounds for sampling algorithms for estimating the average. Information Processing Letters, 53:17-25, 1995.
9. 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.
10. B. Chor and O. Goldreich. On the power of two-point sampling. Journal of Complexity, 5:96-106, 1989.
11. B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pages 396-407, 1985.
12. J. Cooper and N. Linial. Fast perfectinformation leader-election protocol with linear immunity. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 662-671, 1993.
13. A. Cohen and A. Wigderson. Dispersers, deterministic amplification, and weak random sources. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 14-19, 1989.
14. P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 148-161, 1988.
15. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 248-253, 1989.
16. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4):1036-1053, 1986.
17. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
18. N. Nisan and D. Zuckerman. More deterministic simulation in Logspace. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 235-244, 1993. To appear in JCSS under the title "Randomness is Linear in Space".
19. R. Ostrovsky, S. Rajagopalan, and U. Vazirani. Simple and efficient leader election in the full information model. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 234-242, 1994.
20. M. Saks. A robust noncryptographic protocol for collective coin flipping. SIAM Journal on Discrete Mathematics, 6:240-244, 1989.
21. M. Santha. On using deterministic functions in probabilistic algorithms. Information and Computation, 74(3):241-249, 1987.
22. M. Sipser. Expanders, randomness or time vs. space. Journal of Computer and System Sciences, 36:379-383, 1988.
23. M. Saks, A. Srinivasan, and S. Zhou. Explicit dispersers with polylog degree. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 479-488, 1995.
24. M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33:75-87, 1986.
25. A. Srinivasan and D. Zuckerman. Computing with very weak random sources. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 264-275, 1994.
26. A. Ta-Shma. On extracting randomness from weak random sources. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996.
27. A. Wigderson and D. Zuckerman. Expanders that beat the eigenvalue bound: Explicit construction and applications. Technical Report TR-95-21, Department of Computer Sciences, The University of Texas at Austin, June 1995.
28. Submitted for journal publication. Preliminary version appeared in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 245-251, 1993
29. D. Zuckerman. General weak random sources. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 534-543, 1990.
30. D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica. To appear.
31. Preliminary version in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 79-89, 1991.