Extracting all the randomness and reducing the error in Trevisan's extractors

DOI10.1145/301250.301292zbMath1345.68136OpenAlexW2119913278MaRDI QIDQ5890865

Omer Reingold, Ran Raz, Salil P. Vadhan

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2958609

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Random number generation in numerical analysis (65C10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

On explicit constructions of designs ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Constant time parallel sorting: An empirical view. ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Extractors from Reed-Muller codes ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ On the distribution of the number of roots of polynomials and explicit weak designs ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Storing information with extractors.

This page was built for publication: Extracting all the randomness and reducing the error in Trevisan's extractors