The following pages link to Anup Rao (Q619915):
Displaying 12 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)
- (Q4601824) (← links)
- (Q4601838) (← links)
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits (Q5091231) (← links)
