Author of the publication

Extracting Powers and Periods in a String from Its Runs Structure.

, , , , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 258-269. Springer, (2010)

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

Efficient Counting of Square Substrings in a Tree., , , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 207-216. Springer, (2012)Longest Common Factor After One Edit Operation., , , , and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 14-26. Springer, (2017)Efficient counting of square substrings in a tree., , , , and . Theor. Comput. Sci., (2014)Approximate Circular Pattern Matching Under Edit Distance., , , , , and . STACS, volume 289 of LIPIcs, page 24:1-24:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Efficient Computation of Sequence Mappability., , , , , , and . SPIRE, volume 11147 of Lecture Notes in Computer Science, page 12-26. Springer, (2018)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)Universal Reconstruction of a String., , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 386-397. Springer, (2015)On the Maximal Number of Cubic Runs in a String., , , , , and . LATA, volume 6031 of Lecture Notes in Computer Science, page 227-238. Springer, (2010)A linear time algorithm for seeds computation., , , , and . SODA, page 1095-1112. SIAM, (2012)