Almost Chor-Goldreich sources and adversarial random walks

Cites Work

Unnamed Item
Unnamed Item
An algorithmic Friedman-Pippenger theorem on tree embeddings and applications
Generating quasi-random sequences from semi-random sources
Entropy waves, the zig-zag graph product, and new constant-degree expanders
Randomness is linear in space
Extractors for varieties
No time to hash: on super-efficient entropy accumulation
Santha-Vazirani sources, deterministic condensers and very strong extractors
Lossless condensers, unbalanced expanders, and extractors
On recycling the randomness of states in space bounded computation
Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Randomness conductors and constant-degree lossless expanders
Extractors
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Computing with Very Weak Random Sources
Tiny families of functions with random properties: A quality-size trade-off for hashing
Overcoming Weak Expectations
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
Leftover Hash Lemma, Revisited
On the Entropy Loss and Gap of Condensers
Hardness Amplification Proofs Require Majority
Key Derivation without Entropy Waste
Extracting Randomness via Repeated Condensing
Extractors for Circuit Sources
Deterministic extractors for small-space sources
Extractors and Lower Bounds for Locally Samplable Sources
Simulating independence
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost
Online Linear Extractors for Independent Sources
Communication complexity with defective randomness

This page was built for publication: Almost Chor-Goldreich sources and adversarial random walks