Author of the publication

Deterministic 3SUM-Hardness.

, , and . ITCS, volume 287 of LIPIcs, page 49:1-49:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours., and . J. Log. Algebraic Methods Program., (2019)Deterministic 3SUM-Hardness., , and . ITCS, volume 287 of LIPIcs, page 49:1-49:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Structural Investigation of the Approximability of Polynomial-Time Problems., , , and . ICALP, volume 229 of LIPIcs, page 30:1-30:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Dynamic Dynamic Time Warping., , , , , and . CoRR, (2023)The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties., , and . SODA, page 4704-4727. SIAM, (2024)Faster Sublinear-Time Edit Distance., , , and . SODA, page 3274-3301. SIAM, (2024)Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!, , and . FOCS, page 515-538. IEEE, (2023)Can You Solve Closest String Faster Than Exhaustive Search?, , , , and . ESA, volume 274 of LIPIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics., , and . STOC, page 391-404. ACM, (2023)Faster Combinatorial k-Clique Algorithms., , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 193-206. Springer, (2024)