Randomness extractors -- applications and constructions

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.

• Type: Conference
• Year: 2009
• Where: FSTTCS
• Authors: Avi Wigderson
• Keywords: FSTTCS 2009, Randomness Extractors, Strong Pseudorandom Properties, Theoretical Computer Science, Weak Random Sources