default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnup Rao 0001
Person information
- affiliation: University of Washington, Seattle, WA, USA
- affiliation (former): Princeton University, Institute for Advanced Study, NJ, USA
- affiliation (PhD 2007): University of Texas at Austin, TX, USA
Other persons with the same name
- Anup B. Rao (aka: Anup Rao 0002) — Adobe Research, San Jose, CA, USA (and 1 more)
- Anup Rao 0003 — Cisco, USA (and 1 more)
- Anup Rao 0004 — Georgia Institute of Technology, Collecge of Computing, Atlanta, GA, USA
- Anup Rao 0005 — University of California at Los Angeles, David Geffen School of Medicine, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Siddharth Iyer, Anup Rao:
An XOR Lemma for Deterministic Communication Complexity. FOCS 2024: 429-432- [c27]Siddharth Iyer
, Anup Rao:
XOR Lemmas for Communication via Marginal Information. STOC 2024: 652-658 - [i33]Siddharth Iyer, Anup Rao:
An XOR Lemma for Deterministic Communication Complexity. CoRR abs/2407.01802 (2024) - [i32]Siddharth Iyer, Anup Rao:
An XOR Lemma for Deterministic Communication Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i31]Siddharth Iyer, Anup Rao:
XOR Lemmas for Communication via Marginal Information. CoRR abs/2312.03076 (2023) - [i30]Siddharth Iyer, Anup Rao:
XOR Lemmas for Communication via Marginal Information. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j12]Anup Rao, Amir Yehudayoff:
Anticoncentration and the Exact Gap-Hamming Problem. SIAM J. Discret. Math. 36(2): 1071-1092 (2022) - [i29]Anup Rao, Oscar Sprumont:
On List Decoding Transitive Codes From Random Errors. CoRR abs/2202.00240 (2022) - [i28]Anup Rao:
Sunflowers: from soil to oil. Electron. Colloquium Comput. Complex. TR22 (2022) - [i27]Anup Rao, Oscar Sprumont:
On List Decoding Transitive Codes From Random Errors. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i26]Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff:
Tight bounds on the Fourier growth of bounded functions on the hypercube. CoRR abs/2107.06309 (2021) - [i25]Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff:
Tight bounds on the Fourier growth of bounded functions on the hypercube. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j11]Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. SIAM J. Discret. Math. 34(1): 730-741 (2020) - [i24]Anup Rao, Amir Yehudayoff:
The Communication Complexity of the Exact Gap-Hamming Problem. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c26]Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff:
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. ICALP 2019: 72:1-72:14 - [i23]Anup Rao:
Coding for Sunflowers. CoRR abs/1909.04774 (2019) - [i22]Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff:
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j10]Anup Rao, Makrand Sinha:
Simplified Separation of Information and Communication. Theory Comput. 14(1): 1-29 (2018) - [c25]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. CCC 2018: 27:1-27:16 - 2017
- [i21]Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. Electron. Colloquium Comput. Complex. TR17 (2017) - [i20]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c24]Anup Rao, Makrand Sinha:
A Direct-Sum Theorem for Read-Once Branching Programs. APPROX-RANDOM 2016: 44:1-44:15 - [i19]Jan Hazla, Thomas Holenstein, Anup Rao:
Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR abs/1604.05757 (2016) - [i18]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c23]Anup Rao, Amir Yehudayoff:
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. CCC 2015: 88-101 - [c22]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
How to Compress Asymmetric Communication. CCC 2015: 102-123 - [c21]Pavel Hrubes, Anup Rao:
Circuits with Medium Fan-In. CCC 2015: 381-391 - [e1]Naveen Garg, Klaus Jansen, Anup Rao, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA. LIPIcs 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-89-7 [contents] - [i17]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
How to Compress Asymmetric Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - [i16]Anup Rao, Makrand Sinha:
On Parallelizing Streaming Algorithms. Electron. Colloquium Comput. Complex. TR15 (2015) - [i15]Anup Rao, Makrand Sinha:
Simplified Separation of Information and Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j9]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. SIAM J. Comput. 43(3): 973-986 (2014) - [j8]Mark Braverman, Anup Rao:
Information Equals Amortized Communication. IEEE Trans. Inf. Theory 60(10): 6058-6069 (2014) - [j7]Mark Braverman, Anup Rao:
Toward Coding for Maximum Errors in Interactive Communication. IEEE Trans. Inf. Theory 60(11): 7248-7255 (2014) - [i14]Pavel Hrubes, Anup Rao:
Circuits with Medium Fan-In. Electron. Colloquium Comput. Complex. TR14 (2014) - [i13]Anup Rao, Amir Yehudayoff:
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j6]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to Compress Interactive Communication. SIAM J. Comput. 42(3): 1327-1363 (2013) - [c20]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Products in Communication Complexity. FOCS 2013: 746-755 - [c19]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Product via Round-Preserving Compression. ICALP (1) 2013: 232-243 - [i12]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct product via round-preserving compression. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j5]Guy Kindler, Anup Rao, Ryan O'Donnell, Avi Wigderson:
Spherical cubes: optimal foams from computational hardness amplification. Commun. ACM 55(10): 90-97 (2012) - [j4]Anup Rao:
Special Issue "Conference on Computational Complexity 2011" Guest Editor's Foreword. Comput. Complex. 21(2): 193-195 (2012) - [c18]Yael Tauman Kalai, Allison B. Lewko, Anup Rao:
Formulas Resilient to Short-Circuit Errors. FOCS 2012: 490-499 - [c17]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction access. ITCS 2012: 19-33 - [i11]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Products in Communication Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j3]Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman:
Deterministic extractors for small-space sources. J. Comput. Syst. Sci. 77(1): 191-220 (2011) - [j2]Anup Rao:
Parallel Repetition in Projection Games and a Concentration Bound. SIAM J. Comput. 40(6): 1871-1891 (2011) - [c16]Mark Braverman, Anup Rao:
Information Equals Amortized Communication. FOCS 2011: 748-757 - [c15]Mark Braverman, Anup Rao:
Towards coding for maximum errors in interactive communication. STOC 2011: 159-166 - [i10]Mark Braverman, Anup Rao:
Information Equals Amortized Communication. CoRR abs/1106.3595 (2011) - [i9]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction Access. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c14]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. FOCS 2010: 40-47 - [c13]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to compress interactive communication. STOC 2010: 67-76 - [i8]Mark Braverman, Anup Rao:
Efficient Communication Using Partial Information. Electron. Colloquium Comput. Complex. TR10 (2010) - [i7]Mark Braverman, Anup Rao:
Towards Coding for Maximum Errors in Interactive Communication. Electron. Colloquium Comput. Complex. TR10 (2010) - [i6]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j1]Anup Rao:
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources. SIAM J. Comput. 39(1): 168-194 (2009) - [c12]Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel:
Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM 2009: 352-365 - [c11]Anup Rao:
Extractors for Low-Weight Affine Sources. CCC 2009: 95-101 - [c10]Yael Tauman Kalai, Xin Li, Anup Rao:
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. FOCS 2009: 617-626 - [i5]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
Direct Sums in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c9]Anup Rao:
A 2-Source Almost-Extractor for Linear Entropy. APPROX-RANDOM 2008: 549-556 - [c8]Anup Rao, David Zuckerman:
Extractors for Three Uneven-Length Sources. APPROX-RANDOM 2008: 557-570 - [c7]Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigderson:
Spherical Cubes and Rounding in High Dimensions. FOCS 2008: 189-198 - [c6]Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer:
Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 - [c5]Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman:
Network Extractor Protocols. FOCS 2008: 654-663 - [c4]Anup Rao:
Parallel repetition in projection games and a concentration bound. STOC 2008: 1-10 - [i4]Anup Rao:
Parallel Repetition in Projection Games and a Concentration Bound. Electron. Colloquium Comput. Complex. TR08 (2008) - [i3]Anup Rao:
Extractors for Low-Weight Affine Sources. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i2]Anup Rao:
An Exposition of Bourgain's 2-Source Extractor. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c3]Anup Rao:
Extractors for a constant number of polynomially small min-entropy independent sources. STOC 2006: 497-506 - [c2]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 - [c1]Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman:
Deterministic extractors for small-space sources. STOC 2006: 691-700 - 2005
- [i1]Anup Rao:
Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
