LIPIcs.FSTTCS.2009.2340.pdf
- Filesize: 118 kB
- 3 pages
Document
Randomness extractors -- applications and constructions
Author
-
Part of:
Volume:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-12-14
Cite AsGet BibTex
Avi Wigderson. Randomness extractors -- applications and constructions. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 471-473, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2340
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2340
Abstract
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the
applications, as well as recent constructions achieving near-optimal
extraction.
Keywords
- Randomness extractors
- weak random sources
- purification of randomness
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads