An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices. - Ilona Arany; Lajos Szoda; W. F. Smyth (IFIP Congress (2), 1971)

An Algorithm for Finding the Diameter of a Graph. - W. F. Smyth; W. M. L. Benzi (IFIP Congress, 1974)

A Storage Scheme for Hierarchic Structures. - W. F. Smyth; E. Radaceanu (Comput. J., 1974)

Another algorithm for reducing bandwidth and profile of a sparse matrix. - W. F. Smyth; Ilona Arany (AFIPS National Computer Conference, 1976)

The Encouragement of Effective Computer Use in Developing Countries. - W. F. Smyth; N. W. N. Jayasiri (IFIP Congress, 1980)

Program Style Analysis: A Natural By-Product of Program Compilation. - K. A. Redish; W. F. Smyth (Commun. ACM, 1986)

Evaluating Measures of Program Quality. - K. A. Redish; W. F. Smyth (Comput. J., 1987)

PRAM Algorithms for Identifying Polygon Similarity. - Costas S. Iliopoulos; William F. Smyth (Optimal Algorithms, 1989)

Closed form expressions for the iterated floor function. - K. A. Redish; W. F. Smyth (Discret. Math., 1990)

Mu-Balancing M-Way Search Trees. - W. F. Smyth (Comput. J., 1991)

Graphs of maximum diameter. - Lou Caccetta; W. F. Smyth (Discret. Math., 1992)

Optimal Algorithms for Computing the canonical form of a circular string. - Costas S. Iliopoulos; William F. Smyth (Theor. Comput. Sci., 1992)

Automated Cryptanalysis of Substitution Ciphers. - William F. Smyth; Reihaneh Safavi-Naini (Cryptologia, 1993)

A Fast and Effective Heuristic for the Feedback Arc Set Problem. - Peter Eades; Xuemin Lin 001; W. F. Smyth (Inf. Process. Lett., 1993)

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)

Parallel RAM Algorithms for Factorizing Words. - Jacqueline W. Daykin; Costas S. Iliopoulos; William F. Smyth (Theor. Comput. Sci., 1994)

A family of sparse graphs of large sum number. - Nora Hartsfield; W. F. Smyth (Discret. Math., 1995)

A fast average case algorithm for lyndon decomposition. - Costas S. Iliopoulos; William F. Smyth (Int. J. Comput. Math., 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)

Covering a Circular String with Substrings of Fixed Length. - Art M. Duval; William F. Smyth (Int. J. Found. Comput. Sci., 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)

Repetitions in two-pattern strings. - Frantisek Franek; Weilin Lu; William F. Smyth (Stringology, 2000)

Repetitions in Sturmian strings. - Frantisek Franek; Ayse Karaman; W. F. Smyth (Theor. Comput. Sci., 2000)

Repetitive perhaps, but certainly not boring. - W. F. Smyth (Theor. Comput. Sci., 2000)

Approximate periods of strings. - Jeong Seop Sim; Costas S. Iliopoulos; Kunsoo Park; William F. Smyth (Theor. Comput. Sci., 2001)

An Approach to Phrase Selection for Offline Data Compression. - Andrew Turpin; William F. Smyth (ACSC, 2002)

Two-Pattern Strings. - Frantisek Franek; Jiandong Jiang; Weilin Lu; William F. Smyth (CPM, 2002)

Computing the Cover Array in Linear Time. - Yin Li; William F. Smyth (Algorithmica, 2002)

Heuristics for Image Retrieval Using Spatial Configurations. - Bill Smyth; Chiou Peng Lam; Xin Chen; Valerie Maxville (DICTA, 2003)

Computing the Minimum k-Cover of a String. - Richard Cole 001; Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth; Lu Yang (Stringology, 2003)

Computing Quasi Suffix Arrays. - Frantisek Franek; Jan Holub 001; William F. Smyth; Xiangdong Xiao (J. Autom. Lang. Comb., 2003)

