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

Circular pattern matching with k mismatches., , , , , , , and . J. Comput. Syst. Sci., (2021)Shortest Covers of All Cyclic Shifts of a String., , , , , , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 69-80. Springer, (2020)String Covers of a Tree., , , , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 68-82. Springer, (2021)Quasi-Linear-Time Algorithm for Longest Common Circular Factor., , , , , , , , and . CPM, volume 128 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Efficient Computation of Sequence Mappability., , , , , , and . SPIRE, volume 11147 of Lecture Notes in Computer Science, page 12-26. Springer, (2018)Efficient Representation and Counting of Antipower Factors in Words., , , , , and . CoRR, (2018)Weighted Shortest Common Supersequence Problem Revisited., , , , , , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 221-238. Springer, (2019)Rectangular Tile Covers of 2D-Strings., , , , and . CPM, volume 223 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Efficient Computation of 2-Covers of a String., and . ESA, volume 173 of LIPIcs, page 77:1-77:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Efficient Computation of Sequence Mappability., , , , , and . Algorithmica, 84 (5): 1418-1440 (2022)