Author of the publication

Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings.

. SPIRE, volume 7608 of Lecture Notes in Computer Science, page 229-236. Springer, (2012)

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

Testing Generalised Freeness of Words., , and . STACS, volume 25 of LIPIcs, page 337-349. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Tying up the loose ends in fully LZW-compressed pattern matching.. STACS, volume 14 of LIPIcs, page 624-635. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Efficiently Finding All Maximal alpha-gapped Repeats., , , , and . STACS, volume 47 of LIPIcs, page 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Speeding up dynamic programming in the line-constrained k-median., and . Theory Comput. Syst., 62 (6): 1351-1365 (2018)Order-Preserving Squares in Strings., , and . CPM, volume 259 of LIPIcs, page 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Optimal pattern matching in LZW compressed strings.. SODA, page 362-372. SIAM, (2011)Planar Negative k-Cycle., , and . SODA, page 2717-2724. SIAM, (2021)Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs., and . ISAAC, volume 181 of LIPIcs, page 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Finding the KT Partition of a Weighted Graph in Near-Linear Time., , and . APPROX/RANDOM, volume 245 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fast and Longest Rollercoasters., , and . STACS, volume 126 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)