Author of the publication

Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).

, , and . ITCS, volume 185 of LIPIcs, page 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Local List Recovery of High-Rate Tensor Codes & Applications., , and . FOCS, page 204-215. IEEE Computer Society, (2017)LDPC Codes Achieve List Decoding Capacity., , , , and . FOCS, page 458-469. IEEE, (2020)Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes., , and . CoRR, (2023)On Public Key Encryption from Noisy Codewords., , , , and . Electron. Colloquium Comput. Complex., (2015)On Public Key Encryption from Noisy Codewords., , , , and . Public Key Cryptography (2), volume 9615 of Lecture Notes in Computer Science, page 417-446. Springer, (2016)Efficient list-decoding with constant alphabet and list sizes., and . STOC, page 1502-1515. ACM, (2021)Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 955-966. Springer, (2014)On List Recovery of High-Rate Tensor Codes., , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 68:1-68:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Proving as fast as computing: succinct arguments with constant prover overhead., and . STOC, page 1353-1363. ACM, (2022)Sparse Affine-Invariant Linear Codes Are Locally Testable., , and . FOCS, page 561-570. IEEE Computer Society, (2012)