Computing all Repeats Using Suffix Arrays. - Frantisek Franek; William F. Smyth; Yudong Tang (J. Autom. Lang. Comb., 2003)

Two-pattern strings I - A recognition algorithm. - Frantisek Franek; Weilin Lu; William F. Smyth (J. Discrete Algorithms, 2003)

A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach. - Frantisek Franek; William F. Smyth; Xiangdong Xiao (Nord. J. Comput., 2003)

String Regularities with Don't Cares. - Costas S. Iliopoulos; Manal Mohamed 001; Laurent Mouchard; Katerina Perdikuri; William F. Smyth; Athanasios K. Tsakalidis (Nord. J. Comput., 2003)

A New Periodicity Lemma. - Kangmin Fan; William F. Smyth; R. J. Simpson (CPM, 2005)

The Performance of Linear Time Suffix Sorting Algorithms. - Simon J. Puglisi; William F. Smyth; Andrew Turpin (DCC, 2005)

Sorting suffixes of two-pattern strings. - Frantisek Franek; William F. Smyth (Int. J. Found. Comput. Sci., 2005)

The Complexity of the Minimum k-Cover Problem. - Richard Cole 001; Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth; Lu Yang (J. Autom. Lang. Comb., 2005)

Suffix arrays: what are they good for? - Simon J. Puglisi; William F. Smyth; Andrew Turpin (ADC, 2006)

Finding Patterns with Variable Length Gaps or Don't Cares. - M. Sohel Rahman; Costas S. Iliopoulos; Inbok Lee; Manal Mohamed 001; William F. Smyth (COCOON, 2006)

Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. - Simon J. Puglisi; William F. Smyth; Andrew Turpin (SPIRE, 2006)

Song classifications for dancing. - Manolis Christodoulakis; Costas S. Iliopoulos; Mohammad Sohel Rahman; William F. Smyth (Stringology, 2006)

Reconstructing a Suffix Array. - Frantisek Franek; William F. Smyth (Int. J. Found. Comput. Sci., 2006)

A New Periodicity Lemma. - Kangmin Fan; Simon J. Puglisi; William F. Smyth; Andrew Turpin (SIAM J. Discret. Math., 2006)

Fast and Practical Algorithms for Computing All the Runs in a String. - Gang Chen; Simon J. Puglisi; William F. Smyth (CPM, 2007)

Efficient token based clone detection with flexible tokenization. - Hamid Abdul Basit; Simon J. Puglisi; William F. Smyth; Andrew Turpin; Stan Jarzabek (ESEC/SIGSOFT FSE, 2007)

A taxonomy of suffix array construction algorithms. - Simon J. Puglisi; William F. Smyth; Andrew Turpin (ACM Comput. Surv., 2007)

Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. - Manolis Christodoulakis; Geoffrey Brian Golding; Costas S. Iliopoulos; Yoan José Pinzón Ardila; William F. Smyth (J. Comput. Biol., 2007)

A simple fast hybrid pattern-matching algorithm. - Frantisek Franek; Christopher G. Jennings; William F. Smyth (J. Discrete Algorithms, 2007)

Two-pattern strings II - frequency of occurrence and substring complexity. - Frantisek Franek; Jiandong Jiang; William F. Smyth (J. Discrete Algorithms, 2007)

A Simple Algorithm for Computing the Lempel Ziv Factorization. - Maxime Crochemore; Lucian Ilie; William F. Smyth (DCC, 2008)

New Perspectives on the Prefix Array. - William F. Smyth; Shu Wang (SPIRE, 2008)

Fast Optimal Algorithms for Computing All the Repeats in a String. - Simon J. Puglisi; William F. Smyth; Munina Yusufu (Stringology, 2008)

An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. - William F. Smyth; Shu Wang; Mao Yu (Stringology, 2008)

Identifying Rhythms in Musical Texts. - Manolis Christodoulakis; Costas S. Iliopoulos; Mohammad Sohel Rahman; William F. Smyth (Int. J. Found. Comput. Sci., 2008)

