- SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 3, pp. 656668
- Computing quasi sux arrays Franti sek Fran ek 1 W. F. Smyth 1;2 Xiangdong Xiao 1
- On-line Algorithms for k-Covering Costas S. Iliopoulos 1? and W.F. Smyth 2??
- Algorithms on Indeterminate Strings J. Holub 1;2? and W. F. Smyth 1;3??
- Journal of Automata, Languages and Combinatorics u (v) w, x{y Otto-von-Guericke-Universitat Magdeburg
- An Approach to Phrase Selection for O ine Data Compression A. Turpin W. F. Smyth
- Nordic Journal of Computing A NOTE ON CROCHEMORE'S REPETITIONS
- PROBLEMS & CONJECTURES ON SUM GRAPHS Nora Hartsfield
- The Sum Number of the Cocktail Party Graph Mirka MILLER
- Two-Pattern Strings I | A Recognition Frantisek Franek Weilin Lu W. F. Smyth
- THE COVERS OF A CIRCULAR FIBONACCI STRING Costas S. Iliopoulos
- Approximate Periods of Strings Jeong Seop Sim 1 ? Costas S. Iliopoulos 2 4 y
- A Simple Fast Hybrid Pattern-Matching Algorithm ?
- A FAMILY OF SPARSE GRAPHS OF LARGE SUM NUMBER Nora Hartsfield
- A FAST & EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM Peter Eades
- New Sux Array Algorithms | Linear But Not Fast?
- The complexity of the minimum k-cover problem October 6, 2003
- A Taxonomy of Su#x Array Construction SIMON J. PUGLISI
- Computing Patterns in Strings II: Generic Patterns
- APPROXIMATE PERIODICITY IN STRINGS W. F. Smyth
- Two-Pattern Strings ? Franti sek Fran ek 1 , Jiandong Jiang 1;2 , Weilin Lu 1;2 , and W. F. Smyth 1;3
- The Maximum Number of Runs in a String ? Franti sek Fran ek 1 , R. J. Simpson 2 , and W. F. Smyth 1;3
- COMPUTING THE COVER ARRAY IN LINEAR TIME
- From cain.cs.curtin.edu.au!smyth Sat Nov 16 19:45:22 1996 To: bill@maccs.dcss.mcmaster.ca Subject: distinct.tex
- A characterization of the Squares in a Fibonacci string
- The Sum Number of a Disjoint Union of Graphs Mirka MILLER
- International Journal of Foundations of Computer Science fl World Scientific Publishing Company
- GRAPHS WITH SMALL GENERALIZED CHROMATIC NUMBER W. F. Smyth
- Computing all repeats using sux Franti sek Fran ek 1 , W. F. Smyth 1;2 , and Yudong Tang 1
- WEAK REPETITIONS IN STRINGS L. J. Cummings
- Computing Periodicities in Strings --A New W. F. Smyth1,2
- Labelling Wheels for Minimum Sum Number Mirka MILLER Joseph RYAN
- AN OPTIMAL ALGORITHM TO COMPUTE ALL THE COVERS OF A STRING Dennis Moore
- New Complexity Results for the k-Covers Costas S. Iliopoulos 1? , Manal Mohamed 1?? , and W.F. Smyth 2? ? ?
- Fast Pattern-Matching on Indeterminate Jan Holub1, W. F. Smyth2,3, and Shu Wang2
- REPETITIVE PERHAPS, BUT CERTAINLY NOT BORING W. F. Smyth
- Computing the Covers of a String in Linear Time Dennis Moore* W. F. Smythy
- Retrieval by Spatial Con guration Xin Chen a , C. P. Lam b and W. F. Smyth c d
- The Maximum Number of Runs in a String Bill Smyth1,2
- Computing Patterns in Strings I: Specific, Generic, Intrinsic
- Computing Patterns in Strings III: Intrinsic Patterns
- REPETITIONS IN STURMIAN STRINGS Franti sek Fran ek
- StringMasters @ McMaster --SAM'07 36 July 2007
- PROBLEMS & CONJECTURES ON SUM GRAPHS Nora Hartsfield
- GRAPHS WITH SMALL GENERALIZED CHROMATIC NUMBER W. F. Smyth
- A FAST & EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM Peter Eades
- From cain.cs.curtin.edu.au!smyth Sat Nov 16 19:45:22 1996 To: bill@maccs.dc* *ss.mcmaster.ca Subject
- SUM GRAPHS OF SMALL SUM NUMBER W. F. Smyth
- Correction to AN OPTIMAL ALGORITHM TO COMPUTE ALL THE COVERS OF A STRING
- SUM GRAPHS OF SMALL SUM NUMBER W. F. Smyth
- A FAST AVERAGE CASE ALGORITHM FOR LYNDON DECOMPOSITION Costas S. Iliopoulos
- A FAMILY OF SPARSE GRAPHS OF LARGE SUM NUMBER Nora Hartsfield
- Correction to AN OPTIMAL ALGORITHM TO COMPUTE ALL THE COVERS OF A STRING
- Labelling Wheels for Minimum Sum Number Mirka MILLER Joseph RYAN
- A linear algorithm for computing all the squares of a Fibonacci string
- StringMasters II 1216 May 2008
- Some Restrictions on Periodicity in Strings # Simon J. Puglisi 1 , W. F. Smyth 1,2 , and Andrew Turpin 3
- A Taxonomy of Suffix Array Construction Simon Puglisi, Bill Smyth
- AN OPTIMAL ALGORITHM TO COMPUTE ALL THE COVERS OF A STRING Dennis Moore
- A characterization of the Squares in a Fibonacci string
- A FAST AVERAGE CASE ALGORITHM FOR LYNDON DECOMPOSITION Costas S. Iliopoulos
- WEAK REPETITIONS IN STRINGS L. J. Cummings
- APPROXIMATE PERIODICITY IN STRINGS W. F. Smyth
- Lempel-Ziv Factorization Using Less Time & Space
- More Results on Overlapping Squares Frantisek Franek1
- Our reference: JDA 366 P-authorquery-v7 AUTHOR QUERY FORM
- A New Approach to the Periodicity Lemma on Strings with Holes $,$$
- A Taxonomy of Suffix Array Construction SIMON J. PUGLISI
- COUNTING DISTINCT STRINGS Dennis Moore
- Fast, Practical Algorithms for Computing All the Repeats in a String
- Minimum Unique Substrings and Maximum Lucian Ilie1
- Terminology, Notation & Data Structures Computing Repetitions & Runs
- The "Easy" Case The Next Step: Moving Left
- Three Neighbouring Squares Software for Generating Conjectures
