The following pages link to Simulating independence (Q5901033):
Displaying 20 items.
- The size Ramsey number of a directed path (Q414648) (← links)
- On sum-product representation in \(\mathbb Z_q\) (Q874823) (← links)
- Quasi chain rule for min-entropy (Q1707982) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Extractors for small zero-fixing sources (Q2095117) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC (Q4302863) (← links)
- Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs (Q4997309) (← links)
- (Q5009548) (← links)
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
- (Q5092448) (← links)
- (Q5121891) (← links)
- (Q5875499) (← links)
- Extractors and Lower Bounds for Locally Samplable Sources (Q5894225) (← links)
- Simulating independence (Q5901100) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
