From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

3-Query Locally Decodable Codes of Subexponential Length.. Electron. Colloquium Comput. Complex., (2008)Noisy Beeps., , и . Electron. Colloquium Comput. Complex., (2019)Binary Codes with Resilience Beyond 1/4 via Interaction., , , и . FOCS, стр. 1-12. IEEE, (2022)From irreducible representations to locally decodable codes.. STOC, стр. 327-338. ACM, (2012)Lower Bounds for Regular Resolution over Parities., , и . STOC, стр. 640-651. ACM, (2024)Local List Decoding with a Constant Number of Queries., , и . FOCS, стр. 715-722. IEEE Computer Society, (2010)3-Query Locally Decodable Codes of Subexponential Length.. SIAM J. Comput., 41 (6): 1694-1703 (2012)Binary Interactive Error Resilience Beyond $1/8$ (or why $(1/2)^3 > 1/8$)., , и . Electron. Colloquium Comput. Complex., (2021)The Rate of Interactive Codes Is Bounded Away from 1., , , и . STOC, стр. 1424-1437. ACM, (2023)Fast and Bayes-consistent nearest neighbors., , и . AISTATS, том 108 из Proceedings of Machine Learning Research, стр. 1276-1286. PMLR, (2020)