Raghuvansh R. Saxena

Available identifiers

Publication	Date of Publication	Type
Protecting single-hop radio networks from message drops	2024-11-14	Paper
An improved lower bound for matroid intersection prophet inequalities	2024-09-25	Paper
Noisy radio network lower bounds via noiseless beeping lower bounds	2024-09-25	Paper
Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly	2024-09-25	Paper
Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut}	2024-05-14	Paper
Interactive coding with small memory	2024-05-14	Paper
Streaming complexity of CSPs with randomly ordered constraints	2024-05-14	Paper
The rate of interactive codes is bounded away from 1	2024-05-08	Paper
Circuits resilient to short-circuit errors	2023-12-08	Paper
Exponential communication separations between notions of selfishness	2023-11-14	Paper
Optimal error resilience of adaptive message exchange	2023-11-14	Paper
Almost optimal super-constant-pass streaming lower bounds for reachability	2023-11-14	Paper
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions	2022-04-20	Paper
Noisy Beeps	2021-03-15	Paper
Interactive error resilience beyond 2/7	2021-01-19	Paper
Separating the communication complexity of truthful and non-truthful combinatorial auctions	2021-01-19	Paper
Interactive Distributed Proofs	2019-09-19	Paper
Interactive coding over the noisy broadcast channel	2019-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4608024	2018-03-15	Paper

This page was built for person: Raghuvansh R. Saxena