Deterministic Extractors for Independent-Symbol Sources
From MaRDI portal
Publication:3613751
DOI10.1007/11786986_9zbMATH Open1223.68076OpenAlexW2097561742MaRDI QIDQ3613751FDOQ3613751
Authors: Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_9
Recommendations
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Deterministic extractors for small-space sources
- Deterministic extractors for small-space sources
- How to get more mileage from randomness extractors
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Measures of information, entropy (94A17)
Cited In (25)
- New independent source extractors with exponential improvement
- Deterministic extractors for small-space sources
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- Computational Randomness from Generalized Hardcore Sets
- Extracting Randomness from Multiple Independent Sources
- Extractors and lower bounds for locally samplable sources
- Deterministic extractors for additive sources (extended abstract)
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Deterministic extractors for small-space sources
- On randomness extraction in \({\mathcal{AC}}^0\)
- Extractors and lower bounds for locally samplable sources
- Extractors for Turing-machine sources
- Extractors for circuit sources
- Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
- Zero-fixing extractors for sub-logarithmic entropy
- Optimal deterministic extractors for generalized Santha-Vazirani sources
- Extracting Computational Entropy and Learning Noisy Linear Functions
- Extracting randomness from extractor-dependent sources
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
- Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
- Extractors for a constant number of polynomially small MIN-entropy independent sources
- Deterministic extraction from weak random sources.
- Santha-Vazirani sources, deterministic condensers and very strong extractors
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: Deterministic Extractors for Independent-Symbol Sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613751)