Author of the publication

Computing the Minimum k-Cover of a String.

, , , , and . Stringology, page 51-64. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2003)

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

On the Detection of Robust Curves., and . CVGIP: Graphical Model and Image Processing, 56 (3): 189-204 (1994)New Upper Bounds for Neighbor Searching, , , and . Information and Control, 68 (1-3): 105-124 (January 1986)The Expected Advantage of Asynchrony., and . J. Comput. Syst. Sci., 51 (2): 286-300 (1995)Definitional Boolean calculi.. Notre Dame Journal of Formal Logic, 9 (4): 343-350 (1968)An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location., and . J. Parallel Distrib. Comput., 8 (3): 280-285 (1990)Faster Suffix Tree Construction with Missing Suffix Links., and . SIAM J. Comput., 33 (1): 26-42 (2003)Tree Pattern Matching to Subset Matching in Linear Time., and . SIAM J. Comput., 32 (4): 1056-1066 (2003)Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm.. SIAM J. Comput., 23 (5): 1075-1091 (1994)Approximate String Matching: A Simpler Faster Algorithm., and . SODA, page 463-472. ACM/SIAM, (1998)Online Algorithms for Finger Searching (Extended Abstract), and . FOCS, page 480-489. IEEE Computer Society, (1990)0-8186-2082-X.