Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Klim Efremenko"'
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:
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:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
Hypothesis Selection is a fundamental distribution learning problem where given a comparator-class $Q=\{q_1,\ldots, q_n\}$ of distributions, and a sampling access to an unknown target distribution $p$, the goal is to output a distribution $q$ such th
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:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b89c1494bd50305b3d15f121a195ee6
Publikováno v:
FOCS
Interactive error correcting codesInteractive error correcting codes are codes that encode a two party communication protocol to an error-resilient protocol that succeeds even if a constant fraction of the communicated symbols are adversarially corru
Publikováno v:
Proceedings of the 39th Symposium on Principles of Distributed Computing.
We study the effect of noise on the n-party beeping model. In this model, in every round, each party may decide to either 'beep' or not. All parties hear a beep if and only if at least one party beeps. The beeping model is becoming increasingly popul
Publikováno v:
STOC
Interactive error correcting codes can protect interactive communication protocols against a constant fraction of adversarial errors, while incurring only a constant multiplicative overhead in the total communication. What is the maximum fraction of