Computer Science/Discrete Mathematics Seminar II

Randomness Extraction: A Survey
Series: 
Computer Science/Discrete Mathematics
David Zuckerman
University of Texas at Austin; Member, School of Mathematics
Date & Time: 
Tue, 02/07/2012 - 10:30 - 12:30
Location: 
S-101

A randomness extractor is an efficient algorithm which extracts high-quality randomness from a low-quality random source. Randomness extractors have important applications in a wide variety of areas, including pseudorandomness, cryptography, expander graphs, coding theory, and inapproximability. In this talk, we survey the field of randomness extraction and discuss connections with other areas.