Randomness extractors and their many guises

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 9-

  Vadhan, Salil P ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CRYPTOGRAPHY; DATA STRUCTURES; ERROR CORRECTION; GRAPH THEORY; SAMPLING; STATISTICAL METHODS;

HASH FUNCTIONS; PSEUDORANDOM GENERATORS; RANDOMNESS EXTRACTORS; SAMPLING ALGORITHMS;

RANDOM PROCESSES;

EID: 0036954126     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. Journal of Computer and System Sciences, 58(1):148-173, 1999.
2. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, Feb. 1996. Preliminary version in STOC '93.
3. R. Shaltiel, Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67-95, June 2002.