Deterministic Extractors for Independent-Symbol Sources
From MaRDI portal
Publication:3613751
DOI10.1007/11786986_9zbMATH Open1223.68076OpenAlexW2097561742MaRDI QIDQ3613751FDOQ3613751
Chi-Jen Lu, Chia-Jung Lee, 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
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Measures of information, entropy (94A17)
Cited In (6)
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- Computational Randomness from Generalized Hardcore Sets
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Extracting Computational Entropy and Learning Noisy Linear Functions
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
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 👍 👎
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)
