Author of the publication

Efficient Algorithms for Shortest Partial Seeds in Words.

, , , , and . CPM, volume 8486 of Lecture Notes in Computer Science, page 192-201. Springer, (2014)

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

A Linear Time Algorithm for Seeds Computation, , , , and . CoRR, (2011)Linear-time version of Holub's algorithm for morphic imprimitivity testing., , , and . Theor. Comput. Sci., (2015)2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW)., and . J. Discrete Algorithms, (2016)Covering problems for partial words and for indeterminate strings., , , , , and . Theor. Comput. Sci., (2017)Efficient counting of square substrings in a tree., , , , and . Theor. Comput. Sci., (2014)Universal reconstruction of a string., , , , and . Theor. Comput. Sci., (2020)Efficient Counting of Square Substrings in a Tree., , , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 207-216. Springer, (2012)Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties., and . CPM, volume 54 of LIPIcs, page 8:1-8:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)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)Longest Common Factor After One Edit Operation., , , , and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 14-26. Springer, (2017)