Author of the publication

A taxonomy of suffix array construction algorithms.

, , and . Stringology, page 1-30. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (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

Covering a Circular String with Substrings of Fixed Length., and . Int. J. Found. Comput. Sci., 7 (1): 87-93 (1996)Sorting suffixes of two-pattern strings., and . Int. J. Found. Comput. Sci., 16 (6): 1135-1144 (2005)An Optimal Algorithm to Compute all the Covers of a String., and . Inf. Process. Lett., 50 (5): 239-246 (1994)String Comparison in V-Order: New Lexicographic Properties & On-line Applications., , , and . CoRR, (2015)Editorial., , and . J. Discrete Algorithms, (2018)A New Periodicity Lemma., , , and . SIAM J. Discret. Math., 20 (3): 656-668 (2006)Lempel-Ziv Factorization Using Less Time & Space., , and . Math. Comput. Sci., 1 (4): 605-623 (2008)String covering with optimal covers., and . J. Discrete Algorithms, (2018)A New Periodicity Lemma., , and . CPM, volume 3537 of Lecture Notes in Computer Science, page 257-265. Springer, (2005)Suffix arrays: what are they good for?, , and . ADC, volume 49 of CRPIT, page 17-18. Australian Computer Society, (2006)