Anup Rao
Anup Rao
Professor of Computer Science, University of Washington
Verified email at cs.washington.edu - Homepage
Title
Cited by
Cited by
Year
How to compress interactive communication
B Barak, M Braverman, X Chen, A Rao
SIAM Journal on Computing 42 (3), 1327-1363, 2013
2172013
A technique for dynamic updating of Java software
A Orso, A Rao, MJ Harrold
International Conference on Software Maintenance, 2002. Proceedings., 649-658, 2002
1942002
Information equals amortized communication
M Braverman, A Rao
IEEE Transactions on Information Theory 60 (10), 6058-6069, 2014
1932014
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
B Barak, A Rao, R Shaltiel, A Wigderson
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
159*2006
Parallel repetition in projection games and a concentration bound
A Rao
SIAM Journal on Computing 40 (6), 1871-1891, 2011
1272011
Toward coding for maximum errors in interactive communication
M Braverman, A Rao
IEEE Transactions on Information Theory 60 (11), 7248-7255, 2014
1122014
Extractors for a constant number of polynomially small min-entropy independent sources
A Rao
SIAM Journal on Computing 39 (1), 168-194, 2009
1082009
We need a research data census
F Berman
Communications of the ACM 53 (12), 39-41, 2010
82*2010
An exposition of Bourgain’s 2-source extractor
A Rao
Electronic Colloquium on Computational Complexity (ECCC) 14 (034), 2007
792007
Direct products in communication complexity
M Braverman, A Rao, O Weinstein, A Yehudayoff
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 746-755, 2013
622013
Extractors for low-weight affine sources
A Rao
2009 24th Annual IEEE Conference on Computational Complexity, 95-101, 2009
612009
Pseudorandom generators for regular branching programs
M Braverman, A Rao, R Raz, A Yehudayoff
SIAM Journal on Computing 43 (3), 973-986, 2014
562014
Rounding parallel repetitions of unique games
B Barak, M Hardt, I Haviv, A Rao, O Regev, D Steurer
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 374-383, 2008
522008
Deterministic extractors for small-space sources
J Kamp, A Rao, S Vadhan, D Zuckerman
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
492006
Competitor analysis and its defenses in the e-marketplace
YP Sheng, PP Mykytyn Jr, CR Litecky
Communications of the ACM 48 (8), 107-112, 2005
48*2005
2-source extractors under computational assumptions and cryptography with defective randomness
YT Kalai, X Li, A Rao
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 617-626, 2009
422009
Deterministic extractors for small-space sources
J Kamp, A Rao, S Vadhan, D Zuckerman
Journal of Computer and System Sciences 77 (1), 191-220, 2011
362011
Direct product via round-preserving compression
M Braverman, A Rao, O Weinstein, A Yehudayoff
International Colloquium on Automata, Languages, and Programming, 232-243, 2013
322013
Network extractor protocols
YT Kalai, X Li, A Rao, D Zuckerman
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 654-663, 2008
322008
Strong parallel repetition theorem for free projection games
B Barak, A Rao, R Raz, R Rosen, R Shaltiel
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
312009
The system can't perform the operation now. Try again later.
Articles 1–20