Raghuvansh R. Saxena

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Exponential communication separations between notions of selfishness Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
Optimal error resilience of adaptive message exchange Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
Almost optimal super-constant-pass streaming lower bounds for reachability Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions SIAM Journal on Computing	2022-04-20	Paper
Noisy Beeps Proceedings of the 39th Symposium on Principles of Distributed Computing	2021-03-15	Paper
Interactive error resilience beyond 2/7 Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
Separating the communication complexity of truthful and non-truthful combinatorial auctions Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
Interactive distributed proofs Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing	2019-09-19	Paper
Interactive coding over the noisy broadcast channel Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper
The menu complexity of ``one-and-a-half-dimensional mechanism design	2018-03-15	Paper
The menu complexity of ``one-and-a-half-dimensional mechanism design (available as arXiv preprint)	2018-03-15	Paper

Research outcomes over time

This page was built for person: Raghuvansh R. Saxena