Author of the publication

Faster Compact On-Line Lempel-Ziv Factorization.

, , , , and . STACS, volume 25 of LIPIcs, page 675-686. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Faster STR-IC-LCS Computation via RLE., , , , and . CPM, volume 78 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Factorizing a String into Squares in Linear Time., , , , and . CPM, volume 54 of LIPIcs, page 27:1-27:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Dynamic Edit Distance Table under a General Weighted Cost Function., , and . SOFSEM, volume 5901 of Lecture Notes in Computer Science, page 515-527. Springer, (2010)Novel Results on the Number of Runs of the Burrows-Wheeler-Transform., , , , , and . SOFSEM, volume 12607 of Lecture Notes in Computer Science, page 249-262. Springer, (2021)On-line construction of compact directed acyclic word graphs., , , , , , and . Discret. Appl. Math., 146 (2): 156-179 (2005)Towards Modeling Stored-value Electronic Money Systems., , and . NaBIC, page 902-907. IEEE, (2009)Grammar-compressed Self-index with Lyndon Words., , , , , and . CoRR, (2020)Computing Maximal Palindromes in Non-standard Matching Models., , , , , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 165-179. Springer, (2024)Longest Lyndon Substring After Edit., , , , and . CPM, volume 105 of LIPIcs, page 19:1-19:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings., , , , and . ISAAC, volume 92 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)