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

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps., , , , and . CoRR, (2023)Hop-Constrained Oblivious Routing., , and . CoRR, (2020)Near-Linear Time Insertion-Deletion Codes and (1+ε)-Approximating Edit Distance via Indexing., , and . CoRR, (2018)Fully Dynamic Consistent k-Center Clustering., , , , and . SODA, page 3463-3484. SIAM, (2024)Efficient Linear and Affine Codes for Correcting Insertions/Deletions., , , and . SODA, page 1-20. SIAM, (2021)Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes., and . ITW, page 470-475. IEEE, (2022)Optimal Strategies for Patrolling Fences., , , , and . ICALP, volume 132 of LIPIcs, page 144:1-144:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Computation-Aware Data Aggregation., , , and . ITCS, volume 151 of LIPIcs, page 65:1-65:38. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Quest for Universally-Optimal Distributed Algorithms (Invited Talk).. DISC, volume 209 of LIPIcs, page 1:1-1:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Bidirectional Dijkstra's Algorithm is Instance-Optimal., , , , and . CoRR, (2024)