Interactive Coding Over the Noisy Broadcast Channel. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2017)

Interactive Distributed Proofs. - Gillat Kol; Rotem Oshman; Raghuvansh R. Saxena (PODC, 2018)

The menu complexity of "one-and-a-half-dimensional" mechanism design. - Raghuvansh R. Saxena; Ariel Schvartzman; S. Matthew Weinberg (SODA, 2018)

Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility. - Mark Braverman; Gillat Kol; Shay Moran; Raghuvansh R. Saxena (CoRR, 2019)

Noisy Beeps. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2019)

Radio Network Coding Requires Logarithmic Overhead. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2019)

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. - Sepehr Assadi; Gillat Kol; Raghuvansh R. Saxena; Huacheng Yu (FOCS, 2020)

Optimal Mechanism Design for Single-Minded Agents. - Nikhil R. Devanur; Kira Goldner; Raghuvansh R. Saxena; Ariel Schvartzman; S. Matthew Weinberg (EC, 2020)

Separating the communication complexity of truthful and non-truthful combinatorial auctions. - Sepehr Assadi; Hrishikesh Khandeparkar; Raghuvansh R. Saxena; S. Matthew Weinberg (STOC, 2020)

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes. - Zvika Brakerski; Yael Tauman Kalai; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2020)

Interactive Error Resilience Beyond 2/7. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2020)

Near Optimal Distributed Learning of Halfspaces with Two Parties. - Mark Braverman; Gillat Kol; Shay Moran; Raghuvansh R. Saxena (COLT, 2021)

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh R. Saxena; Zhao Song 002; Huacheng Yu (ICALP, 2021)

99% Revenue with Constant Enhanced Competition. - Linda Cai; Raghuvansh R. Saxena (EC, 2021)

Exponential communication separations between notions of selfishness. - Aviad Rubinstein; Raghuvansh R. Saxena; Clayton Thomas; S. Matthew Weinberg; Junyao Zhao 001 (STOC, 2021)

Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Zhao Song 002; Huacheng Yu (Electron. Colloquium Comput. Complex., 2021)

Computation Over the Noisy Broadcast Channel with Malicious Parties. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Tight Bounds for General Computation in Noisy Broadcast Networks. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Binary Interactive Error Resilience Beyond $1/8$ (or why $(1/2)^3 > 1/8$). - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Optimal Error Resilience of Adaptive Message Exchange. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Communication Complexity: For Coding, Commerce, and Currents - Raghuvansh Saxena (2021)

Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Zhao Song 002; Huacheng Yu (Electron. Colloquium Comput. Complex., 2022)

Round-vs-Resilience Tradeoffs for Binary Feedback Channels. - Mark Braverman; Klim Efremenko; Gillat Kol; Raghuvansh Saxena; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2022)

Circuits Resilient to Short-Circuit Errors. - Klim Efremenko; Bernhard Haeupler; Yael Kalai; Pritish Kamath; Gillat Kol; Nicolas Resch; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2022)

Interactive Coding with Small Memory. - Klim Efremenko; Bernhard Haeupler; Gillat Kol; Nicolas Resch; Raghuvansh Saxena; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2022)

Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2022)

Binary Codes with Resilience Beyond 1/4 via Interaction. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2022)

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. - Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Huacheng Yu (Electron. Colloquium Comput. Complex., 2022)

Streaming complexity of CSPs with randomly ordered constraints. - Raghuvansh Saxena; Noah Singer; Madhu Sudan 001; Santhoshini Velusamy (Electron. Colloquium Comput. Complex., 2022)

Streaming beyond sketching for Maximum Directed Cut. - Raghuvansh Saxena; Noah Singer; Madhu Sudan 001; Santhoshini Velusamy (Electron. Colloquium Comput. Complex., 2022)

Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions. - Sepehr Assadi; Hrishikesh Khandeparkar; Raghuvansh R. Saxena; S. Matthew Weinberg (SIAM J. Comput., 2022)

Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots. - Raghuvansh R. Saxena; Noah G. Singer; Madhu Sudan 001; Santhoshini Velusamy (FOCS, 2023)

An Improved Lower Bound for Matroid Intersection Prophet Inequalities. - Raghuvansh R. Saxena; Santhoshini Velusamy; S. Matthew Weinberg (ITCS, 2023)

Protecting Single-Hop Radio Networks from Message Drops. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2023)

The Rate of Interactive Codes is Bounded Away from 1. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2024)

Approximately Optimal Mechanism Design for Competing Sellers. - Brendan Lucier; Raghuvansh Raj Saxena (EC, 2025)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut. - Raghuvansh R. Saxena; Noah G. Singer; Madhu Sudan 001; Santhoshini Velusamy (SODA, 2025)

Information Dissemination via Broadcasts in the Presence of Adversarial Noise. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Ran Raz; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2025)

Polynomial Size, Short-Circuit Resilient Circuits for NC. - Raghuvansh Saxena; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2025)