Raghuvansh R. Saxena

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

Venues

Active years

2018–2026

Best venue rank

Where they publish

Papers

25 indexed papers, newest first.

Year	Venue	Title	Authors
2026	ICALP	White-Box Adversarial Streaming Lower Bounds Beyond Two-Party Communication.	Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang
2025	FOCS	Constant Rate Codes for Adaptive Broadcasts Do Not Exist.	Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2025	SODA	Streaming Algorithms via Local Algorithms for Maximum Directed Cut.	Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy
2023	FOCS	Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots.	Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy
2023	ICALP	Protecting Single-Hop Radio Networks from Message Drops.	Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2023	SODA	Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.	Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2023	SODA	Interactive Coding with Small Memory.	Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
2023	SODA	Streaming complexity of CSPs with randomly ordered constraints.	Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy
2023	STOC	The Rate of Interactive Codes Is Bounded Away from 1.	Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2022	FOCS	Binary Codes with Resilience Beyond 1/4 via Interaction.	Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang
2022	STOC	Circuits resilient to short-circuit errors.	Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
2021	COLT	Near Optimal Distributed Learning of Halfspaces with Two Parties.	Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena
2021	FOCS	Tight Bounds for General Computation in Noisy Broadcast Networks.	Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2021	ICALP	Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.	Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2021	STOC	Almost optimal super-constant-pass streaming lower bounds for reachability.	Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2021	STOC	Optimal error resilience of adaptive message exchange.	Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2021	STOC	Exponential communication separations between notions of selfishness.	Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao
2020	FOCS	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
2020	FOCS	Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes.	Zvika Brakerski, Yael Tauman Kalai, Raghuvansh R. Saxena
2020	FOCS	Binary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{8}$ (or why $({{}^{1}}\!/\!_{2})^{3} > {{}^{1}}\!/\!_{8})$.	Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2020	PODC	Noisy Beeps.	Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2020	STOC	Separating the communication complexity of truthful and non-truthful combinatorial auctions.	Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg
2020	STOC	Interactive error resilience beyond 2/7.	Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2018	PODC	Interactive Distributed Proofs.	Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena
2018	SODA	The menu complexity of "one-and-a-half-dimensional" mechanism design.	Raghuvansh R. Saxena, Ariel Schvartzman, S. Matthew Weinberg