Dennis W. G. Moore

According to our database, Dennis W. G. Moore authored at least 6 papers between 1994 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1999

Counting Distinct Strings.

Dennis W. G. Moore, William F. Smyth, D. Miller

Algorithmica, 1999

1997

A Characterization of the Squares in a Fibonacci String.

Costas S. Iliopoulos, Dennis W. G. Moore, William F. Smyth

Theor. Comput. Sci., 1997

1996

Covering a String.

Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park

Algorithmica, 1996

1995

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

1994

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

Dennis W. G. Moore, William F. Smyth

Inf. Process. Lett., 1994

Computing the Covers of a String in Linear Time.

Dennis W. G. Moore, William F. Smyth

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994