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

Computing minimal and maximal suffixes of a substring., , , , and . Theor. Comput. Sci., (2016)All non-trivial variants of 3-LDT are equivalent., , and . STOC, page 974-981. ACM, (2020)Lower bounds for text indexing with mismatches and differences., , and . SODA, page 1146-1164. SIAM, (2019)Time-Space Trade-Offs for the Longest Common Substring Problem., and . CPM, volume 7922 of Lecture Notes in Computer Science, page 223-234. Springer, (2013)Longest Common Substring with Approximately k Mismatches.. CPM, volume 54 of LIPIcs, page 21:1-21:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Generalised Pattern Matching Revisited., , and . STACS, volume 154 of LIPIcs, page 18:1-18:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares., , and . ISAAC, volume 283 of LIPIcs, page 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Streaming k-mismatch with data recovery and applications., and . CoRR, (2016)Computing the Longest Unbordered Substring., , , and . SPIRE, volume 9309 of Lecture Notes in Computer Science, page 246-257. Springer, (2015)Simple and Efficient String Algorithms for Query Suggestion Metrics Computation., , and . SPIRE, volume 8799 of Lecture Notes in Computer Science, page 268-278. Springer, (2014)