|Computer Science/Discrete Mathematics Seminar II|
|Topic:||Randomness Extraction: A Survey|
|Affiliation:||University of Texas at Austin; Member, School of Mathematics|
|Date:||Tuesday, February 7|
|Time/Room:||10:30am - 12:30pm/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.