W. F. Smyth

50 papers B 1C 2Journal 40Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the Complexity of Finding Approximate LCS of Multiple Strings.
CoRR
Hamed Hasibi, Neerja Mhaskar, W. F. Smyth
2025 J jnl
Practical KMP/BM style pattern-matching on indeterminate strings.
Discret. Appl. Math.
Hossein Dehghani, Thierry Lecroq, Neerja Mhaskar, W. F. Smyth
2024 J jnl
V-Words, Lyndon Words and Galois Words.
CoRR
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth
2023 J jnl
Computing Maximal Covers for Protein Sequences.
J. Comput. Biol.
Geoffrey Brian Golding, Holly Koponen, Neerja Mhaskar, W. F. Smyth
2023 — conf
Local Maximal Equality-Free Periodicities.
AIAI (Workshops)
Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth
2023 — conf
V-Words, Lyndon Words and Substring circ-UMFFs.
COCOA (1)
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth
2022 J jnl
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings.
CoRR
Hossein Dehghani, Neerja Mhaskar, W. F. Smyth
2022 J jnl
String Covering: A Survey.
Fundam. Informaticae
Neerja Mhaskar, W. F. Smyth
2021 J jnl
A new approach to regular & indeterminate strings.
Theor. Comput. Sci.
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
2021 J jnl
Computation of the suffix array, Burrows-Wheeler transform and FM-index in
Theor. Comput. Sci.
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth
2020 J jnl
A New Approach to Regular & Indeterminate Strings.
CoRR
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
2019 B conf
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index.
WALCOM
Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth
2019 J jnl
More properties of the Fibonacci word on an infinite alphabet.
Theor. Comput. Sci.
Amy Glen, Jamie Simpson, W. F. Smyth
2019 J jnl
Off-line and on-line algorithms for closed string factorization.
Theor. Comput. Sci.
Mai Alzamel, Costas S. Iliopoulos, W. F. Smyth, Wing-Kin Sung
2019 J jnl
Palindromes in starlike trees.
Australas. J Comb.
Amy Glen, Jamie Simpson, W. F. Smyth
2018 J jnl
Constructing an indeterminate string from its associated graph.
Theor. Comput. Sci.
Joel Helling, Patrick J. Ryan, W. F. Smyth, Michael Soltys
2018 J jnl
Frequency Covers for Strings.
Fundam. Informaticae
Neerja Mhaskar, W. F. Smyth
2018 J jnl
Palindromes in starlike trees.
CoRR
Amy Glen, Jamie Simpson, W. F. Smyth
2018 J jnl
Preface.
Discret. Appl. Math.
Zsuzsanna Lipták, W. F. Smyth
2018 J jnl
Reconstructing a string from its Lyndon arrays.
Theor. Comput. Sci.
Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth
2017 J jnl
A prefix array for parameterized strings.
J. Discrete Algorithms
Richard Beal, Donald A. Adjeroh, W. F. Smyth
2017 J jnl
Counting Lyndon Factors.
Electron. J. Comb.
Amy Glen, Jamie Simpson, W. F. Smyth
2017 J jnl
Lyndon Array Construction during Burrows-Wheeler Inversion.
CoRR
Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles
2017 J jnl
More properties of the Fibonacci word on an infinite alphabet.
CoRR
Amy Glen, Jamie Simpson, W. F. Smyth
2017 J jnl
On the Parikh-de-Bruijn grid.
CoRR
Peter Burcsi, Zsuzsanna Lipták, W. F. Smyth
2016 J jnl
Computing covers using prefix tables.
Discret. Appl. Math.
Ali Alatabbi, M. Sohel Rahman, W. F. Smyth
2016 J jnl
Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables.
J. Autom. Lang. Comb.
Ali Alatabbi, Abu Sayed Md. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, W. F. Smyth
2016 J jnl
V-Order: New combinatorial properties & a simple comparison algorithm.
Discret. Appl. Math.
Ali Alatabbi, Jacqueline W. Daykin, Juha Kärkkäinen, M. Sohel Rahman, W. F. Smyth
2015 J jnl
Editorial.
J. Discrete Algorithms
R. Bharati, W. F. Smyth
2014 J jnl
Indeterminate Strings, Prefix Arrays & Undirected Graphs.
CoRR
Manolis Christodoulakis, Patrick J. Ryan, W. F. Smyth, Shu Wang
2013 J jnl
A linear partitioning algorithm for Hybrid Lyndons using
Theor. Comput. Sci.
David E. Daykin, Jacqueline W. Daykin, W. F. Smyth
2013 J jnl
Computing regularities in strings: A survey.
Eur. J. Comb.
W. F. Smyth
2013 J jnl
Enhanced string covering.
Theor. Comput. Sci.
Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski
2013 — conf
Generic Algorithms for Factoring Strings.
Information Theory, Combinatorics, and Search Theory
David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth
2013 C conf
Prefix Table Construction and Conversion.
IWOCA
Widmer Bland, Gregory Kucherov, W. F. Smyth
2012 C ed.
Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers
IWOCA
S. Arumugam, W. F. Smyth
2000 J jnl
Repetitions in Sturmian strings.
Theor. Comput. Sci.
Frantisek Franek, Ayse Karaman, W. F. Smyth
2000 J jnl
Repetitive perhaps, but certainly not boring.
Theor. Comput. Sci.
W. F. Smyth
1995 J jnl
A family of sparse graphs of large sum number.
Discret. Math.
Nora Hartsfield, W. F. Smyth
1993 J jnl
A Fast and Effective Heuristic for the Feedback Arc Set Problem.
Inf. Process. Lett.
Peter Eades, Xuemin Lin, W. F. Smyth
1992 J jnl
Graphs of maximum diameter.
Discret. Math.
Lou Caccetta, W. F. Smyth
1991 J jnl
Mu-Balancing M-Way Search Trees.
Comput. J.
W. F. Smyth
1990 J jnl
Closed form expressions for the iterated floor function.
Discret. Math.
K. A. Redish, W. F. Smyth
1987 J jnl
Evaluating Measures of Program Quality.
Comput. J.
K. A. Redish, W. F. Smyth
1986 J jnl
Program Style Analysis: A Natural By-Product of Program Compilation.
Commun. ACM
K. A. Redish, W. F. Smyth
1980 — conf
The Encouragement of Effective Computer Use in Developing Countries.
IFIP Congress
W. F. Smyth, N. W. N. Jayasiri
1976 — conf
Another algorithm for reducing bandwidth and profile of a sparse matrix.
AFIPS National Computer Conference
W. F. Smyth, Ilona Arany
1974 J jnl
A Storage Scheme for Hierarchic Structures.
Comput. J.
W. F. Smyth, E. Radaceanu
1974 — conf
An Algorithm for Finding the Diameter of a Graph.
IFIP Congress
W. F. Smyth, W. M. L. Benzi
1971 — conf
An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices.
IFIP Congress (2)
Ilona Arany, Lajos Szoda, W. F. Smyth