Fast pattern-matching on indeterminate strings. - Jan Holub 001; William F. Smyth; Shu Wang (J. Discrete Algorithms, 2008)

Lempel-Ziv Factorization Using Less Time & Space. - Gang Chen; Simon J. Puglisi; William F. Smyth (Math. Comput. Sci., 2008)

How many runs can a string contain? - Simon J. Puglisi; Jamie Simpson; William F. Smyth (Theor. Comput. Sci., 2008)

Combinatorics of Unique Maximal Factorization Families (UMFFs). - David E. Daykin; Jacqueline W. Daykin; William F. Smyth (Fundam. Informaticae, 2009)

Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. - Costas S. Iliopoulos; William F. Smyth; Munina Yusufu (Fundam. Informaticae, 2009)

An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. - William F. Smyth; Shu Wang (Int. J. Found. Comput. Sci., 2009)

A new approach to the periodicity lemma on strings with holes. - William F. Smyth; Shu Wang (Theor. Comput. Sci., 2009)

Key Parameters in Identifying Cost of Spam 2.0. - Farida Ridzuan; Vidyasagar M. Potdar; Alex Talevski; William F. Smyth (AINA, 2010)

Fast, Practical Algorithms for Computing All the Repeats in a String. - Simon J. Puglisi; William F. Smyth; Munina Yusufu (Math. Comput. Sci., 2010)

String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. - David E. Daykin; Jacqueline W. Daykin; William F. Smyth (CPM, 2011)

Minimum Unique Substrings and Maximum Repeats. - Lucian Ilie; William F. Smyth (Fundam. Informaticae, 2011)

New complexity results for the k-covers problem. - Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth (Inf. Sci., 2011)

Quasi-linear Time Computation of the Abelian Periods of a Word. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston; William F. Smyth (Stringology, 2012)

New and Efficient Approaches to the Quasiperiodic Characterisation of a String. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; William F. Smyth; Wojciech Tyczynski (Stringology, 2012)

A comparison of index-based lempel-Ziv LZ77 factorization algorithms. - Anisa Al-Hafeedh; Maxime Crochemore; Lucian Ilie; Evguenia Kopylova; William F. Smyth; German Tischler; Munina Yusufu (ACM Comput. Surv., 2012)

Report from IWOCA 2012. - Bill Smyth (Bull. EATCS, 2012)

Editorial. - Jacqueline W. Daykin; Bill Smyth; Lynette van Zijl (J. Discrete Algorithms, 2012)

More results on overlapping squares. - Frantisek Franek; Robert C. G. Fuller; Jamie Simpson; William F. Smyth (J. Discrete Algorithms, 2012)

Editorial. - Costas S. Iliopoulos; William F. Smyth (J. Discrete Algorithms, 2012)

The three squares lemma revisited. - Evguenia Kopylova; William F. Smyth (J. Discrete Algorithms, 2012)

Generic Algorithms for Factoring Strings. - David E. Daykin; Jacqueline W. Daykin; Costas S. Iliopoulos; W. F. Smyth (Information Theory, Combinatorics, and Search Theory, 2013)

Prefix Table Construction and Conversion. - Widmer Bland; Gregory Kucherov; W. F. Smyth (IWOCA, 2013)

BOND: Basic OligoNucleotide Design. - Lucian Ilie; Hamid Mohamadi; Geoffrey Brian Golding; William F. Smyth (BMC Bioinform., 2013)

Computing regularities in strings: A survey. - W. F. Smyth (Eur. J. Comb., 2013)

Editorial. - S. Arumugam 001; William F. Smyth (J. Discrete Algorithms, 2013)

A linear partitioning algorithm for Hybrid Lyndons using VV-order. - David E. Daykin; Jacqueline W. Daykin; W. F. Smyth (Theor. Comput. Sci., 2013)

Enhanced string covering. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; W. F. Smyth; Wojciech Tyczynski (Theor. Comput. Sci., 2013)

Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis; William F. Smyth (IWOCA, 2014)

