Author of the publication

Crochemore's Repetitions Algorithm Revisited: Computing Runs.

, and . Int. J. Found. Comput. Sci., 23 (2): 389-401 (2012)

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

Sorting suffixes of two-pattern strings., and . Int. J. Found. Comput. Sci., 16 (6): 1135-1144 (2005)Comparison of Various Routines for Unknown Attribute Value Processing The Covering Paradigm., and . IJPRAI, 10 (8): 939-955 (1996)On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6.. Combinatorica, 22 (3): 451-454 (2002)Triangles in 2-factorizations., , , and . J. Graph Theory, 26 (2): 83-94 (1997)How many double squares can a string contain?, , and . Discret. Appl. Math., (2015)Repetitions in Sturmian strings., , and . Theor. Comput. Sci., 249 (2): 289-303 (2000)On a lemma of Crochemore and Rytter., , and . J. Discrete Algorithms, (2015)Algorithms to Compute the Lyndon Array Revisited., and . Stringology, page 16-28. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2019)A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach., , and . Stringology, page 56-43. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2002)The Way of Adjusting Parameters of the Expert System Shell McESE: New Approach., and . PRIS, page 119-126. INSTICC Press, (2006)