Raghuvansh R. Saxena

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 40

Top Topics

Combinatorial Auctions

Error Resilience

Top Venues

Publications

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena
Information Dissemination via Broadcasts in the Presence of Adversarial Noise. CCC (2024)
Raghuvansh R. Saxena, Santhoshini Velusamy, S. Matthew Weinberg
An Improved Lower Bound for Matroid Intersection Prophet Inequalities. ITCS (2023)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Protecting Single-Hop Radio Networks from Message Drops. ICALP (2023)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds. ITCS (2023)
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Interactive Coding with Small Memory. SODA (2023)
Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Huacheng Yu
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. ITCS (2023)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. SODA (2023)
Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy
Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots. FOCS (2023)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
The Rate of Interactive Codes Is Bounded Away from 1. STOC (2023)
Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy
Streaming complexity of CSPs with randomly ordered constraints. SODA (2023)
Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy
Streaming beyond sketching for Maximum Directed Cut. CoRR (2022)
Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions. SIAM J. Comput. 51 (3) (2022)
Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang
Binary Codes with Resilience Beyond 1/4 via Interaction. FOCS (2022)
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Circuits resilient to short-circuit errors. STOC (2022)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Tight Bounds for General Computation in Noisy Broadcast Networks. FOCS (2022)
Raghuvansh R. Saxena, Santhoshini Velusamy, S. Matthew Weinberg
An Improved Lower Bound for Matroid Intersection Prophet Inequalities. CoRR (2022)
Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy
Streaming complexity of CSPs with randomly ordered constraints. CoRR (2022)
Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena
Near Optimal Distributed Learning of Halfspaces with Two Parties. COLT (2021)
Linda Cai, Raghuvansh R. Saxena
99% Revenue with Constant Enhanced Competition. CoRR (2021)
Linda Cai, Raghuvansh R. Saxena
99% Revenue with Constant Enhanced Competition. EC (2021)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. ICALP (2021)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Tight Bounds for General Computation in Noisy Broadcast Networks. FOCS (2021)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Computation over the Noisy Broadcast Channel with Malicious Parties. ITCS (2021)
Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
Optimal error resilience of adaptive message exchange. STOC (2021)
Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao
Exponential communication separations between notions of selfishness. STOC (2021)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
Almost optimal super-constant-pass streaming lower bounds for reachability. STOC (2021)
Nikhil R. Devanur, Kira Goldner, Raghuvansh R. Saxena, Ariel Schvartzman, S. Matthew Weinberg
Optimal Mechanism Design for Single-Minded Agents. EC (2020)
Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
Binary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{8}$ (or why $({{}^{1}}\!/\!_{2})^{3} > {{}^{1}}\!/\!_{8})$. FOCS (2020)
Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg
Separating the Communication Complexity of Truthful and Non-Truthful Combinatorial Auctions. CoRR (2020)
Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
Interactive error resilience beyond 2/7. STOC (2020)
Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
Noisy Beeps. PODC (2020)
Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg
Separating the communication complexity of truthful and non-truthful combinatorial auctions. STOC (2020)
Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao
Exponential Communication Separations between Notions of Selfishness. CoRR (2020)
Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. CoRR (2020)
Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. FOCS (2020)
Zvika Brakerski, Yael Tauman Kalai, Raghuvansh R. Saxena
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes. FOCS (2020)
Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena
Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility. CoRR (2019)
Raghuvansh R. Saxena, Ariel Schvartzman, S. Matthew Weinberg
The menu complexity of "one-and-a-half-dimensional" mechanism design. SODA (2018)
Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena
Interactive Distributed Proofs. PODC (2018)
Raghuvansh R. Saxena, Ariel Schvartzman, S. Matthew Weinberg
The menu complexity of "one-and-a-half-dimensional" mechanism design. CoRR (2017)