Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
From MaRDI portal
Publication:3448780
DOI10.1007/978-3-662-47672-7_12zbMath1380.68182arXiv1412.6641OpenAlexW2127150563MaRDI QIDQ3448780
Omid Etesami, Amin Gohari, Salman Beigi
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6641
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extractors and rank extractors for polynomial sources
- On the construction of affine extractors
- Generating quasi-random sequences from semi-random sources
- A lower bound for the time to assure interactive consistency
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- Randomness is linear in space
- Extractors for varieties
- Deterministic extractors for affine sources over large fields
- On the Impossibility of Cryptography with Tamperable Randomness
- Extractors for a constant number of polynomially small min-entropy independent sources
- On Sequences of Pairs of Dependent Random Variables
- Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- The source coding game
- Deterministic extractors for small-space sources