Two Squares Canonical Factorization. - Haoyue Bai 005; Frantisek Franek; William F. Smyth (Stringology, 2014)

Simple Linear Comparison of Strings in V-Order - (Extended Abstract). - Ali Alatabbi; Jacqueline W. Daykin; M. Sohel Rahman; William F. Smyth (WALCOM, 2014)

A bijective variant of the Burrows-Wheeler Transform using V-order. - Jacqueline W. Daykin; William F. Smyth (Theor. Comput. Sci., 2014)

String Comparison in V-Order: New Lexicographic Properties & On-line Applications. - Ali Alatabbi; Jacqueline W. Daykin; Mohammad Sohel Rahman; William F. Smyth (CoRR, 2015)

Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables. - Ali Alatabbi; A. S. M. Sohidull Islam; Mohammad Sohel Rahman; Jamie Simpson; William F. Smyth (CoRR, 2015)

IWOCA 2015 in Verona, Italy. - Zsuzsanna Lipták; Bill Smyth (Bull. EATCS, 2015)

Simple Linear Comparison of Strings in V-order. - Ali Alatabbi; Jacqueline W. Daykin; Mohammad Sohel Rahman; William F. Smyth (Fundam. Informaticae, 2015)

Inferring an indeterminate string from a prefix graph. - Ali Alatabbi; M. Sohel Rahman; William F. Smyth (J. Discrete Algorithms, 2015)

Editorial. - R. Bharati; W. F. Smyth (J. Discrete Algorithms, 2015)

Perspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015). - Bill Smyth (J. Discrete Algorithms, 2015)

Three overlapping squares: The general case characterized & applications. - Widmer Bland; William F. Smyth (Theor. Comput. Sci., 2015)

Indeterminate strings, prefix arrays & undirected graphs. - Manolis Christodoulakis; Patrick J. Ryan; William F. Smyth; Shu Wang (Theor. Comput. Sci., 2015)

Algorithms to Compute the Lyndon Array. - Frantisek Franek; A. S. M. Sohidull Islam; Mohammad Sohel Rahman; William F. Smyth (Stringology, 2016)

V-Order: New combinatorial properties & a simple comparison algorithm. - Ali Alatabbi; Jacqueline W. Daykin; Juha Kärkkäinen; M. Sohel Rahman; W. F. Smyth (Discret. Appl. Math., 2016)

Computing covers using prefix tables. - Ali Alatabbi; M. Sohel Rahman; W. F. Smyth (Discret. Appl. Math., 2016)

The New Periodicity Lemma revisited. - Haoyue Bai 005; Frantisek Franek; William F. Smyth (Discret. Appl. Math., 2016)

A note on easy and efficient computation of full abelian periods of a word. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston; William F. Smyth (Discret. Appl. Math., 2016)

Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables. - Ali Alatabbi; Abu Sayed Md. Sohidull Islam; Mohammad Sohel Rahman; Jamie Simpson; W. F. Smyth (J. Autom. Lang. Comb., 2016)

The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array. - Frantisek Franek; Asma Paracha; William F. Smyth (Stringology, 2017)

Counting Lyndon Factors. - Amy Glen; Jamie Simpson; W. F. Smyth (Electron. J. Comb., 2017)

On the Parikh-de-Bruijn grid. - Peter Burcsi; Zsuzsanna Lipták; W. F. Smyth (CoRR, 2017)

A prefix array for parameterized strings. - Richard Beal; Donald A. Adjeroh; W. F. Smyth (J. Discrete Algorithms, 2017)

A Faster V-order String Comparison Algorithm. - Ali Alatabbi; Jacqueline W. Daykin; Mhaskar Neerja; Mohammad Sohel Rahman; William F. Smyth (Stringology, 2018)

On Baier's Sort of Maximal Lyndon Substrings. - Frantisek Franek; Michael Liut; William F. Smyth (Stringology, 2018)

