Author of the publication

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)

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

Reachability Preservers: New Extremal Bounds and Approximation Algorithms., and . SODA, page 1865-1883. SIAM, (2018)More Applications of the Polynomial Method to Algorithm Design., , and . SODA, page 218-230. SIAM, (2015)APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time., , and . FOCS, page 1135-1146. IEEE, (2021)On Diameter Approximation in Directed Graphs., , , and . ESA, volume 274 of LIPIcs, page 2:1-2:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond., , , and . STOC, page 1487-1500. ACM, (2022)New hardness results for planar graph problems in p and an algorithm for sparsest cut., , and . STOC, page 996-1009. ACM, (2020)Impossibility Results for Grammar-Compressed Linear Algebra., , , and . NeurIPS, (2020)Subquadratic High-Dimensional Hierarchical Clustering., , and . NeurIPS, page 11576-11586. (2019)Listing 4-Cycles., , , and . FSTTCS, volume 284 of LIPIcs, page 25:1-25:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Safe-Zones for Monitoring Distributed Streams., , , , , and . BD3@VLDB, volume 1018 of CEUR Workshop Proceedings, page 7-12. CEUR-WS.org, (2013)