Pages that link to "Item:Q3012907"

The following pages link to An Introduction to Randomness Extractors (Q3012907):

Displaying 19 items.

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• Clone-induced approximation algebras of Bernoulli distributions (Q1714472) (← links)
• Algebras of probability distributions on finite sets (Q1798085) (← links)
• Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
• On extracting space-bounded Kolmogorov complexity (Q2354592) (← links)
• From graphs to keyed quantum hash functions (Q2361672) (← links)
• Code generator matrices as RNG conditioners (Q2401956) (← links)
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
• A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage (Q2953822) (← links)
• Efficient and Provable White-Box Primitives (Q2958118) (← links)
• Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure (Q2980880) (← links)
• Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
• Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint (Q3460111) (← links)
• The Complexity of Differential Privacy (Q5021135) (← links)
• (Q5092448) (← links)
• Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange (Q5739025) (← links)
• Randomness extraction in computability theory (Q5880936) (← links)
• Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)
• Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)