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

Computing minimal and maximal suffixes of a substring., , , , and . Theor. Comput. Sci., (2016)Efficient Computation of Sequence Mappability., , , , , and . Algorithmica, 84 (5): 1418-1440 (2022)Fast algorithms for Abelian periods in words and greatest common divisor queries., , and . J. Comput. Syst. Sci., (2017)Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays., and . CoRR, (2021)How Compression and Approximation Affect Efficiency in String Distance Measures., , , and . CoRR, (2021)An Improved Algorithm for The k-Dyck Edit Distance Problem., , , , , and . CoRR, (2021)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)Weighted Shortest Common Supersequence Problem Revisited., , , , , , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 221-238. Springer, (2019)Efficient Algorithms for Shortest Partial Seeds in Words., , , , and . CPM, volume 8486 of Lecture Notes in Computer Science, page 192-201. Springer, (2014)A note on efficient computation of all Abelian periods in a string., , , , , , , , and . Inf. Process. Lett., 113 (3): 74-77 (2013)