Randomness extractors - Applications and constructions

Avi Wigderson*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publicationFoundations of Software Technology and Theoretical Computer Science, FSTTCS 2009 - 29th Annual Conference, Proceedings
Pages471-473
Number of pages3
DOIs
StatePublished - 2009
Externally publishedYes
Event29th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009 - Kanpur, India
Duration: 15 Dec 200917 Dec 2009

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume4
ISSN (Print)1868-8969

Conference

Conference29th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009
Country/TerritoryIndia
CityKanpur
Period15/12/0917/12/09

Fingerprint

Dive into the research topics of 'Randomness extractors - Applications and constructions'. Together they form a unique fingerprint.

Cite this