Computing the Covers of a String in Linear Time. - Dennis W. G. Moore; William F. Smyth (SODA, 1994)

An Optimal Algorithm to Compute all the Covers of a String. - Dennis W. G. Moore; William F. Smyth (Inf. Process. Lett., 1994)

A Correction to "An Optimal Algorithm to Compute all the Covers of a String". - Dennis W. G. Moore; William F. Smyth (Inf. Process. Lett., 1995)

Covering a String. - Costas S. Iliopoulos; Dennis W. G. Moore; Kunsoo Park (Algorithmica, 1996)

A Characterization of the Squares in a Fibonacci String. - Costas S. Iliopoulos; Dennis W. G. Moore; William F. Smyth (Theor. Comput. Sci., 1997)

Counting Distinct Strings. - Dennis W. G. Moore; William F. Smyth; D. Miller (Algorithmica, 1999)