Almost Chor-Goldreich sources and adversarial random walks
From MaRDI portal
Cites work
- An algorithmic Friedman-Pippenger theorem on tree embeddings and applications
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Communication complexity with defective randomness
- Computing with Very Weak Random Sources
- Deterministic extractors for small-space sources
- Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Extracting Randomness via Repeated Condensing
- Extractors
- Extractors and lower bounds for locally samplable sources
- Extractors for circuit sources
- Extractors for varieties
- Generating quasi-random sequences from semi-random sources
- Hardness Amplification Proofs Require Majority
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- Key derivation without entropy waste
- Leftover Hash Lemma, Revisited
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Lossless condensers, unbalanced expanders, and extractors
- No time to hash: on super-efficient entropy accumulation
- On recycling the randomness of states in space bounded computation
- On the Entropy Loss and Gap of Condensers
- Online Linear Extractors for Independent Sources
- Overcoming weak expectations
- Randomness condensers for efficiently samplable, seed-dependent sources
- Randomness conductors and constant-degree lossless expanders
- Randomness is linear in space
- Santha-Vazirani sources, deterministic condensers and very strong extractors
- Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
This page was built for publication: Almost Chor-Goldreich sources and adversarial random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499212)
