Author of the publication

A Simple Fast Hybrid Pattern-Matching Algorithm.

, , and . CPM, volume 3537 of Lecture Notes in Computer Science, page 288-297. Springer, (2005)

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

Minimum Unique Substrings and Maximum Repeats., and . Fundam. Informaticae, 110 (1-4): 183-195 (2011)New Perspectives on the Prefix Array., and . SPIRE, volume 5280 of Lecture Notes in Computer Science, page 133-143. Springer, (2008)Computing the Cover Array in Linear Time., and . Algorithmica, 32 (1): 95-106 (2002)Computing the Covers of a String in Linear Time., and . SODA, page 511-515. ACM/SIAM, (1994)A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach., , and . Nord. J. Comput., 10 (1): 21-28 (2003)Computing Quasi Suffix Arrays., , , and . Journal of Automata, Languages and Combinatorics, 8 (4): 593-606 (2003)Counting Distinct Strings., , and . Algorithmica, 23 (1): 1-13 (1999)Simple KMP Pattern-Matching on Indeterminate Strings., and . Stringology, page 125-133. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2020)On Baier's Sort of Maximal Lyndon Substrings., , and . Stringology, page 63-78. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2018)Two Squares Canonical Factorization., , and . Stringology, page 52-58. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2014)