( en | de | ru )

 

Disambiguation of "Smyth, William F."

Author of the publication

copydeleteadd this publication to your clipboard
A note on easy and efficient computation of full abelian periods of a word.

, , , , and . Discret. Appl. Math., (2016)

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 . Stringology, page 69-78. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2004)A Simple Algorithm for Computing the Lempel Ziv Factorization., , and . DCC, page 482-488. IEEE Computer Society, (2008)Key Parameters in Identifying Cost of Spam 2.0., , , and . AINA, page 789-796. IEEE Computer Society, (2010)PRAM Algorithms for Identifying Polygon Similarity., and . Optimal Algorithms, volume 401 of Lecture Notes in Computer Science, page 25-32. Springer, (1989)String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time., , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 65-76. Springer, (2011)Two-Pattern Strings., , , and . CPM, volume 2373 of Lecture Notes in Computer Science, page 76-84. Springer, (2002)A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach., , and . Nord. J. Comput., 10 (1): 21-28 (2003)Computing Quasi Suffix Arrays., , , and . Journal of Automata, Languages and Combinatorics, 8 (4): 593-606 (2003)Counting Distinct Strings., , and . Algorithmica, 23 (1): 1-13 (1999)Computing the Covers of a String in Linear Time., and . SODA, page 511-515. ACM/SIAM, (1994)