Extracting Randomness via Repeated Condensing
From MaRDI portal
Recommendations
- Extracting Randomness Using Few Independent Sources
- Extracting randomness from extractor-dependent sources
- scientific article; zbMATH DE number 6963652
- Extracting randomness: A survey and new constructions
- Randomness Reuse: Extensions and Improvements
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Randomness condensers for efficiently samplable, seed-dependent sources
- Randomness extractors -- applications and constructions
Cited in
(16)- Constant time parallel sorting: An empirical view.
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- No time to hash: on super-efficient entropy accumulation
- Santha-Vazirani sources, deterministic condensers and very strong extractors
- Lossless condensers, unbalanced expanders, and extractors
- Extractors from Reed-Muller codes
- Big-key symmetric encryption: resisting key exfiltration
- Randomness condensers for efficiently samplable, seed-dependent sources
- How to get more mileage from randomness extractors
- A 2-Source Almost-Extractor for Linear Entropy
- Loss-less condensers, unbalanced expanders, and extractors
- Using Rademacher permutations to reduce randomness
- Simpler Constant-Seed Condensers
- Almost Chor-Goldreich sources and adversarial random walks
- Nearly optimal pseudorandomness from hardness
- Extracting Kolmogorov complexity with applications to dimension zero-one laws
This page was built for publication: Extracting Randomness via Repeated Condensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470730)