Preface. - Zsuzsanna Lipták; W. F. Smyth (Discret. Appl. Math., 2018)

Frequency Covers for Strings. - Neerja Mhaskar; W. F. Smyth (Fundam. Informaticae, 2018)

Editorial. - Ljiljana Brankovic; Joe Ryan 001; William F. Smyth (J. Discrete Algorithms, 2018)

Lyndon array construction during Burrows-Wheeler inversion. - Felipe A. Louza; William F. Smyth; Giovanni Manzini; Guilherme P. Telles (J. Discrete Algorithms, 2018)

String covering with optimal covers. - Neerja Mhaskar; William F. Smyth (J. Discrete Algorithms, 2018)

Reconstructing a string from its Lyndon arrays. - Jacqueline W. Daykin; Frantisek Franek; Jan Holub 001; A. S. M. Sohidull Islam; W. F. Smyth (Theor. Comput. Sci., 2018)

Constructing an indeterminate string from its associated graph. - Joel Helling; Patrick J. Ryan; W. F. Smyth; Michael Soltys (Theor. Comput. Sci., 2018)

Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. - Ali Alatabbi; Jacqueline W. Daykin; Neerja Mhaskar; M. Sohel Rahman; W. F. Smyth (WALCOM, 2019)

Palindromes in starlike trees. - Amy Glen; Jamie Simpson; W. F. Smyth (Australas. J Comb., 2019)

Off-line and on-line algorithms for closed string factorization. - Mai Alzamel; Costas S. Iliopoulos; W. F. Smyth; Wing-Kin Sung (Theor. Comput. Sci., 2019)

More properties of the Fibonacci word on an infinite alphabet. - Amy Glen; Jamie Simpson; W. F. Smyth (Theor. Comput. Sci., 2019)

Simple KMP Pattern-Matching on Indeterminate Strings. - Mhaskar Neerja; William F. Smyth (Stringology, 2020)

IWOCA 2020 in Bordeaux (Oops! On-Line!). - Florent Foucaud; Leszek Gasieniec; Ralf Klasing; Tomasz Radzik; Bill Smyth (Bull. EATCS, 2020)

Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order. - Jacqueline W. Daykin; Neerja Mhaskar; W. F. Smyth (Theor. Comput. Sci., 2021)

A new approach to regular & indeterminate strings. - Felipe A. Louza; Neerja Mhaskar; W. F. Smyth (Theor. Comput. Sci., 2021)

Practical KMP/BM Style Pattern-Matching on Indeterminate Strings. - Hossein Dehghani; Neerja Mhaskar; W. F. Smyth (CoRR, 2022)

String Covering: A Survey. - Neerja Mhaskar; W. F. Smyth (Fundam. Informaticae, 2022)

V-Words, Lyndon Words and Substring circ-UMFFs. - Jacqueline W. Daykin; Neerja Mhaskar; W. F. Smyth (COCOA (1), 2023)

Local Maximal Equality-Free Periodicities. - Mai Alzamel; Jacqueline W. Daykin; Christopher Hampson; Costas S. Iliopoulos; Zara Lim; W. F. Smyth (AIAI (Workshops), 2023)

Improved Practical Algorithms to Compute Maximal Covers. - Holly Koponen; Mhaskar Neerja; William F. Smyth (PSC, 2023)

Computing Maximal Covers for Protein Sequences. - Geoffrey Brian Golding; Holly Koponen; Neerja Mhaskar; W. F. Smyth (J. Comput. Biol., 2023)

V-Words, Lyndon Words and Galois Words. - Jacqueline W. Daykin; Neerja Mhaskar; W. F. Smyth (CoRR, 2024)

Practical KMP/BM style pattern-matching on indeterminate strings. - Hossein Dehghani; Thierry Lecroq; Neerja Mhaskar; W. F. Smyth (Discret. Appl. Math., 2025)

On the Complexity of Finding Approximate LCS of Multiple Strings. - Hamed Hasibi; Neerja Mhaskar; W. F. Smyth (CoRR, 2025)