Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Raghuvansh R. Saxena"'
Publikováno v:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing.
Autor:
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d04dd8325c13e3aeee53c3c8ce7af6be
https://doi.org/10.1137/1.9781611977554.ch137
https://doi.org/10.1137/1.9781611977554.ch137
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::830187c3d1a99e03f97e5228df8ff494
https://doi.org/10.1137/1.9781611977554.ch156
https://doi.org/10.1137/1.9781611977554.ch156
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca3b8f29d8e114dc14a02a951f5a677c
https://doi.org/10.1137/1.9781611977554.ch35
https://doi.org/10.1137/1.9781611977554.ch35
Publikováno v:
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS).
Autor:
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Publikováno v:
STOC 2022
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Publikováno v:
STOC
We give an almost quadratic n2−o(1) lower bound on the space consumption of any o(√logn)-pass streaming algorithm solving the (directed) s-t reachability problem. This means that any such algorithm must essentially store the entire graph. As coro
Publikováno v:
STOC
We study the error resilience of the message exchange task: Two parties, each holding a private input, want to exchange their inputs. However, the channel connecting them is governed by an adversary that may corrupt a constant fraction of the transmi
Publikováno v:
SIAM Journal on Computing. 51:STOC20-75
Autor:
Raghuvansh R. Saxena, Linda Cai
Publikováno v:
EC
The enhanced competition paradigm is an attempt at bridging the gap between simple and optimal auctions. In this line of work, given an auction setting with $m$ items and $n$ bidders, the goal is to find the smallest $n' \geq n$ such that selling the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd6abd3954bf9a66a8f4e81ce4ab2269