Abstract
An extractor is an algorithm which, on input a long string from a defective random source and a short truly random string, outputs a long almost-random string. In this talk, we survey extractors for weak random sources and their applications.
Supported in part by NSF NYI Grant No. CCR-9457799, a David and Lucile Packard Fellowship for Science and Engineering, and an Alfred P. Sloan Research Fellowship.
This is a preview of subscription content, log in via an institution to check access.
References
A. E. Andreev, A. E. F. Clementi, J. P. D. Rolim, and L. Trevisan. Weak random sources, hitting sets, and BPP simulations. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 264–272, 1997.
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.
O. Goldreich and D. Zuckerman. Another proof that BPP 157-1 PH (and more). Technical Report TR97-045, Electronic Colloquium on Computational Complexity, 1997.
R. Motwani and Prabhakar Raghavan. Randomized Algorithms. MIT Press, 1995.
N. Nisan. Extracting randomness: How and why — a survey. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 44–58, 1996.
N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43–52, 1996.
A. Russell and D. Zuckerman. Hyper-fast leader election protocols in the perfect information model. Unpublished manuscript, 1998.
M. Sipser. Expanders, randomness, or time vs. space. Journal of Computer and System Sciences, 36:379–383, 1988.
M. Saks, A. Srinivasan, and S. Zhou. Explicit OR-dispersers with polylog degree. Journal of the ACM, 45:123–154, 1998.
M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33:75–87, 1986.
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. To appear in SIAM Journal on Computing.
A. Ta-Shma. On extracting randomness from weak random sources. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 276–285, 1996.
A. Wigderson and D. Zuckerman. Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica. To appear. Revised version appears as Technical Report TR-95-21, Department of Computer Sciences, The University of Texas at Austin, June 1995. Preliminary version in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 245–251, 1993.
D. Zuckerman. General weak random sources. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 534–543, 1990.
D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16:367–391, 1996.
D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures and Algorithms, 11:345–367, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zuckerman, D. (1998). Extractors for weak random sources and their applications. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054363
Download citation
DOI: https://doi.org/10.1007/BFb0054363
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64682-2
Online ISBN: 978-3-540-69106-8
eBook Packages: Springer Book Archive