TY - GEN
T1 - Randomness extractors - Applications and constructions
AU - Wigderson, Avi
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84880204247&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.FSTTCS.2009.2340
DO - 10.4230/LIPIcs.FSTTCS.2009.2340
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84880204247
SN - 9783939897132
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 471
EP - 473
BT - Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009 - 29th Annual Conference, Proceedings
T2 - 29th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009
Y2 - 15 December 2009 through 17 December 2009
ER -