Anup Rao

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 23

Top Topics

Systematic Errors

Top Venues

Electron. Colloquium Comput. Complex.

Computational Complexity Conference

IEEE Trans. Inf. Theory

Publications

Siddharth Iyer, Anup Rao
XOR Lemmas for Communication via Marginal Information. STOC (2024)
Siddharth Iyer, Anup Rao
An XOR Lemma for Deterministic Communication Complexity. Electron. Colloquium Comput. Complex. (2024)
Siddharth Iyer, Anup Rao
An XOR Lemma for Deterministic Communication Complexity. CoRR (2024)
Siddharth Iyer, Anup Rao
XOR Lemmas for Communication via Marginal Information. Electron. Colloquium Comput. Complex. (2023)
Siddharth Iyer, Anup Rao
XOR Lemmas for Communication via Marginal Information. CoRR (2023)
Anup Rao
Sunflowers: from soil to oil. Electron. Colloquium Comput. Complex. 29 (2022)
Anup Rao, Amir Yehudayoff
Anticoncentration and the Exact Gap-Hamming Problem. SIAM J. Discret. Math. 36 (2) (2022)
Anup Rao, Oscar Sprumont
On List Decoding Transitive Codes From Random Errors. CoRR (2022)
Anup Rao, Oscar Sprumont
On List Decoding Transitive Codes From Random Errors. Electron. Colloquium Comput. Complex. 29 (2022)
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. 28 (2021)
Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff
Tight bounds on the Fourier growth of bounded functions on the hypercube. CoRR (2021)
Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao
On Expressing Majority as a Majority of Majorities. SIAM J. Discret. Math. 34 (1) (2020)
Anup Rao, Amir Yehudayoff
The Communication Complexity of the Exact Gap-Hamming Problem. Electron. Colloquium Comput. Complex. 27 (2020)
Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. ICALP (2019)
Anup Rao
Coding for Sunflowers. CoRR (2019)
Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Electron. Colloquium Comput. Complex. 26 (2019)
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. Computational Complexity Conference (2018)
Anup Rao, Makrand Sinha
Simplified Separation of Information and Communication. Theory Comput. 14 (1) (2018)
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers. Electron. Colloquium Comput. Complex. 24 (2017)
Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao
On Expressing Majority as a Majority of Majorities. Electron. Colloquium Comput. Complex. 24 (2017)
Jan Hazla, Thomas Holenstein, Anup Rao
Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR (2016)
Anup Rao, Makrand Sinha
A Direct-Sum Theorem for Read-Once Branching Programs. APPROX-RANDOM (2016)
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity. Electron. Colloquium Comput. Complex. 23 (2016)
Pavel Hrubes, Anup Rao
Circuits with Medium Fan-In. Computational Complexity Conference (2015)
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
How to Compress Asymmetric Communication. Electron. Colloquium Comput. Complex. 22 (2015)
Anup Rao, Makrand Sinha
On Parallelizing Streaming Algorithms. Electron. Colloquium Comput. Complex. 22 (2015)
Anup Rao, Makrand Sinha
Simplified Separation of Information and Communication. Electron. Colloquium Comput. Complex. 22 (2015)
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
How to Compress Asymmetric Communication. Computational Complexity Conference (2015)
Anup Rao, Amir Yehudayoff
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. Computational Complexity Conference (2015)
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
Pseudorandom Generators for Regular Branching Programs. SIAM J. Comput. 43 (3) (2014)
Mark Braverman, Anup Rao
Toward Coding for Maximum Errors in Interactive Communication. IEEE Trans. Inf. Theory 60 (11) (2014)
Mark Braverman, Anup Rao
Information Equals Amortized Communication. IEEE Trans. Inf. Theory 60 (10) (2014)
Anup Rao, Amir Yehudayoff
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. Electron. Colloquium Comput. Complex. 21 (2014)
Pavel Hrubes, Anup Rao
Circuits with Medium Fan-In. Electron. Colloquium Comput. Complex. 21 (2014)
Boaz Barak, Mark Braverman, Xi Chen, Anup Rao
How to Compress Interactive Communication. SIAM J. Comput. 42 (3) (2013)
Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff
Direct Products in Communication Complexity. FOCS (2013)
Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff
Direct product via round-preserving compression. Electron. Colloquium Comput. Complex. 20 (2013)
Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff
Direct Product via Round-Preserving Compression. ICALP (1) (2013)
Anup Rao
Special Issue "Conference on Computational Complexity 2011" Guest Editor's Foreword. Comput. Complex. 21 (2) (2012)
Guy Kindler, Anup Rao, Ryan O'Donnell, Avi Wigderson
Spherical cubes: optimal foams from computational hardness amplification. Commun. ACM 55 (10) (2012)
Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff
Restriction access. ITCS (2012)
Yael Tauman Kalai, Allison B. Lewko, Anup Rao
Formulas Resilient to Short-Circuit Errors. FOCS (2012)
Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff
Direct Products in Communication Complexity. Electron. Colloquium Comput. Complex. 19 (2012)
Anup Rao
Parallel Repetition in Projection Games and a Concentration Bound. SIAM J. Comput. 40 (6) (2011)
Mark Braverman, Anup Rao
Towards coding for maximum errors in interactive communication. STOC (2011)
Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff
Restriction Access. Electron. Colloquium Comput. Complex. 18 (2011)
Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
Deterministic extractors for small-space sources. J. Comput. Syst. Sci. 77 (1) (2011)
Mark Braverman, Anup Rao
Information Equals Amortized Communication. FOCS (2011)
Mark Braverman, Anup Rao
Information Equals Amortized Communication CoRR (2011)
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
Pseudorandom Generators for Regular Branching Programs. Electron. Colloquium Comput. Complex. 17 (2010)
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
Pseudorandom Generators for Regular Branching Programs. FOCS (2010)
Mark Braverman, Anup Rao
Towards Coding for Maximum Errors in Interactive Communication. Electron. Colloquium Comput. Complex. 17 (2010)
Mark Braverman, Anup Rao
Efficient Communication Using Partial Information. Electron. Colloquium Comput. Complex. 17 (2010)
Boaz Barak, Mark Braverman, Xi Chen, Anup Rao
How to compress interactive communication. STOC (2010)
Boaz Barak, Mark Braverman, Xi Chen, Anup Rao
Direct Sums in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. 16 (2009)
Anup Rao
Extractors for Low-Weight Affine Sources. Computational Complexity Conference (2009)
Anup Rao
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources. SIAM J. Comput. 39 (1) (2009)
Yael Tauman Kalai, Xin Li, Anup Rao
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. FOCS (2009)
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel
Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM (2009)
Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer
Rounding Parallel Repetitions of Unique Games. FOCS (2008)
Anup Rao
Parallel repetition in projection games and a concentration bound. STOC (2008)
Anup Rao
Extractors for Low-Weight Affine Sources. Electron. Colloquium Comput. Complex. 15 (015) (2008)
Anup Rao
Parallel Repetition in Projection Games and a Concentration Bound. Electron. Colloquium Comput. Complex. 15 (013) (2008)
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigderson
Spherical Cubes and Rounding in High Dimensions. FOCS (2008)
Anup Rao
A 2-Source Almost-Extractor for Linear Entropy. APPROX-RANDOM (2008)
Anup Rao, David Zuckerman
Extractors for Three Uneven-Length Sources. APPROX-RANDOM (2008)
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman
Network Extractor Protocols. FOCS (2008)
Anup Rao
An Exposition of Bourgain's 2-Source Extractor. Electron. Colloquium Comput. Complex. 14 (034) (2007)
Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
Deterministic extractors for small-space sources. STOC (2006)
Anup Rao
Extractors for a constant number of polynomially small min-entropy independent sources. STOC (2006)
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)
Anup Rao
Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources Electron. Colloquium Comput. Complex. (106) (2005)