Author of the publication

An Optimal Algorithm to Compute all the Covers of a String.

, and . Inf. Process. Lett., 50 (5): 239-246 (1994)

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

Computing the Covers of a String in Linear Time., and . SODA, page 511-515. ACM/SIAM, (1994)Covering a String., , and . Algorithmica, 16 (3): 288-297 (1996)Counting Distinct Strings., , and . Algorithmica, 23 (1): 1-13 (1999)Covering a String., , and . CPM, volume 684 of Lecture Notes in Computer Science, page 54-62. Springer, (1993)A Correction to Än Optimal Algorithm to Compute all the Covers of a String"., and . Inf. Process. Lett., 54 (2): 101-103 (1995)An Optimal Algorithm to Compute all the Covers of a String., and . Inf. Process. Lett., 50 (5): 239-246 (1994)A Characterization of the Squares in a Fibonacci String., , and . Theor. Comput. Sci., 172 (1-2): 281-291 (1997)