Document Open Access Logo

Randomness extractors -- applications and constructions

Author Avi Wigderson

Thumbnail PDF


  • Filesize: 118 kB
  • 3 pages

Document Identifiers

Author Details

Avi Wigderson

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)


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.
  • Randomness extractors
  • weak random sources
  • purification of randomness


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail