William F. Smyth

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