Author of the publication

On Minimal and Maximal Suffixes of a Substring.

, , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 28-37. Springer, (2013)

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

Substring Suffix Selection., , , and . CoRR, (2013)Computing Lempel-Ziv Factorization Online.. MFCS, volume 7464 of Lecture Notes in Computer Science, page 789-799. Springer, (2012)Dynamic and Approximate Pattern Matching in 2D., , , and . SPIRE, volume 9954 of Lecture Notes in Computer Science, page 133-144. (2016)On Minimal and Maximal Suffixes of a Substring., , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 28-37. Springer, (2013)On Maximal Unbordered Factors., , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 343-354. Springer, (2015)A Suffix Tree Or Not a Suffix Tree?, and . IWOCA, volume 8986 of Lecture Notes in Computer Science, page 338-350. Springer, (2014)Communication and Streaming Complexity of Approximate Pattern Matching.. CPM, volume 78 of LIPIcs, page 13:1-13:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Upper and Lower Bounds for Dynamic Data Structures on Strings., , , and . STACS, volume 96 of LIPIcs, page 22:1-22:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Cross-document pattern matching., , , and . J. Discrete Algorithms, (2014)Compressed Indexing for Consecutive Occurrences., , , and . CPM, volume 259 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)