Anup Rao - Concepedia

Author

Anup Rao

University of Washington ORCID

Also Known As

A Sai Naga Sri and Dr. S V R K Rao, Anup Rao, More about Anup Rao, Rao, Anup, Volk, Ben Lee

Publications

1.5K

Citations

H-Index

Concepts

All Affiliations

University of Washington Princeton University The University of Texas at Austin Institute for Advanced Study Microsoft (United States)

About

Anup Rao is an author at University of Washington specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	17	18	1K
2	Communication	8	8	579
3	Arts	1	1	154
4	Business	1	1	47
5	Education	1	1	26

Anup Rao

Publications

1.2K

Citations

H-Index

Page 1

	Year	Citations
How to compress interactive communication Boaz Barak, Mark Braverman, Xi Chen, EngineeringCommunicationFormal VerificationInteractive CommunicationLossless Compression	2010	154
Information Equals Amortized Communication Mark Braverman, Anup Rao Population ProtocolEngineeringInformation TheoryKolmogorov ComplexityData Communication	2011	120
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction Boaz Barak, Anup Rao, Ronen Shaltiel, Explicit DisperserEngineeringCombinatorial DesignComputational ComplexitySub-polynomial Entropy	2006	102
How to Compress Interactive Communication Boaz Barak, Mark Braverman, Xi Chen, SIAM Journal on Computing EngineeringComputational ComplexityCommunication ComplexityCompress Interactive CommunicationCommunication	2013	88
Direct Products in Communication Complexity Mark Braverman, Anup Rao, Omri Weinstein, Theory Of ComputingEngineeringInformation TheoryCommunication ProtocolEntropy	2013	75
Extractors for a constant number of polynomially small min-entropy independent sources Anup Rao Mathematical ProgrammingRandomness ExtractionEngineeringInformation TheoryComputational Complexity Theory	2006	60
An Exposition of Bourgain's 2-Source Extractor Anup Rao	2007	57
Information Equals Amortized Communication Mark Braverman, Anup Rao IEEE Transactions on Information Theory Population ProtocolEngineeringInformation TheoryKolmogorov ComplexityData Communication	2014	56
Deterministic extractors for small-space sources Jesse Kamp, Anup Rao, Salil Vadhan, EngineeringComputational ComplexityAtomic DecompositionIndependent SourcesCoding Theory	2006	49
Rounding Parallel Repetitions of Unique Games Boaz Barak, Moritz Hardt, Ishay Haviv, Mathematical ProgrammingComputational Complexity TheoryEngineeringCombinatorial GameGame Theory	2008	47

Page 1