| 2008 |
|---|
| 14 | EE | Anup Rao:
A 2-Source Almost-Extractor for Linear Entropy.
APPROX-RANDOM 2008: 549-556 |
| 13 | EE | Anup Rao,
David Zuckerman:
Extractors for Three Uneven-Length Sources.
APPROX-RANDOM 2008: 557-570 |
| 12 | EE | Guy Kindler,
Ryan O'Donnell,
Anup Rao,
Avi Wigderson:
Spherical Cubes and Rounding in High Dimensions.
FOCS 2008: 189-198 |
| 11 | EE | Boaz Barak,
Moritz Hardt,
Ishay Haviv,
Anup Rao,
Oded Regev,
David Steurer:
Rounding Parallel Repetitions of Unique Games.
FOCS 2008: 374-383 |
| 10 | EE | Yael Tauman Kalai,
Xin Li,
Anup Rao,
David Zuckerman:
Network Extractor Protocols.
FOCS 2008: 654-663 |
| 9 | EE | Anup Rao:
Parallel repetition in projection games and a concentration bound.
STOC 2008: 1-10 |
| 8 | EE | Anup Rao:
Parallel Repetition in Projection Games and a Concentration Bound.
Electronic Colloquium on Computational Complexity (ECCC) 15(013): (2008) |
| 7 | EE | Anup Rao:
Extractors for Low-Weight Affine Sources.
Electronic Colloquium on Computational Complexity (ECCC) 15(015): (2008) |
| 2007 |
|---|
| 6 | EE | Anup Rao:
An Exposition of Bourgain's 2-Source Extractor.
Electronic Colloquium on Computational Complexity (ECCC) 14(034): (2007) |
| 2006 |
|---|
| 5 | EE | Anup Rao:
Extractors for a constant number of polynomially small min-entropy independent sources.
STOC 2006: 497-506 |
| 4 | EE | Boaz Barak,
Anup Rao,
Ronen Shaltiel,
Avi Wigderson:
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.
STOC 2006: 671-680 |
| 3 | EE | Jesse Kamp,
Anup Rao,
Salil P. Vadhan,
David Zuckerman:
Deterministic extractors for small-space sources.
STOC 2006: 691-700 |
| 2005 |
|---|
| 2 | EE | Anup Rao:
Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources
Electronic Colloquium on Computational Complexity (ECCC)(106): (2005) |
| 2002 |
|---|
| 1 | EE | Alessandro Orso,
Anup Rao,
Mary Jean Harrold:
A Technique for Dynamic Updating of Java Software.
ICSM 2002: 649-658 |
