Author of the publication

RLE Edit Distance in Near Optimal Time.

, , , , and . MFCS, volume 138 of LIPIcs, page 66:1-66:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier., , , , and . CoRR, (2020)Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications., , , , , , , , , and 1 other author(s). CoRR, (2023)All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier., , , , and . SODA, page 273-289. SIAM, (2021)Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams., , , and . Algorithmica, 81 (9): 3630-3654 (2019)Better Distance Labeling for Unweighted Planar Graphs., and . WADS, volume 12808 of Lecture Notes in Computer Science, page 428-441. Springer, (2021)Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols., , and . SPAA, page 93-102. ACM, (2019)Approximating Approximate Pattern Matching., and . CPM, volume 128 of LIPIcs, page 15:1-15:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Hamming Distance Completeness., , and . CPM, volume 128 of LIPIcs, page 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lp Pattern Matching in a Stream., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 35:1-35:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Recent Advances in Text-to-Pattern Distance Algorithms.. CiE, volume 12098 of Lecture Notes in Computer Science, page 353-365. Springer, (2020)