Pages that link to "Item:Q4372786"

The following pages link to Randomness-optimal oblivious sampling (Q4372786):

Displaying 36 items.

• Derandomized parallel repetition theorems for free games (Q371195) (← links)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
• Innovative approaches for security of small artefacts (Q465672) (← links)
• Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
• Perfect information leader election in \(\log^*n+O(1)\) rounds (Q1604211) (← links)
• Computational indistinguishability: A sample hierarchy (Q1961376) (← links)
• On derandomized composition of Boolean functions (Q2281253) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Low-degree test with polynomially small error (Q2410685) (← links)
• Extractors from Reed-Muller codes (Q2496317) (← links)
• High entropy random selection protocols (Q2659776) (← links)
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
• On the randomness complexity of efficient sampling (Q2931431) (← links)
• Brahms (Q2934341) (← links)
• Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources (Q2956041) (← links)
• An Introduction to Randomness Extractors (Q3012907) (← links)
• Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
• A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
• Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (Q3448780) (← links)
• (Q4228481) (← links)
• Randomization and eventual reordering: a number theoretic approach (Q4457588) (← links)
• Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
• (Q5009532) (← links)
• Extractors for weak random sources and their applications (Q5054851) (← links)
• Typically-correct derandomization for small time and space (Q5091759) (← links)
• (Q5092476) (← links)
• Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
• Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
• Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
• List-Decoding with Double Samplers (Q5856152) (← links)
• (Q5875499) (← links)
• (Q5875519) (← links)
• Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
• Pseudorandom generators without the XOR lemma (Q5943089) (← links)
• Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
• Nearly optimal pseudorandomness from hardness (Q6551259) (← links)