Author of the publication

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

Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs., , and . Comb., 41 (4): 545-579 (2021)Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity., and . Electron. Colloquium Comput. Complex., (2021)Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations., , and . SIAM J. Comput., 51 (3): 577-626 (2022)Explicit two-deletion codes with redundancy matching the existential bound., and . SODA, page 21-32. SIAM, (2021)d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors., and . ICALP, volume 168 of LIPIcs, page 62:1-62:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Beating Fredman-Komlós for Perfect k-Hashing., and . ICALP, volume 132 of LIPIcs, page 92:1-92:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On expanding the toolkit of locality-based coded computation to the coordinates of inputs., , and . ISIT, page 2171-2176. IEEE, (2023)Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random., , and . STOC, page 678-689. ACM, (2022)Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph., , and . APPROX-RANDOM, volume 81 of LIPIcs, page 8:1-8:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Isolate and then Identify: Rethinking Adaptive Group Testing., and . CoRR, (2024)