Author of the publication

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.

, , , , , and . ISAAC, volume 64 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Longest Common Subsequence in k-length substrings., , and . CoRR, (2014)Generalized LCS., , , , and . SPIRE, volume 4726 of Lecture Notes in Computer Science, page 50-61. Springer, (2007)Parameterized dictionary matching and recognition with one gap.. Theor. Comput. Sci., (2021)Weighted LCS., , and . J. Discrete Algorithms, 8 (3): 273-281 (2010)Online Parameterized Dictionary Matching with One Gap., and . Stringology, page 41-55. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2019)Parameterized Dictionary Matching with One Gap.. Stringology, page 103-116. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2018)Mind the Gap! - Online Dictionary Matching with One Gap., , , , , and . Algorithmica, 81 (6): 2123-2157 (2019)Weighted Shortest Common Supersequence., , and . SPIRE, volume 7024 of Lecture Notes in Computer Science, page 44-54. Springer, (2011)A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges., and . Algorithmica, 84 (3): 590-638 (2022)Searching for a Set of Correlated Patterns., and . SPIRE, volume 3246 of Lecture Notes in Computer Science, page 68-69. Springer, (2004)