Raghuvansh R. Saxena

According to our database1, Raghuvansh R. Saxena authored at least 36 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Rate of Interactive Codes is Bounded Away from 1.
Electron. Colloquium Comput. Complex., 2024

Information Dissemination via Broadcasts in the Presence of Adversarial Noise.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
Protecting Single-Hop Radio Networks from Message Drops.
Electron. Colloquium Comput. Complex., 2023

An Improved Lower Bound for Matroid Intersection Prophet Inequalities.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions.
SIAM J. Comput., June, 2022

Streaming beyond sketching for Maximum Directed Cut.
Electron. Colloquium Comput. Complex., 2022

Streaming complexity of CSPs with randomly ordered constraints.
Electron. Colloquium Comput. Complex., 2022

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly.
Electron. Colloquium Comput. Complex., 2022

Binary Codes with Resilience Beyond 1/4 via Interaction.
Electron. Colloquium Comput. Complex., 2022

Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds.
Electron. Colloquium Comput. Complex., 2022

Interactive Coding with Small Memory.
Electron. Colloquium Comput. Complex., 2022

Circuits Resilient to Short-Circuit Errors.
Electron. Colloquium Comput. Complex., 2022

Round-vs-Resilience Tradeoffs for Binary Feedback Channels.
Electron. Colloquium Comput. Complex., 2022

Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.
Electron. Colloquium Comput. Complex., 2022

2021
Communication Complexity: For Coding, Commerce, and Currents
PhD thesis, 2021

Optimal Error Resilience of Adaptive Message Exchange.
Electron. Colloquium Comput. Complex., 2021

Binary Interactive Error Resilience Beyond $1/8$ (or why $(1/2)^3 > 1/8$).
Electron. Colloquium Comput. Complex., 2021

Tight Bounds for General Computation in Noisy Broadcast Networks.
Electron. Colloquium Comput. Complex., 2021

Computation Over the Noisy Broadcast Channel with Malicious Parties.
Electron. Colloquium Comput. Complex., 2021

Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability.
Electron. Colloquium Comput. Complex., 2021

Exponential communication separations between notions of selfishness.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

99% Revenue with Constant Enhanced Competition.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Near Optimal Distributed Learning of Halfspaces with Two Parties.
Proceedings of the Conference on Learning Theory, 2021

2020
Interactive Error Resilience Beyond 2/7.
Electron. Colloquium Comput. Complex., 2020

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes.
Electron. Colloquium Comput. Complex., 2020

Separating the communication complexity of truthful and non-truthful combinatorial auctions.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Optimal Mechanism Design for Single-Minded Agents.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Radio Network Coding Requires Logarithmic Overhead.
Electron. Colloquium Comput. Complex., 2019

Noisy Beeps.
Electron. Colloquium Comput. Complex., 2019

Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility.
CoRR, 2019

2018
The menu complexity of "one-and-a-half-dimensional" mechanism design.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Interactive Distributed Proofs.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Interactive Coding Over the Noisy Broadcast Channel.
Electron. Colloquium Comput. Complex., 2017


  Loading...