William F. Smyth

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

A New Periodicity Lemma.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Reconstructing a Suffix Array.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Song classifications for dancing.

[BibT_eX]

[DOI]

Manolis Christodoulakis

Mohammad Sohel Rahman

Proceedings of the Prague Stringology Conference, 2006

Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2006

Finding Patterns with Variable Length Gaps or Don't Cares.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Suffix arrays: what are they good for?

[BibT_eX]

[DOI]

Proceedings of the Database Technologies 2006, 2006

2005

The Complexity of the Minimum k-Cover Problem.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

Sorting suffixes of two-pattern strings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

The Performance of Linear Time Suffix Sorting Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

A New Periodicity Lemma.

[BibT_eX]

[DOI]

Kangmin Fan

R. J. Simpson

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2003

String Regularities with Don't Cares.

[BibT_eX]

Athanasios K. Tsakalidis

Nord. J. Comput., 2003

A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach.

[BibT_eX]

Xiangdong Xiao

Nord. J. Comput., 2003

Two-pattern strings I - A recognition algorithm.

[BibT_eX]

[DOI]

Weilin Lu

J. Discrete Algorithms, 2003

Computing all Repeats Using Suffix Arrays.

[BibT_eX]

[DOI]

Yudong Tang

J. Autom. Lang. Comb., 2003

Computing Quasi Suffix Arrays.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Computing the Minimum k-Cover of a String.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

Heuristics for Image Retrieval Using Spatial Configurations.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Digital Image Computing: Techniques and Applications, 2003

2002

Computing the Cover Array in Linear Time.

[BibT_eX]

[DOI]

Yin Li

Algorithmica, 2002

Two-Pattern Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

An Approach to Phrase Selection for Offline Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Computer Science 2002, 2002

2001

Approximate periods of strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

Repetitive perhaps, but certainly not boring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Repetitions in Sturmian strings.

[BibT_eX]

[DOI]

Ayse Karaman

Theor. Comput. Sci., 2000

Repetitions in two-pattern strings.

[BibT_eX]

[DOI]

Weilin Lu

Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

1999

Counting Distinct Strings.

[BibT_eX]

[DOI]

D. Miller

Algorithmica, 1999

1997

A Characterization of the Squares in a Fibonacci String.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

1996

Covering a Circular String with Substrings of Fixed Length.

[BibT_eX]

[DOI]

Art M. Duval

Int. J. Found. Comput. Sci., 1996

1995

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

A fast average case algorithm for lyndon decomposition.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1995

A family of sparse graphs of large sum number.

[BibT_eX]

[DOI]

Nora Hartsfield

Discret. Math., 1995

1994

Parallel RAM Algorithms for Factorizing Words.

[BibT_eX]

[DOI]

Jacqueline W. Daykin

Theor. Comput. Sci., 1994

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Computing the Covers of a String in Linear Time.

[BibT_eX]

[DOI]

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

1993

A Fast and Effective Heuristic for the Feedback Arc Set Problem.

[BibT_eX]

[DOI]

Peter Eades

Xuemin Lin

Inf. Process. Lett., 1993

Automated Cryptanalysis of Substitution Ciphers.

[BibT_eX]

[DOI]

Reihaneh Safavi-Naini

Cryptologia, 1993

1992

Optimal Algorithms for Computing the canonical form of a circular string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Graphs of maximum diameter.

[BibT_eX]

[DOI]

Lou Caccetta

Discret. Math., 1992

1991

Mu-Balancing M-Way Search Trees.

[BibT_eX]

[DOI]

Comput. J., 1991

1990

Closed form expressions for the iterated floor function.

[BibT_eX]

[DOI]

K. A. Redish

Discret. Math., 1990

1989

PRAM Algorithms for Identifying Polygon Similarity.

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1987

Evaluating Measures of Program Quality.

[BibT_eX]

[DOI]

K. A. Redish

Comput. J., 1987

1986

Program Style Analysis: A Natural By-Product of Program Compilation.

[BibT_eX]

[DOI]

K. A. Redish

Commun. ACM, 1986

1980

The Encouragement of Effective Computer Use in Developing Countries.

[BibT_eX]

N. W. N. Jayasiri

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1976

Another algorithm for reducing bandwidth and profile of a sparse matrix.

[BibT_eX]

[DOI]

Ilona Arany

Proceedings of the American Federation of Information Processing Societies: 1976 National Computer Conference, 1976

1974

A Storage Scheme for Hierarchic Structures.

[BibT_eX]

[DOI]

E. Radaceanu

Comput. J., 1974

An Algorithm for Finding the Diameter of a Graph.

[BibT_eX]

W. M. L. Benzi

Proceedings of the Information Processing, 1974

1971

An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices.

[BibT_eX]

Ilona Arany

Lajos Szoda