Location of Repository

LIPIcs Leibniz International Proceedings in Informatics Randomness extractors – applications and constructions

By Avi Wigderson

Abstract

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

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.298.9697
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.ias.edu/~avi/P... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.