PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Smyth, William F."

Author of the publication

copydeleteadd this publication to your clipboard
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.

F. Dörr

F. Laufer

F. Rusitschka

F. Perni

F. D{\"o}rr

 

Other publications of authors with the same name

An Optimal Algorithm to Compute all the Covers of a String., and . Inf. Process. Lett., 50 (5): 239-246 (1994)A New Periodicity Lemma., , , and . SIAM J. Discrete Math., 20 (3): 656-668 (2006)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)Quasi-linear Time Computation of the Abelian Periods of a Word., , , , and . Stringology, page 103-110. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2012)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)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)Optimal Algorithms for Computing the canonical form of a circular string., and . Theor. Comput. Sci., 92 (1): 87-105 (1992)Sorting suffixes of two-pattern strings., and . Int. J. Found. Comput. Sci., 16 (6): 1135-1144 (2005)Covering a Circular String with Substrings of Fixed Length., and . Int. J. Found. Comput. Sci., 7 (1): 87-93 (1996)An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings., and . Int. J. Found. Comput. Sci., 20 (6): 985-1004 (2009)