default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam F. Smyth
W. F. Smyth – Bill Smyth
Person information
- affiliation: McMaster University, Hamilton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i16]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
V-Words, Lyndon Words and Galois Words. CoRR abs/2409.02757 (2024)- 2023
- [j87]Geoffrey Brian Golding, Holly Koponen, Neerja Mhaskar
, W. F. Smyth:
Computing Maximal Covers for Protein Sequences. J. Comput. Biol. 30(2): 149-160 (2023) - [c48]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
V-Words, Lyndon Words and Substring circ-UMFFs. COCOA (1) 2023: 471-484 - [c47]Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth:
Local Maximal Equality-Free Periodicities. AIAI Workshops 2023: 359-368 - [c46]Holly Koponen, Mhaskar Neerja, William F. Smyth:
Improved Practical Algorithms to Compute Maximal Covers. PSC 2023: 30-41 - 2022
- [j86]Neerja Mhaskar, W. F. Smyth:
String Covering: A Survey. Fundam. Informaticae 190(1): 17-45 (2022) - [i15]Hossein Dehghani, Neerja Mhaskar, W. F. Smyth:
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings. CoRR abs/2204.08331 (2022) - [i14]Neerja Mhaskar, William F. Smyth:
String Covering: A Survey. CoRR abs/2211.11856 (2022) - 2021
- [j85]Felipe A. Louza, Neerja Mhaskar, W. F. Smyth:
A new approach to regular & indeterminate strings. Theor. Comput. Sci. 854: 105-115 (2021) - [j84]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order. Theor. Comput. Sci. 880: 82-96 (2021) - 2020
- [j83]Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth:
IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS 132 (2020) - [c45]Mhaskar Neerja, William F. Smyth:
Simple KMP Pattern-Matching on Indeterminate Strings. Stringology 2020: 125-133 - [i13]Felipe A. Louza, Neerja Mhaskar, W. F. Smyth:
A New Approach to Regular & Indeterminate Strings. CoRR abs/2012.07892 (2020)
2010 – 2019
- 2019
- [j82]Amy Glen, Jamie Simpson, W. F. Smyth:
Palindromes in starlike trees. Australas. J Comb. 73: 242-246 (2019) - [j81]Mai Alzamel, Costas S. Iliopoulos, W. F. Smyth, Wing-Kin Sung:
Off-line and on-line algorithms for closed string factorization. Theor. Comput. Sci. 792: 12-19 (2019) - [j80]Amy Glen, Jamie Simpson, W. F. Smyth:
More properties of the Fibonacci word on an infinite alphabet. Theor. Comput. Sci. 795: 301-311 (2019) - [c44]Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth:
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. WALCOM 2019: 329-338 - 2018
- [j79]Zsuzsanna Lipták, W. F. Smyth:
Preface. Discret. Appl. Math. 246: 1 (2018) - [j78]Neerja Mhaskar, W. F. Smyth:
Frequency Covers for Strings. Fundam. Informaticae 163(3): 275-289 (2018) - [j77]Felipe A. Louza, William F. Smyth, Giovanni Manzini, Guilherme P. Telles:
Lyndon array construction during Burrows-Wheeler inversion. J. Discrete Algorithms 50: 2-9 (2018) - [j76]Neerja Mhaskar, William F. Smyth:
String covering with optimal covers. J. Discrete Algorithms 51: 26-38 (2018) - [j75]Ljiljana Brankovic, Joe Ryan, William F. Smyth:
Editorial. J. Discrete Algorithms 52-53: 1 (2018) - [j74]Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth:
Reconstructing a string from its Lyndon arrays. Theor. Comput. Sci. 710: 44-51 (2018) - [j73]Joel Helling, Patrick J. Ryan, W. F. Smyth, Michael Soltys:
Constructing an indeterminate string from its associated graph. Theor. Comput. Sci. 710: 88-96 (2018) - [c43]Ali Alatabbi, Jacqueline W. Daykin, Mhaskar Neerja, Mohammad Sohel Rahman, William F. Smyth:
A Faster V-order String Comparison Algorithm. Stringology 2018: 38-48 - [c42]Frantisek Franek, Michael Liut, William F. Smyth:
On Baier's Sort of Maximal Lyndon Substrings. Stringology 2018: 63-78 - [e5]Ljiljana Brankovic, Joe Ryan, William F. Smyth:
Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10765, Springer 2018, ISBN 978-3-319-78824-1 [contents] - [i12]Amy Glen, Jamie Simpson, W. F. Smyth:
Palindromes in starlike trees. CoRR abs/1805.10646 (2018) - 2017
- [j72]Amy Glen, Jamie Simpson, W. F. Smyth:
Counting Lyndon Factors. Electron. J. Comb. 24(3): 3 (2017) - [j71]Richard Beal, Donald A. Adjeroh, W. F. Smyth:
A prefix array for parameterized strings. J. Discrete Algorithms 42: 23-34 (2017) - [c41]Frantisek Franek, Asma Paracha, William F. Smyth:
The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array. Stringology 2017: 77-84 - [i11]Amy Glen, Jamie Simpson, William F. Smyth:
Counting Lyndon factors. CoRR abs/1701.00928 (2017) - [i10]Amy Glen, Jamie Simpson, W. F. Smyth:
More properties of the Fibonacci word on an infinite alphabet. CoRR abs/1710.02782 (2017) - [i9]Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles:
Lyndon Array Construction during Burrows-Wheeler Inversion. CoRR abs/1710.10105 (2017) - [i8]Peter Burcsi, Zsuzsanna Lipták, W. F. Smyth:
On the Parikh-de-Bruijn grid. CoRR abs/1711.06264 (2017) - 2016
- [j70]Ali Alatabbi, M. Sohel Rahman, W. F. Smyth:
Computing covers using prefix tables. Discret. Appl. Math. 212: 2-9 (2016) - [j69]Haoyue Bai, Frantisek Franek, William F. Smyth:
The New Periodicity Lemma revisited. Discret. Appl. Math. 212: 30-36 (2016) - [j68]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: 88-95 (2016) - [j67]Ali Alatabbi, Jacqueline W. Daykin, Juha Kärkkäinen, M. Sohel Rahman, W. F. Smyth:
V-Order: New combinatorial properties & a simple comparison algorithm. Discret. Appl. Math. 215: 41-46 (2016) - [j66]Ali Alatabbi, Abu Sayed Md. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, W. F. Smyth:
Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables. J. Autom. Lang. Comb. 21(3): 131-147 (2016) - [c40]Frantisek Franek, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, William F. Smyth:
Algorithms to Compute the Lyndon Array. Stringology 2016: 172-184 - [e4]Zsuzsanna Lipták, William F. Smyth:
Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9538, Springer 2016, ISBN 978-3-319-29515-2 [contents] - [i7]Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman, William F. Smyth:
Algorithms to Compute the Lyndon Array. CoRR abs/1605.08935 (2016) - 2015
- [j65]Zsuzsanna Lipták, Bill Smyth:
IWOCA 2015 in Verona, Italy. Bull. EATCS 115 (2015) - [j64]Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth:
Simple Linear Comparison of Strings in V-order. Fundam. Informaticae 139(2): 115-126 (2015) - [j63]Bill Smyth:
Perspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015). J. Discrete Algorithms 32: 3-5 (2015) - [j62]Ali Alatabbi, M. Sohel Rahman, William F. Smyth:
Inferring an indeterminate string from a prefix graph. J. Discrete Algorithms 32: 6-13 (2015) - [j61]R. Bharati, W. F. Smyth:
Editorial. J. Discrete Algorithms 33: 1 (2015) - [j60]Widmer Bland, William F. Smyth:
Three overlapping squares: The general case characterized & applications. Theor. Comput. Sci. 596: 23-40 (2015) - [j59]Manolis Christodoulakis, Patrick J. Ryan, William F. Smyth, Shu Wang:
Indeterminate strings, prefix arrays & undirected graphs. Theor. Comput. Sci. 600: 34-48 (2015) - [i6]Ali Alatabbi, Mohammad Sohel Rahman, William F. Smyth:
Inferring an Indeterminate String from a Prefix Graph. CoRR abs/1502.07870 (2015) - [i5]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 abs/1506.06793 (2015) - [i4]Ali Alatabbi, Jacqueline W. Daykin, Mohammad Sohel Rahman, William F. Smyth:
String Comparison in V-Order: New Lexicographic Properties & On-line Applications. CoRR abs/1507.07038 (2015) - [i3]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 abs/1510.00634 (2015) - 2014
- [j58]Jacqueline W. Daykin, William F. Smyth:
A bijective variant of the Burrows-Wheeler Transform using V-order. Theor. Comput. Sci. 531: 77-89 (2014) - [c39]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: 49-61 - [c38]Haoyue Bai, Frantisek Franek, William F. Smyth:
Two Squares Canonical Factorization. Stringology 2014: 52-58 - [c37]Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth:
Simple Linear Comparison of Strings in V-Order - (Extended Abstract). WALCOM 2014: 80-89 - [i2]Manolis Christodoulakis, Patrick J. Ryan, W. F. Smyth, Shu Wang:
Indeterminate Strings, Prefix Arrays & Undirected Graphs. CoRR abs/1406.3289 (2014) - [i1]Ali Alatabbi, Mohammad Sohel Rahman, William F. Smyth:
Computing Covers Using Prefix Tables. CoRR abs/1412.3016 (2014) - 2013
- [j57]Lucian Ilie, Hamid Mohamadi, Geoffrey Brian Golding, William F. Smyth:
BOND: Basic OligoNucleotide Design. BMC Bioinform. 14: 69 (2013) - [j56]W. F. Smyth:
Computing regularities in strings: A survey. Eur. J. Comb. 34(1): 3-14 (2013) - [j55]S. Arumugam, William F. Smyth:
Editorial. J. Discrete Algorithms 23: 1 (2013) - [j54]David E. Daykin, Jacqueline W. Daykin, W. F. Smyth:
A linear partitioning algorithm for Hybrid Lyndons using VV-order. Theor. Comput. Sci. 483: 149-161 (2013) - [j53]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski:
Enhanced string covering. Theor. Comput. Sci. 506: 102-114 (2013) - [c36]David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth:
Generic Algorithms for Factoring Strings. Information Theory, Combinatorics, and Search Theory 2013: 402-418 - [c35]Widmer Bland, Gregory Kucherov, W. F. Smyth:
Prefix Table Construction and Conversion. IWOCA 2013: 41-53 - 2012
- [j52]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): 5:1-5:17 (2012) - [j51]Bill Smyth:
Report from IWOCA 2012. Bull. EATCS 108: 163-167 (2012) - [j50]Jacqueline W. Daykin, Bill Smyth, Lynette van Zijl:
Editorial. J. Discrete Algorithms 10: 1 (2012) - [j49]Evguenia Kopylova, William F. Smyth:
The three squares lemma revisited. J. Discrete Algorithms 11: 3-14 (2012) - [j48]Costas S. Iliopoulos, William F. Smyth:
Editorial. J. Discrete Algorithms 14: 1 (2012) - [j47]Costas S. Iliopoulos, William F. Smyth:
Editorial. J. Discrete Algorithms 16: 1 (2012) - [j46]Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth:
More results on overlapping squares. J. Discrete Algorithms 17: 2-8 (2012) - [c34]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: 75-88 - [c33]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: 103-110 - [e3]S. Arumugam, W. F. Smyth:
Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7643, Springer 2012, ISBN 978-3-642-35925-5 [contents] - 2011
- [j45]Lucian Ilie, William F. Smyth:
Minimum Unique Substrings and Maximum Repeats. Fundam. Informaticae 110(1-4): 183-195 (2011) - [j44]Costas S. Iliopoulos, Manal Mohamed, William F. Smyth:
New complexity results for the k-covers problem. Inf. Sci. 181(12): 2571-2575 (2011) - [c32]David E. Daykin, Jacqueline W. Daykin, William F. Smyth:
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. CPM 2011: 65-76 - [e2]Costas S. Iliopoulos, William F. Smyth:
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6460, Springer 2011, ISBN 978-3-642-19221-0 [contents] - [e1]Costas S. Iliopoulos, William F. Smyth:
Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7056, Springer 2011, ISBN 978-3-642-25010-1 [contents] - 2010
- [j43]Simon J. Puglisi, William F. Smyth, Munina Yusufu:
Fast, Practical Algorithms for Computing All the Repeats in a String. Math. Comput. Sci. 3(4): 373-389 (2010) - [c31]Farida Ridzuan, Vidyasagar M. Potdar, Alex Talevski, William F. Smyth:
Key Parameters in Identifying Cost of Spam 2.0. AINA 2010: 789-796
2000 – 2009
- 2009
- [j42]David E. Daykin, Jacqueline W. Daykin, William F. Smyth:
Combinatorics of Unique Maximal Factorization Families (UMFFs). Fundam. Informaticae 97(3): 295-309 (2009) - [j41]Costas S. Iliopoulos, William F. Smyth, Munina Yusufu:
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. Fundam. Informaticae 97(3): 311-320 (2009) - [j40]William F. Smyth, Shu Wang:
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. Int. J. Found. Comput. Sci. 20(6): 985-1004 (2009) - [j39]William F. Smyth, Shu Wang:
A new approach to the periodicity lemma on strings with holes. Theor. Comput. Sci. 410(43): 4295-4302 (2009) - 2008
- [j38]Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth:
Identifying Rhythms in Musical Texts. Int. J. Found. Comput. Sci. 19(1): 37-51 (2008) - [j37]Jan Holub, William F. Smyth, Shu Wang:
Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6(1): 37-50 (2008) - [j36]Gang Chen, Simon J. Puglisi, William F. Smyth:
Lempel-Ziv Factorization Using Less Time & Space. Math. Comput. Sci. 1(4): 605-623 (2008) - [j35]Simon J. Puglisi, Jamie Simpson, William F. Smyth:
How many runs can a string contain? Theor. Comput. Sci. 401(1-3): 165-171 (2008) - [c30]Maxime Crochemore, Lucian Ilie, William F. Smyth:
A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC 2008: 482-488 - [c29]William F. Smyth, Shu Wang:
New Perspectives on the Prefix Array. SPIRE 2008: 133-143 - [c28]William F. Smyth, Shu Wang, Mao Yu:
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. Stringology 2008: 95-107 - [c27]Simon J. Puglisi, William F. Smyth, Munina Yusufu:
Fast Optimal Algorithms for Computing All the Repeats in a String. Stringology 2008: 161-169 - 2007
- [j34]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39(2): 4 (2007) - [j33]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): 1001-1010 (2007) - [j32]Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A simple fast hybrid pattern-matching algorithm. J. Discrete Algorithms 5(4): 682-695 (2007) - [j31]Frantisek Franek, Jiandong Jiang, William F. Smyth:
Two-pattern strings II - frequency of occurrence and substring complexity. J. Discrete Algorithms 5(4): 739-748 (2007) - [c26]Gang Chen, Simon J. Puglisi, William F. Smyth:
Fast and Practical Algorithms for Computing All the Runs in a String. CPM 2007: 307-315 - [c25]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: 513-516 - 2006
- [j30]Frantisek Franek, William F. Smyth:
Reconstructing a Suffix Array. Int. J. Found. Comput. Sci. 17(6): 1281-1296 (2006) - [j29]Kangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin:
A New Periodicity Lemma. SIAM J. Discret. Math. 20(3): 656-668 (2006) - [c24]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
Suffix arrays: what are they good for? ADC 2006: 17-18 - [c23]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: 146-155 - [c22]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. SPIRE 2006: 122-133 - [c21]Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth:
Song classifications for dancing. Stringology 2006: 41-48 - 2005
- [j28]Frantisek Franek, William F. Smyth:
Sorting suffixes of two-pattern strings. Int. J. Found. Comput. Sci. 16(6): 1135-1144 (2005) - [j27]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): 641-653 (2005) - [c20]Kangmin Fan, William F. Smyth, R. J. Simpson:
A New Periodicity Lemma. CPM 2005: 257-265 - [c19]Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A Simple Fast Hybrid Pattern-Matching Algorithm. CPM 2005: 288-297 - [c18]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
The Performance of Linear Time Suffix Sorting Algorithms. DCC 2005: 358-367 - [c17]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
A taxonomy of suffix array construction algorithms. Stringology 2005: 1-30 - [c16]Frantisek Franek, William F. Smyth:
Reconstructing a suffix array. Stringology 2005: 54-68 - 2004
- [c15]Frantisek Franek, William F. Smyth:
Sorting suffixes of two-pattern strings. Stringology 2004: 69-78 - 2003
- [j26]Frantisek Franek, William F. Smyth, Yudong Tang:
Computing all Repeats Using Suffix Arrays. J. Autom. Lang. Comb. 8(4): 579-591 (2003) - [j25]Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao:
Computing Quasi Suffix Arrays. J. Autom. Lang. Comb. 8(4): 593-606 (2003) - [j24]Frantisek Franek, Weilin Lu, William F. Smyth:
Two-pattern strings I - A recognition algorithm. J. Discrete Algorithms 1(5-6): 445-460 (2003) - [j23]Frantisek Franek, William F. Smyth, Xiangdong Xiao:
A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach. Nord. J. Comput. 10(1): 21-28 (2003) - [j22]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): 40-51 (2003) - [c14]Bill Smyth, Chiou Peng Lam, Xin Chen, Valerie Maxville:
Heuristics for Image Retrieval Using Spatial Configurations. DICTA 2003: 909-918 - [c13]Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
Computing the Minimum k-Cover of a String. Stringology 2003: 51-64 - 2002
- [j21]Yin Li, William F. Smyth:
Computing the Cover Array in Linear Time. Algorithmica 32(1): 95-106 (2002) - [c12]Andrew Turpin, William F. Smyth:
An Approach to Phrase Selection for Offline Data Compression. ACSC 2002: 267-273 - [c11]Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth:
Two-Pattern Strings. CPM 2002: 76-84 - [c10]Frantisek Franek, William F. Smyth, Xiangdong Xiao:
A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach. Stringology 2002: 56-43 - [c9]Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis:
String Regularities with Don't Cares. Stringology 2002: 65-74 - 2001
- [j20]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001) - 2000
- [j19]Frantisek Franek, Ayse Karaman, W. F. Smyth:
Repetitions in Sturmian strings. Theor. Comput. Sci. 249(2): 289-303 (2000) - [j18]W. F. Smyth:
Repetitive perhaps, but certainly not boring. Theor. Comput. Sci. 249(2): 343-355 (2000) - [c8]Frantisek Franek, Weilin Lu, William F. Smyth:
Repetitions in two-pattern strings. Stringology 2000: 32-48
1990 – 1999
- 1999
- [j17]Dennis W. G. Moore, William F. Smyth, D. Miller:
Counting Distinct Strings. Algorithmica 23(1): 1-13 (1999) - [c7]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate Periods of Strings. CPM 1999: 123-133 - 1997
- [j16]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): 281-291 (1997) - 1996
- [j15]Art M. Duval, William F. Smyth:
Covering a Circular String with Substrings of Fixed Length. Int. J. Found. Comput. Sci. 7(1): 87-93 (1996) - 1995
- [j14]Nora Hartsfield, W. F. Smyth:
A family of sparse graphs of large sum number. Discret. Math. 141(1-3): 163-171 (1995) - [j13]Costas S. Iliopoulos, William F. Smyth:
A fast average case algorithm for lyndon decomposition. Int. J. Comput. Math. 57(1-2): 15-31 (1995) - [j12]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): 101-103 (1995) - 1994
- [j11]Dennis W. G. Moore, William F. Smyth:
An Optimal Algorithm to Compute all the Covers of a String. Inf. Process. Lett. 50(5): 239-246 (1994) - [j10]Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth:
Parallel RAM Algorithms for Factorizing Words. Theor. Comput. Sci. 127(1): 53-67 (1994) - [c6]Dennis W. G. Moore, William F. Smyth:
Computing the Covers of a String in Linear Time. SODA 1994: 511-515 - 1993
- [j9]William F. Smyth, Reihaneh Safavi-Naini:
Automated Cryptanalysis of Substitution Ciphers. Cryptologia 17(4): 407-418 (1993) - [j8]Peter Eades, Xuemin Lin, W. F. Smyth:
A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993) - 1992
- [j7]Lou Caccetta, W. F. Smyth:
Graphs of maximum diameter. Discret. Math. 102(2): 121-141 (1992) - [j6]Costas S. Iliopoulos, William F. Smyth:
Optimal Algorithms for Computing the canonical form of a circular string. Theor. Comput. Sci. 92(1): 87-105 (1992) - 1991
- [j5]W. F. Smyth:
Mu-Balancing M-Way Search Trees. Comput. J. 34(5): 406-414 (1991) - 1990
- [j4]K. A. Redish, W. F. Smyth:
Closed form expressions for the iterated floor function. Discret. Math. 91(3): 317-321 (1990)
1980 – 1989
- 1989
- [c5]Costas S. Iliopoulos, William F. Smyth:
PRAM Algorithms for Identifying Polygon Similarity. Optimal Algorithms 1989: 25-32 - 1987
- [j3]K. A. Redish, W. F. Smyth:
Evaluating Measures of Program Quality. Comput. J. 30(3): 228-232 (1987) - 1986
- [j2]K. A. Redish, W. F. Smyth:
Program Style Analysis: A Natural By-Product of Program Compilation. Commun. ACM 29(2): 126-133 (1986) - 1980
- [c4]W. F. Smyth, N. W. N. Jayasiri:
The Encouragement of Effective Computer Use in Developing Countries. IFIP Congress 1980: 885-890
1970 – 1979
- 1976
- [c3]W. F. Smyth, Ilona Arany:
Another algorithm for reducing bandwidth and profile of a sparse matrix. AFIPS National Computer Conference 1976: 987-994 - 1974
- [j1]W. F. Smyth, E. Radaceanu:
A Storage Scheme for Hierarchic Structures. Comput. J. 17(2): 152-156 (1974) - [c2]W. F. Smyth, W. M. L. Benzi:
An Algorithm for Finding the Diameter of a Graph. IFIP Congress 1974: 500-503 - 1971
- [c1]Ilona Arany, Lajos Szoda, W. F. Smyth:
An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices. IFIP Congress (2) 1971: 1246-1250
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
