William F. Smyth

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 14

Top Topics

Johnson Lindenstrauss

String Matching

Top Venues

J. Discrete Algorithms

Theor. Comput. Sci.

Publications

Holly Koponen, Mhaskar Neerja, William F. Smyth
Improved Practical Algorithms to Compute Maximal Covers. PSC (2023)
Neerja Mhaskar, William F. Smyth
String Covering: A Survey. CoRR (2022)
Mhaskar Neerja, William F. Smyth
Simple KMP Pattern-Matching on Indeterminate Strings. Stringology (2020)
Felipe A. Louza, William F. Smyth, Giovanni Manzini, Guilherme P. Telles
Lyndon array construction during Burrows-Wheeler inversion. J. Discrete Algorithms 50 (2018)
Ali Alatabbi, Jacqueline W. Daykin, Mhaskar Neerja, Mohammad Sohel Rahman, William F. Smyth
A Faster V-order String Comparison Algorithm. Stringology (2018)
Ljiljana Brankovic, Joe Ryan, William F. Smyth
Editorial. J. Discrete Algorithms (2018)
Frantisek Franek, Michael Liut, William F. Smyth
On Baier's Sort of Maximal Lyndon Substrings. Stringology (2018)
Neerja Mhaskar, William F. Smyth
String covering with optimal covers. J. Discrete Algorithms 51 (2018)
Frantisek Franek, Asma Paracha, William F. Smyth
The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array. Stringology (2017)
Amy Glen, Jamie Simpson, William F. Smyth
Counting Lyndon factors. CoRR (2017)
Frantisek Franek, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, William F. Smyth
Algorithms to Compute the Lyndon Array. Stringology (2016)
Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman, William F. Smyth
Algorithms to Compute the Lyndon Array. CoRR (2016)
Haoyue Bai, Frantisek Franek, William F. Smyth
The New Periodicity Lemma revisited. Discret. Appl. Math. 212 (2016)
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth
A note on easy and efficient computation of full abelian periods of a word. Discret. Appl. Math. 212 (2016)
Manolis Christodoulakis, P. J. Ryan, William F. Smyth, Shu Wang
Indeterminate strings, prefix arrays & undirected graphs. Theor. Comput. Sci. 600 (2015)
Ali Alatabbi, Mohammad Sohel Rahman, William F. Smyth
Inferring an Indeterminate String from a Prefix Graph. CoRR (2015)
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth
A Note on Easy and Efficient Computation of Full Abelian Periods of a Word. CoRR (2015)
Ali Alatabbi, M. Sohel Rahman, William F. Smyth
Inferring an indeterminate string from a prefix graph. J. Discrete Algorithms 32 (2015)
Ali Alatabbi, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, William F. Smyth
Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables. CoRR (2015)
Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth
String Comparison in V-Order: New Lexicographic Properties & On-line Applications. CoRR (2015)
Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth
Simple Linear Comparison of Strings in V-order. Fundam. Informaticae 139 (2) (2015)
Widmer Bland, William F. Smyth
Three overlapping squares: The general case characterized & applications. Theor. Comput. Sci. 596 (2015)
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. IWOCA (2014)
Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth
Simple Linear Comparison of Strings in V-Order - (Extended Abstract). WALCOM (2014)
Jacqueline W. Daykin, William F. Smyth
A bijective variant of the Burrows-Wheeler Transform using V-order. Theor. Comput. Sci. 531 (2014)
Haoyue Bai, Frantisek Franek, William F. Smyth
Two Squares Canonical Factorization. Stringology (2014)
Ali Alatabbi, Mohammad Sohel Rahman, William F. Smyth
Computing Covers Using Prefix Tables. CoRR (2014)
Lucian Ilie, Hamid Mohamadi, Geoffrey Brian Golding, William F. Smyth
BOND: Basic OligoNucleotide Design. BMC Bioinform. 14 (2013)
S. Arumugam, William F. Smyth
Editorial. J. Discrete Algorithms 23 (2013)
Costas S. Iliopoulos, William F. Smyth
Editorial. J. Discrete Algorithms 16 (2012)
Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William F. Smyth, German Tischler, Munina Yusufu
A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Comput. Surv. 45 (1) (2012)
Evguenia Kopylova, William F. Smyth
The three squares lemma revisited. J. Discrete Algorithms 11 (2012)
Costas S. Iliopoulos, William F. Smyth
Editorial. J. Discrete Algorithms 14 (2012)
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth
Quasi-linear Time Computation of the Abelian Periods of a Word. Stringology (2012)
Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth
More results on overlapping squares. J. Discrete Algorithms 17 (2012)
Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski
New and Efficient Approaches to the Quasiperiodic Characterisation of a String. Stringology (2012)
David E. Daykin, Jacqueline W. Daykin, William F. Smyth
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. CPM (2011)
Costas S. Iliopoulos, Manal Mohamed, William F. Smyth
New complexity results for the k-covers problem. Inf. Sci. 181 (12) (2011)
Lucian Ilie, William F. Smyth
Minimum Unique Substrings and Maximum Repeats. Fundam. Informaticae 110 (1-4) (2011)
Simon J. Puglisi, William F. Smyth, Munina Yusufu
Fast, Practical Algorithms for Computing All the Repeats in a String. Math. Comput. Sci. 3 (4) (2010)
Farida Ridzuan, Vidyasagar M. Potdar, Alex Talevski, William F. Smyth
Key Parameters in Identifying Cost of Spam 2.0. AINA (2010)
Costas S. Iliopoulos, William F. Smyth, Munina Yusufu
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. Fundam. Informaticae 97 (3) (2009)
William F. Smyth, Shu Wang
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. Int. J. Found. Comput. Sci. 20 (6) (2009)
David E. Daykin, Jacqueline W. Daykin, William F. Smyth
Combinatorics of Unique Maximal Factorization Families (UMFFs). Fundam. Informaticae 97 (3) (2009)
William F. Smyth, Shu Wang
A new approach to the periodicity lemma on strings with holes. Theor. Comput. Sci. 410 (43) (2009)
William F. Smyth, Shu Wang
New Perspectives on the Prefix Array. SPIRE (2008)
Simon J. Puglisi, William F. Smyth, Munina Yusufu
Fast Optimal Algorithms for Computing All the Repeats in a String. Stringology (2008)
Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth
Identifying Rhythms in Musical Texts. Int. J. Found. Comput. Sci. 19 (1) (2008)
William F. Smyth, Shu Wang, Mao Yu
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. Stringology (2008)
Jan Holub, William F. Smyth, Shu Wang
Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6 (1) (2008)
Gang Chen, Simon J. Puglisi, William F. Smyth
Lempel-Ziv Factorization Using Less Time & Space. Math. Comput. Sci. 1 (4) (2008)
Maxime Crochemore, Lucian Ilie, William F. Smyth
A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC (2008)
Simon J. Puglisi, Jamie Simpson, William F. Smyth
How many runs can a string contain? Theor. Comput. Sci. 401 (1-3) (2008)
Gang Chen, Simon J. Puglisi, William F. Smyth
Fast and Practical Algorithms for Computing All the Runs in a String. CPM (2007)
Manolis Christodoulakis, Geoffrey Brian Golding, Costas S. Iliopoulos, Yoan José Pinzón Ardila, William F. Smyth
Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. J. Comput. Biol. 14 (7) (2007)
Simon J. Puglisi, William F. Smyth, Andrew Turpin
A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39 (2) (2007)
Hamid Abdul Basit, Simon J. Puglisi, William F. Smyth, Andrew Turpin, Stan Jarzabek
Efficient token based clone detection with flexible tokenization. ESEC/SIGSOFT FSE (2007)
Frantisek Franek, Christopher G. Jennings, William F. Smyth
A simple fast hybrid pattern-matching algorithm. J. Discrete Algorithms 5 (4) (2007)
Frantisek Franek, Jiandong Jiang, William F. Smyth
Two-pattern strings II - frequency of occurrence and substring complexity. J. Discrete Algorithms 5 (4) (2007)
Simon J. Puglisi, William F. Smyth, Andrew Turpin
Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. SPIRE (2006)
Kangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin
A New Periodicity Lemma. SIAM J. Discret. Math. 20 (3) (2006)
Frantisek Franek, William F. Smyth
Reconstructing a Suffix Array. Int. J. Found. Comput. Sci. 17 (6) (2006)
Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth
Song classifications for dancing. Stringology (2006)
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth
Finding Patterns with Variable Length Gaps or Don't Cares. COCOON (2006)
Simon J. Puglisi, William F. Smyth, Andrew Turpin
Suffix arrays: what are they good for? ADC (2006)
Frantisek Franek, William F. Smyth
Reconstructing a suffix array. Stringology (2005)
Simon J. Puglisi, William F. Smyth, Andrew Turpin
The Performance of Linear Time Suffix Sorting Algorithms. DCC (2005)
Kangmin Fan, William F. Smyth, R. J. Simpson
A New Periodicity Lemma. CPM (2005)
Simon J. Puglisi, William F. Smyth, Andrew Turpin
A taxonomy of suffix array construction algorithms. Stringology (2005)
Frantisek Franek, William F. Smyth
Sorting suffixes of two-pattern strings. Int. J. Found. Comput. Sci. 16 (6) (2005)
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang
The Complexity of the Minimum k-Cover Problem. J. Autom. Lang. Comb. 10 (5/6) (2005)
Frantisek Franek, Christopher G. Jennings, William F. Smyth
A Simple Fast Hybrid Pattern-Matching Algorithm. CPM (2005)
Frantisek Franek, William F. Smyth
Sorting suffixes of two-pattern strings. Stringology (2004)
Frantisek Franek, William F. Smyth, Xiangdong Xiao
A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach. Nord. J. Comput. 10 (1) (2003)
Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao
Computing Quasi Suffix Arrays. J. Autom. Lang. Comb. 8 (4) (2003)
Frantisek Franek, William F. Smyth, Yudong Tang
Computing all Repeats Using Suffix Arrays. J. Autom. Lang. Comb. 8 (4) (2003)
Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis
String Regularities with Don't Cares. Nord. J. Comput. 10 (1) (2003)
Frantisek Franek, Weilin Lu, William F. Smyth
Two-pattern strings I - A recognition algorithm. J. Discrete Algorithms 1 (5-6) (2003)
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang
Computing the Minimum k-Cover of a String. Stringology (2003)
Andrew Turpin, William F. Smyth
An Approach to Phrase Selection for Offline Data Compression. ACSC (2002)
Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth
Two-Pattern Strings. CPM (2002)
Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis
String Regularities with Don't Cares. Stringology (2002)
Yin Li, William F. Smyth
Computing the Cover Array in Linear Time. Algorithmica 32 (1) (2002)
Frantisek Franek, William F. Smyth, Xiangdong Xiao
A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach. Stringology (2002)
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
Approximate periods of strings. Theor. Comput. Sci. 262 (1) (2001)
Frantisek Franek, Weilin Lu, William F. Smyth
Repetitions in two-pattern strings. Stringology (2000)
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
Approximate Periods of Strings. CPM (1999)
Dennis W. G. Moore, William F. Smyth, D. Miller
Counting Distinct Strings. Algorithmica 23 (1) (1999)
Costas S. Iliopoulos, Dennis W. G. Moore, William F. Smyth
A Characterization of the Squares in a Fibonacci String. Theor. Comput. Sci. 172 (1-2) (1997)
Art M. Duval, William F. Smyth
Covering a Circular String with Substrings of Fixed Length. Int. J. Found. Comput. Sci. 7 (1) (1996)
Costas S. Iliopoulos, William F. Smyth
A fast average case algorithm for lyndon decomposition. Int. J. Comput. Math. 57 (1-2) (1995)
Dennis W. G. Moore, William F. Smyth
A Correction to "An Optimal Algorithm to Compute all the Covers of a String". Inf. Process. Lett. 54 (2) (1995)
Dennis W. G. Moore, William F. Smyth
Computing the Covers of a String in Linear Time. SODA (1994)
Dennis W. G. Moore, William F. Smyth
An Optimal Algorithm to Compute all the Covers of a String. Inf. Process. Lett. 50 (5) (1994)
Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth
Parallel RAM Algorithms for Factorizing Words. Theor. Comput. Sci. 127 (1) (1994)
William F. Smyth, Reihaneh Safavi-Naini
Automated Cryptanalysis of Substitution Ciphers. Cryptologia 17 (4) (1993)
Costas S. Iliopoulos, William F. Smyth
Optimal Algorithms for Computing the canonical form of a circular string. Theor. Comput. Sci. 92 (1) (1992)
Costas S. Iliopoulos, William F. Smyth
PRAM Algorithms for Identifying Polygon Similarity. Optimal Algorithms (1989)