Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources - Anup Rao 001 (Electron. Colloquium Comput. Complex., 2005)

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. - Boaz Barak; Anup Rao 001; Ronen Shaltiel; Avi Wigderson (STOC, 2006)

An Exposition of Bourgain's 2-Source Extractor. - Anup Rao 001 (Electron. Colloquium Comput. Complex., 2007)

A 2-Source Almost-Extractor for Linear Entropy. - Anup Rao 001 (APPROX-RANDOM, 2008)

Extractors for Three Uneven-Length Sources. - Anup Rao 001; David Zuckerman (APPROX-RANDOM, 2008)

Rounding Parallel Repetitions of Unique Games. - Boaz Barak; Moritz Hardt; Ishay Haviv; Anup Rao 001; Oded Regev 001; David Steurer (FOCS, 2008)

Network Extractor Protocols. - Yael Tauman Kalai; Xin Li 006; Anup Rao 001; David Zuckerman (FOCS, 2008)

Spherical Cubes and Rounding in High Dimensions. - Guy Kindler; Ryan O'Donnell; Anup Rao 001; Avi Wigderson (FOCS, 2008)

Extractors for Low-Weight Affine Sources. - Anup Rao 001 (Electron. Colloquium Comput. Complex., 2008)

Strong Parallel Repetition Theorem for Free Projection Games. - Boaz Barak; Anup Rao 001; Ran Raz; Ricky Rosen; Ronen Shaltiel (APPROX-RANDOM, 2009)

2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. - Yael Tauman Kalai; Xin Li 006; Anup Rao 001 (FOCS, 2009)

Direct Sums in Randomized Communication Complexity. - Boaz Barak; Mark Braverman; Xi Chen 001; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2009)

Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources. - Anup Rao 001 (SIAM J. Comput., 2009)

Efficient Communication Using Partial Information. - Mark Braverman; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2010)

Towards Coding for Maximum Errors in Interactive Communication. - Mark Braverman; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2010)

Restriction Access. - Zeev Dvir; Anup Rao 001; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2011)

Deterministic extractors for small-space sources. - Jesse Kamp; Anup Rao 001; Salil P. Vadhan; David Zuckerman (J. Comput. Syst. Sci., 2011)

Parallel Repetition in Projection Games and a Concentration Bound. - Anup Rao 001 (SIAM J. Comput., 2011)

Formulas Resilient to Short-Circuit Errors. - Yael Tauman Kalai; Allison B. Lewko; Anup Rao 001 (FOCS, 2012)

Spherical cubes: optimal foams from computational hardness amplification. - Guy Kindler; Anup Rao 001; Ryan O'Donnell; Avi Wigderson (Commun. ACM, 2012)

Special Issue "Conference on Computational Complexity 2011" Guest Editor's Foreword. - Anup Rao 001 (Comput. Complex., 2012)

Direct Products in Communication Complexity. - Mark Braverman; Anup Rao 001; Omri Weinstein; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2012)

Direct product via round-preserving compression. - Mark Braverman; Anup Rao 001; Omri Weinstein; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2013)

How to Compress Interactive Communication. - Boaz Barak; Mark Braverman; Xi Chen 001; Anup Rao 001 (SIAM J. Comput., 2013)

Circuits with Medium Fan-In. - Pavel Hrubes; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2014)

Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. - Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2014)

Pseudorandom Generators for Regular Branching Programs. - Mark Braverman; Anup Rao 001; Ran Raz; Amir Yehudayoff (SIAM J. Comput., 2014)

Information Equals Amortized Communication. - Mark Braverman; Anup Rao 001 (IEEE Trans. Inf. Theory, 2014)

Toward Coding for Maximum Errors in Interactive Communication. - Mark Braverman; Anup Rao 001 (IEEE Trans. Inf. Theory, 2014)

How to Compress Asymmetric Communication. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2015)

On Parallelizing Streaming Algorithms. - Anup Rao 001; Makrand Sinha (Electron. Colloquium Comput. Complex., 2015)

Simplified Separation of Information and Communication. - Anup Rao 001; Makrand Sinha (Electron. Colloquium Comput. Complex., 2015)

A Direct-Sum Theorem for Read-Once Branching Programs. - Anup Rao 001; Makrand Sinha (APPROX-RANDOM, 2016)

Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. - Jan Hazla; Thomas Holenstein; Anup Rao 001 (CoRR, 2016)

New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2016)

On Expressing Majority as a Majority of Majorities. - Christian Engels; Mohit Garg 003; Kazuhisa Makino; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2017)

Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2017)

Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (CCC, 2018)

Coding for Sunflowers. - Anup Rao 001 (CoRR, 2019)

Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. - Pavel Hrubes; Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2019)

The Communication Complexity of the Exact Gap-Hamming Problem. - Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2020)

Tight bounds on the Fourier growth of bounded functions on the hypercube. - Siddharth Iyer; Anup Rao 001; Victor Reis; Thomas Rothvoss; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2021)

Sunflowers: from soil to oil. - Anup Rao 001 (Electron. Colloquium Comput. Complex., 2022)

On List Decoding Transitive Codes From Random Errors. - Anup Rao 001; Oscar Sprumont (Electron. Colloquium Comput. Complex., 2022)

Anticoncentration and the Exact Gap-Hamming Problem. - Anup Rao 001; Amir Yehudayoff (SIAM J. Discret. Math., 2022)

XOR Lemmas for Communication via Marginal Information. - Siddharth Iyer; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2023)

An XOR Lemma for Deterministic Communication Complexity. - Siddharth Iyer; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2024)

A criterion for decoding on the binary symmetric channel. - Anup Rao 001; Oscar Sprumont (Adv. Math. Commun., 2025)