( en | de | ru )

 

Disambiguation of "Smyth, William F."

Author of the publication

copydeleteadd this publication to your clipboard
The Performance of Linear Time Suffix Sorting Algorithms.

, , and . DCC, page 358-367. IEEE Computer Society, (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.

William F Meinecke

Ben Smyth

Maureen Smyth

Padhraic Smyth

Michael Smyth

 

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)Covering a Circular String with Substrings of Fixed Length., and . Int. J. Found. Comput. Sci., 7 (1): 87-93 (1996)Optimal Algorithms for Computing the canonical form of a circular string., and . Theor. Comput. Sci., 92 (1): 87-105 (1992)A Characterization of the Squares in a Fibonacci String., , and . Theor. Comput. Sci., 172 (1-2): 281-291 (1997)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 . 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)String Comparison in V-Order: New Lexicographic Properties & On-line Applications., , , and . CoRR, (2015)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)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)