The following pages link to Anup Rao (Q619915):
Displaying 24 items.
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Restriction access (Q2826041) (← links)
- How to Compress Interactive Communication (Q2848223) (← links)
- How to compress interactive communication (Q2875133) (← links)
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (Q2931427) (← links)
- Toward Coding for Maximum Errors in Interactive Communication (Q2983369) (← links)
- Information Equals Amortized Communication (Q2986089) (← links)
- Pseudorandom Generators for Regular Branching Programs (Q3190691) (← links)
- Parallel Repetition in Projection Games and a Concentration Bound (Q3225175) (← links)
- A 2-Source Almost-Extractor for Linear Entropy (Q3541819) (← links)
- Extractors for Three Uneven-Length Sources (Q3541820) (← links)
- (Q3549674) (← links)
- Strong Parallel Repetition Theorem for Free Projection Games (Q3638890) (← links)
- (Q4601824) (← links)
- (Q4601838) (← links)
- Anticoncentration and the Exact Gap-Hamming Problem (Q5074948) (← links)
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits (Q5091231) (← links)
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources (Q5189543) (← links)
- Communication Complexity (Q5213788) (← links)
- Direct Product via Round-Preserving Compression (Q5326564) (← links)
- Towards coding for maximum errors in interactive communication (Q5419085) (← links)
- Information Equals Amortized Communication (Q5495039) (← links)
- Deterministic extractors for small-space sources (Q5891932) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
