W. F. Smyth -- Refereed Publications

  1. Hamed Hasibi, Neerja Mhaskar & W. F. Smyth, On the Complexity of Finding Approximate LCS of Multiple Substrings, to appear (2025).
  2. Hossein Dehghani, Thierry Lecroq, Neerja Mhaskar & W. F. Smyth, Practical KMP/BM Style Pattern-Matching on Indeterminate Strings, Discrete Applied Mathematics, to appear (2024).
  3. Neerja Mhaskar & W. F. Smyth, String Covering: A Survey, Fundamenta Informaticae 190-1 (2023) 17-45.
  4. G. Brian Golding, Holly Koponen, Neerja Mhaskar & W. F. Smyth, Computing Maximal Covers for Protein Sequences, J. Computational Biology 30-2 (2023) 149-160.
  5. Mai A. Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim & W. F. Smyth, Local Maximal Equality-free Periodicities, Artificial Intelligence Applications & Innovations (AIAI) --- IFIP Advances in Information & Communication Technology, vol. 677 (2023) 359-368.
  6. Jacqueline W. Daykin, Neerja Mhaskar & W. F. Smyth, V-Words, Lyndon Words and Substring circ-UMFFs, Proc. 16th Annual Int. Conf. Combinatorial Optimization & Applications (COCOA 2023), Springer Lecture Notes in Computer Science, LNCS 14461 (2023) 471-484.
  7. Holly Koponen, Neerja Mhaskar & W. F. Smyth, Improved Practical Algorithms to Compute Maximal Covers, Proc. Prague Stringology Conference (2023) 30-41.
  8. Jacqueline W. Daykin, Neerja Mhaskar, & W. F. Smyth, Computation of the Suffix Array, Burrows-Wheeler Transform and FM-Index in V-Order, Theoretical Computer Science 880 (2021) 82-96.
  9. Felipe A. Louza, Neerja Mhaskar & W. F. Smyth, A new approach to regular and indeterminate strings, Theoretical Computer Science 854 (2021) 105-115.
  10. Holly Koponen, Neerja Mhaskar & W. F. Smyth, An Overview of String Processing Applications to Data Analytics, IEEE Proc. RDAAPS 2021, Reconciling Data Analytics, Automation, Privacy & Security, (2021) 1-8.
  11. Neerja Mhaskar & W. F. Smyth, Simple KMP Pattern-Matching on Indeterminate Strings, Proc. Prague Stringology Conference (2020) 125-133.
  12. Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik & W. F. Smyth, IWOCA 2020 in Bordeaux (Oops! On-Line!): (1) IFIP News (International Federation for Information Processing) (September 2020) 9-10 (2) IFORS News (International Federation of Operational Research Societies) (September 2020) 24-25 (3) Bulletin of the EATCS (European Association for Theoretical Computer Science) (October 2020) 73-76 (4) Bulletin of the Institute of Combinatorics and its Applications 90 (2020) 11-15.
  13. Mai A. Alzamel, Costas S. Iliopoulos, W. F. Smyth & Wing-Kin Sung, Off-line and on-line algorithms for closed string factorization, Theoretical Computer Science 792, Special Issue honouring 70th birthday of Wojciech Rytter (2019) 12-19.
  14. Amy Glen, Jamie Simpson & W. F. Smyth, More properties of the Fibonacci word on an infinite alphabet, Theoretical Computer Science 795 (2019) 301-311.
  15. 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, Proc. 13th International Workshop on Algorithms & Computation, Springer Lecture Notes in Computer Science, LNCS 11355 (2019) 329-338.
  16. Zsuzsanna Lipták & W. F. Smyth (eds.), Discrete Applied Mathematics 246, Special Issue The Combinatorics of Graphs and Strings (2018) 154 pp.
  17. Ljiljana Brankovic, Joe Ryan & W. F. Smyth (eds.), Journal of Discrete Algorithms 52-53: Combinatorial Algorithms -- Special Issue Devoted to Life and Work of Mirka Miller (2018) 192 pp.
  18. Ljiljana Brankovic, Joe Ryan & W. F. Smyth (eds.), Proc. 28th International Workshop on Combinatorial Algorithms, Springer Lecture Notes in Computer Science, LNCS 10765 (2018) 430 pp.
  19. Joel Helling, P. J. Ryan, W. F. Smyth & Michael Soltys, Constructing an indeterminate string from its associated graph, Theoretical Computer Science 710 (2018) 88-96.
  20. Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam & W. F. Smyth, Reconstructing a string from its Lyndon arrays, Theoretical Computer Science 710 (2018) 44-51.
  21. Neerja Mhaskar & W. F. Smyth, Frequency covers for strings, Fundamenta Informaticae 163-3 (2018) 275-289.
  22. Neerja Mhaskar & W. F. Smyth, String covering with optimal covers, Journal of Discrete Algorithms 51 (2018) 26-38.
  23. Felipe A. Louza, Giovanni Manzini, W. F. Smyth & Guilherme P. Telles, Lyndon array construction during Burrows-Wheeler inversion, Journal of Discrete Algorithms 50 (2018) 2-9.
  24. Amy Glen, Jamie Simpson & W. F. Smyth, Palindromes in starlike trees, Australasian J. Combinatorics 73-1 (2018) 242-246.
  25. Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman & W. F. Smyth, A faster V-order string comparison algorithm, Proc. Prague Stringology Conference (2018) 38-48.
  26. Frantisek Franek, Michael Liut & W. F. Smyth, On Baier's sort of maximal Lyndon substrings, Proc. Prague Stringology Conference (2018) 63-78.
  27. Richard Beal, Don Adjeroh & W. F. Smyth, A prefix array for parameterized strings, Journal of Discrete Algorithms 42 (2017) 23-34.
  28. Amy Glen, Jamie Simpson & W. F. Smyth, Counting Lyndon factors, Electronic J. Combinatorics 24-3 (2017) P3.28.
  29. Frantisek Franek, W. F. Smyth & Xingfang Wang, The role of the prefix array in sequence analysis: a survey, AIMS Medical Science 4-3 (2017) 261-273.
  30. Frantisek Franek, Asma Paracha & W. F. Smyth, The linear equivalence of the suffix array and the partially sorted Lyndon array, Proc. Prague Stringology Conference (2017) 77-84.
  31. Zsuzsanna Lipták & William F. Smyth (eds.), Proc. 26th International Workshop on Combinatorial Algorithms, Springer Lecture Notes in Computer Science, LNCS 9538 (2016) 357 pp.
  32. Haoyue Bai, Frantisek Franek & W. F. Smyth, The new periodicity lemma revisited, Discrete Applied Mathematics 212 (2016) 30-36.
  33. Ali Alatabbi, M. Sohel Rahman & W. F. Smyth, Computing covers using prefix tables, Discrete Applied Mathematics 212 (2016) 2-9. See source code.
  34. Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston & W. F. Smyth, A note on easy and efficient computation of full Abelian periods of a word, Discrete Applied Mathematics 212 (2016) 88-95.
  35. Ali Alatabbi, Jacqueline W. Daykin, Juha Kärkkäinen, M. Sohel Rahman & W. F. Smyth, V-order: new combinatorial properties & a simple on-line comparison algorithm, Discrete Applied Mathematics 215 (2016) 41-46.
  36. Ali Alatabbi, A. S. M. Sohidull Islam, M. Sohel Rahman, Jamie Simpson & W. F. Smyth, Enhanced covers of regular & indeterminate strings using prefix tables, J. Automata, Languages & Combinatorics 21-3 (2016) 131-147.
  37. Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman & W. F. Smyth, Algorithms to compute the Lyndon array, Proc. Prague Stringology Conference (2016) 172-184.
  38. Bharati Rajan & W. F. Smyth (eds.), Journal of Discrete Algorithms 33, Special Issue from International Conference on Mathematics in Engineering & Business Management (ICMEB 2012) (2015) 48 pp.
  39. Bill Smyth, Perspectives, Journal of Discrete Algorithms 32, StringMasters 2012 & 2013 Special Issue (Volume 2), Maxime Crochemore, Jacqueline W. Daykin & Zsuzsanna Lipták (eds.) (2015) 3-5.
  40. Ali Alatabbi, M. Sohel Rahman & W. F. Smyth, Inferring an indeterminate string from a prefix graph, Journal of Discrete Algorithms 32, StringMasters 2012 & 2013 Special Issue (Volume 2), Maxime Crochemore, Jacqueline W. Daykin & Zsuzsanna Lipták (eds.) (2015) 6-13. See source code.
  41. Manolis Christodoulakis, P. J. Ryan, W. F. Smyth & Shu Wang, Indeterminate strings, prefix arrays & undirected graphs, Theoretical Computer Science 600 (2015) 34-48.
  42. Widmer Bland & W. F. Smyth, Three overlapping squares: the general case characterized & applications, Theoretical Computer Science 596-6 (2015) 23-40.
  43. Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman & W. F. Smyth, Simple linear comparison of strings in V-order, Fundamenta Informaticae 139-2 (2015) 115-126.
  44. Carl Barton, C. S. Iliopoulos, Solon P. Pissis & W. F. Smyth, Fast & simple computations using prefix tables under Hamming and edit distance, Proc. 25th International Workshop on Combinatorial Algorithms, Dalibor Froncek, Jan Kratochvil & Mirka Miller (eds.), Springer Lecture Notes in Computer Science, LNCS 8986 (2015) 49-61.
  45. Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman & W. F. Smyth, String comparison in V-order: new lexicographic properties & on-line applications, arXiv:1507.07038 (2015).
  46. William F. Smyth, MR3367599: review of The sequence of return words of the Fibonacci sequence, Yuke Huang & Zhiying Wen, Theoretical Computer Science 593 (2015) 106-116.
  47. William F. Smyth, MR3310478: review of On a weaker version of sum labeling of graphs, Imran Javaid, Fariha Khalid, Ali Ahmad & M. Imran, Math. Reports 16-66, 3 (2014) 413-420.
  48. W. F. Smyth, Large scale detection of repetitions, Proc. The Royal Society A 372, no. 2016 (2014) article 20130138.
  49. Jacqueline W. Daykin & W. F. Smyth, A bijective variant of the Burrows-Wheeler transform using V-order, Theoretical Computer Science 531 (2014) 77-89.
  50. Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman & W. F. Smyth, Simple linear comparison of strings in V-order (preliminary version), Proc. 8th International Workshop on Algorithms & Computation, Springer Lecture Notes in Computer Science, LNCS 8344 (2014) 80-89.
  51. Haoyue Bai, Frantisek Franek & W. F. Smyth, Two squares canonical factorization, Proc. Prague Stringology Conference (2014) 52-58.
  52. W. F. Smyth, Computing patterns in very long strings, Proc. Workshop on Bioinformatics & Stringology (BioS 2014) (2014) 5-11.
  53. William F. Smyth, MR3239794: review of The feedback arc set problem with triangle inequality is a vertex cover problem, Monaldo Mastrolilli, Algorithmica 70 (2014) 326-339.
  54. William F. Smyth, MR3181369: review of Squares in partial words, F. Blanchet-Sadri, Yang Jiao, John M. Machacek, J. D. Quigley & Xufan Zhang, Theoretical Computet Science 530 (2014) 42-57.
  55. S. Arumugam & W. F. Smyth (eds.), Journal of Discrete Algorithms 23, Special Issue from 23rd International Workshop on Combinatorial Algorithms (IWOCA 2012), (2013) 165 pp.
  56. W. F. Smyth, Computing regularities in strings: a survey, European J. Combinatorics 34-1 (2013) 3-14.
  57. Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, W. F. Smyth, German Tischler & Munina Yusufu, A comparison of indexed-based Lempel-Ziv LZ77 factorization algorithms, ACM Computing Surveys 45-1 (2013) 5:1-5:17.
  58. Lucian Ilie, Hamid Mohamadi, G. Brian Golding & W. F. Smyth, BOND: Basic OligoNucleotide Design, BMC Bioinformatics 14-69 (2013) 1-8.
  59. David E. Daykin, Jacqueline W. Daykin & W. F. Smyth, A linear partitioning algorithm for hybrid Lyndons using V-order, Theoretical Computer Science 483 (2013) 149-161.
  60. Tomas Flouri, C. S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth & Wojciech Tyczynski, Enhanced string covering, Theoretical Computer Science 506 (2013) 102-114.
  61. W. F. Smyth, Are three squares impossible?, Formal Aspects of Computing (Essays dedicated to Derrick Kourie on the occasion of his 65th birthday), Shaker Verlag, Stefan Gruner & Bruce Watson (eds.) (2013) Chapter 8, 135-150.
  62. Jacqueline W. Daykin & W. F. Smyth, Analyzing strings with ordered Lyndon-like structures, Formal Aspects of Computing (Essays dedicated to Derrick Kourie on the occasion of his 65th birthday), Shaker Verlag, Stefan Gruner & Bruce Watson (eds.) (2013) Chapter 5, 95-110.
  63. David E. Daykin, Jacqueline W. Daykin, C. S. Iliopoulos & W. F. Smyth, Generic algorithms for factoring strings, Proc. Memorial Symp. for Rudolf Ahlswede, Harout Aydinian, Ferdinando Cicalese & Christian Deppe (eds.), Springer Lecture Notes in Computer Science, LNCS 7777 (2013) 402-418.
  64. Widmer Bland, Gregory Kucherov & W. F. Smyth, Prefix table construction & conversion, Proc. 24th International Workshop on Combinatorial Algorithms, Springer Lecture Notes in Computer Science, LNCS 8288 (2013) 41-53.
  65. William F. Smyth, MR3072732: review of Reversible Christoffel factorizations, Michelangelo Bucci, Alessandro De Luca & Luca Q. Zamboni, Theoretical Computer Science 495 (2013) 17-24.
  66. William F. Smyth, MR3054264: review of Counting finite languages by total word length, Stefan Gerhold, Integers 11-6 (2011) 863-872.
  67. William F. Smyth, MR2999830: review of Large simple binary equality words, Jana Hadravova & Stepan Holub, Internat. J. Found. Comput. Sci. 23-6 (2012) 1385-1403.
  68. William F. Smyth, MR2916356: review of Parameterized longest previous factor, Richard Beal & Donald Adjeroh, Theoretical Computer Science 437 (2012) 21-34.
  69. C. S. Iliopoulos & W. F. Smyth (eds.), J. Discrete Algorithms 16, Special Issue from 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011) (2012) 307 pp.
  70. Jacqueline W. Daykin, W. F. Smyth, & Lynette van Zijl (eds.), J. Discrete Algorithms 10, Special Issue from StringMasters 2009 & 2010 (2012) 34 pp.
  71. C. S. Iliopoulos & W. F. Smyth (eds.), J. Discrete Algorithms 14, Special Issue from 21st International Workshop on Combinatorial Algorithms (IWOCA 2010) (2012) 261 pp.
  72. S. Arumugam & W. F. Smyth (eds.), Proc. 23rd International Workshop on Combinatorial Algorithms, Springer Lecture Notes in Computer Science, LNCS 7643 (2012) 303 pp.
  73. Evguenia Kopylova & W. F. Smyth, The three squares lemma revisited, J. Discrete Algorithms 11 (2012) 3-14.
  74. Frantisek Franek, Robert C. G. Fuller, Jamie Simpson & W. F. Smyth, More results on overlapping squares, J. Discrete Algorithms 17 (2012) 2-8.
  75. Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston & W. F. Smyth, Quasi-linear time computation of the Abelian periods of a word, Proc. Prague Stringology Conference (2012) 103-110.
  76. Tomas Flouri, C. S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth & Wojciech Tyczynski, New and efficient approaches to the quasiperiodic characterisation of a string, Proc. Prague Stringology Conference (2012) 75-88.
  77. Bill Smyth, Report on IWOCA 2012: 23rd International Workshop on Combinatorial Algorithms, Bulletin of the European Association for Theoretical Computer Science 108 (2012) 163-167.
  78. William F. Smyth, MR2886036: review of Stronger Lempel-Ziv based compressed text indexing, Diego Arroyuelo, Gonzalo Navarro & Kunihiko Sadakane, Algorithmica 22-1/2 (2012) 54-101.
  79. C. S. Iliopoulos & W. F. Smyth (eds.), Proc. 22nd International Workshop on Combinatorial Algorithms, Springer Lecture Notes in Computer Science, LNCS 7056 (2011) 386 pp.
  80. C. S. Iliopoulos, Manal Mohamed & W. F. Smyth, New complexity results for the k-covers problem, Information Sciences 181 (2011) 2571-2575.
  81. Lucian Ilie & W. F. Smyth, Minimum unique substrings and maximum repeats, Fundamenta Informaticae 110-1/4 (2011) 183-195.
  82. David E. Daykin, Jacqueline W. Daykin & W. F. Smyth, String comparison & Lyndon-like factorization using V-order in linear time, Proc. 22nd Annual Symposium on Combinatorial Pattern Matching, Springer Lecture Notes in Computer Science LNCS 6661, Raffaele Giancarlo & Giovanni Manzini (eds.), (2011) 65-76.
  83. Bill Smyth, Report on IWOCA 2011: 22nd International Workshop on Combinatorial Algorithms, Bulletin of the European Association for Theoretical Computer Science 105 (2011) 244-247.
  84. William F. Smyth, MR2604938: review of On the number of squares in partial words, Vesa Halava, Tero Harju & Tomi Karki, RAIRO Theor. Inform. Appl. 44-1 (2010) 125-138.
  85. C. S. Iliopoulos & W. F. Smyth (eds.), Proc. 21st International Workshop on Combinatorial Algorithms, Springer Lecture Notes in Computer Science, LNCS 6460 (2010) 423 pp.
  86. Simon J. Puglisi, W. F. Smyth & Munina Yusufu, Fast practical algorithms for computing all the repeats in a string, Mathematics in Computer Science 3-4, Special Issue "Advances in Combinatorial Algorithms II", Manolis Christodoulakis & C. S. Iliopoulos (eds.) (2010) 373-389.
  87. Pedram Hayati, Vidyasagar Potdar, W. F. Smyth & Alex Talevski, Rule-based on-the-fly spambot detection using action strings, Proc. Seventh Annual Collaboration, Electronic Messaging, Anti-Abuse & Spam Conference (CEAS) (2010).
  88. F. H. Ridzuan, Vidyasagar Potdar, Alex Talevski & W. F. Smyth, Key parameters in identifying cost of Spam 2.0, Proc. 24th IEEE International Conference on Advanced Information Networking & Applications (AINA) (2010) 789-796.
  89. Bill Smyth, Report on IWOCA 2010: 21st International Workshop on Combinatorial Algorithms, Bulletin of the European Association for Theoretical Computer Science 102 (2010) 233-235.
  90. William F. Smyth, MR2491553: review of Breaking a time-and-space barrier in constructing full-text indices, Wing-Kai Hon, Kunihiko Sadakane & Wing-Kin Sung, SIAM J. Comput. 38-6 (2009) 2162-2178.
  91. William F. Smyth, MR2500707: review of Unbordered partial words, F. Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas & Margaret Moorefield, Discrete Appl. Math. 157-5 (2009) 890-900.
  92. Yuqing Lin & Bill Smyth (eds.), J. Combinatorial Mathematics & Combinatorial Computing 71, Special Issue from 18th International Workshop on Combinatorial Algorithms (IWOCA 2007) (2009) 172 pp.
  93. W. F. Smyth & Shu Wang, A new approach to the periodicity lemma on strings with holes, Theoretical Computer Science 410-43, Special Issue for Maxime Crochemore's 60th birthday, C. S. Iliopoulos & Wojciech Rytter (eds.) (2009) 4295-4302.
  94. W. F. Smyth & Shu Wang, An adaptive hybrid pattern-matching algorithm on indeterminate strings, Internat. J. Foundations of Computer Sci. 20-6 (2009) 985-1004.
  95. David E. Daykin, Jacqueline W. Daykin & W. F. Smyth, Combinatorics of Unique Maximal Factorization Families (UMFFs), Fundamenta Informaticae 97-3, Special StringMasters Issue, Ryszard Janicki, Simon J. Puglisi & M. Sohel Rahman (eds.) (2009) 295-309.
  96. C. S. Iliopoulos, W. F. Smyth & Munina Yusufu, Faster algorithms for computing maximal multirepeats in multiple sequences, Fundamenta Informaticae 97-3, Special StringMasters Issue, Ryszard Janicki, Simon J. Puglisi & M. Sohel Rahman (eds.) (2009) 311-320.
  97. W. F. Smyth & Munina Yusufu, Computing regularities in strings, Proc. Second IEEE International Conference on Computer Science & Information Technology (2009) 298-302.
  98. William F. Smyth, MR2473932: review of Quasiperiodic and Lyndon episturmian words, Amy Glen, Florence Leve & Gwenael Richomme, Theoret. Comput. Sci. 409-3 (2008) 578-600.
  99. Mirka Miller & Bill Smyth (eds.), Fundamenta Informaticae 84-1, Special Issue on Combinatorial Algorithms (2008) 149 pp.
  100. Simon J. Puglisi, Jamie Simpson & W. F. Smyth, How many runs can a string contain?, Theoretical Computer Science 401 (2008) 165-171.
  101. Jan Holub, W. F. Smyth & Shu Wang, Fast pattern-matching on indeterminate strings, J. Discrete Algorithms 6-1 (2008) 37-50.
  102. Gang Chen, Simon J. Puglisi & W. F. Smyth, Lempel-Ziv factorization using less time & space, Mathematics in Computer Science 1-4, Joseph Chan & Maxime Crochemore (eds.) (2008) 605-623.
  103. Manolis Christodoulakis, C. S. Iliopoulos, M. Sohel Rahman & W. F. Smyth, Identifying rhythms in musical texts, Internat. J. Foundations of Computer Sci. 19-1 (2008) 37-52.
  104. Maxime Crochemore, Lucian Ilie & W. F. Smyth, A simple algorithm for computing the Lempel-Ziv factorization, Proc. 18th Data Compression Conference, Jim Storer & M. W. Marcellin (eds.) (2008) 482-488.
  105. W. F. Smyth & Shu Wang, New perspectives on the prefix array, Proc. 15th String Processing & Information Retrieval Symposium, Springer Lecture Notes in Computer Science LNCS 5280 (2008) 133-143.
  106. W. F. Smyth, Shu Wang & Mao Yu, An adaptive hybrid pattern-matching algorithm on indeterminate strings (preliminary version), Proc. Prague Stringology Conference 2008, Jan Holub & Jan Zdarek (eds.) (2008) 95-107.
  107. Simon J. Puglisi, W. F. Smyth & Munina Yusufu, Fast optimal algorithms for computing all the repeats in a string (preliminary version), Proc. Prague Stringology Conference 2008, Jan Holub & Jan Zdarek (eds.) (2008) 161-169.
  108. Bill Smyth, Report on CPM 2007: 18th Annual Symposium on Combinatorial Pattern Matching, Bulletin of the European Association for Theoretical Computer Science 94 (2008) 235-237.
  109. Bill Smyth, Report on IWOCA 2007: 18th International Workshop on Combinatorial Algorithms, Bulletin of the European Association for Theoretical Computer Science 94 (2008) 240-242.
  110. Ljiljana Brankovic, Yuqing Lin & Bill Smyth (eds.), Proc. 18th International Workshop on Combinatorial Algorithms, College Publications (2007).
  111. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, A taxonomy of suffix array construction algorithms, ACM Computing Surveys 39-2 (2007) 1-31.
  112. Manolis Christodoulakis, G. Brian Golding, C. S. Iliopoulos, Yoan Pinzon Ardila & W. F. Smyth, Efficient algorithms for counting & reporting segregating sites in genomic sequences, J. Computational Biology 14-7 (2007) 1001-1010.
  113. Frantisek Franek, Christopher G. Jennings & W. F. Smyth, A simple fast hybrid pattern-matching algorithm, J. Discrete Algorithms 5-4 (2007) 682-695.
  114. Frantisek Franek, Jiandong Jiang & W. F. Smyth, Two-pattern strings II -- frequency of occurrence & substring complexity, J. Discrete Algorithms 5-4 (2007) 739-748.
  115. Gang Chen, Simon J. Puglisi & W. F. Smyth, Fast & practical algorithms for computing all the runs in a string, Proc. 18th Annual Symposium on Combinatorial Pattern Matching, Springer Lecture Notes in Computer Science LNCS 4580 (2007) 307-315.
  116. Hamid Abdul Basit, Simon J. Puglisi, W. F. Smyth, Andrew Turpin & Stan Jarzabek, Efficient token based clone detection with flexible tokenization, Proc. 6th Joint Meeting: European Software Engineering Conference & ACM SIGSOFT Symposium on Software Engineering (2007) 513-516.
  117. Bill Smyth, The maximum number of runs in a string, 18th International Workshop on Combinatorial Algorithms (2007) Problem 7 in Problems Sessions.
  118. Bill Smyth, Computing Patterns in Strings (Russian translation), Williams Publishing House, Kiev (2006) 486 pp.
  119. Kangmin Fan, Simon J. Puglisi, W. F. Smyth & Andrew Turpin, A new periodicity lemma, SIAM J. Discrete Mathematics 20-3 (2006) 656-668.
  120. Frantisek Franek & W. F. Smyth, Reconstructing a suffix array, Internat. J. Foundations of Computer Sci. 17-6 (2006) 1281-1295.
  121. K. M. Koh, Mirka Miller, W. F. Smyth & Yan Wang, On optimum summable graphs, AKCE International Journal of Graphs and Combinatorics 3-1 (2006) 45-57.
  122. Jan Holub, W. F. Smyth & Shu Wang, Hybrid pattern-matching algorithms on indeterminate strings, London Algorithmics and Stringology 2006, Jacqueline W. Daykin, Manal Mohamed & Kathleen Steinhoefel (eds.), King's College London Series Texts in Algorithmics (2006) 115-133.
  123. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, Inverted files versus suffix arrays for in-memory pattern matching, Proc. 13th Symposium on String Processing & Information Retrieval, Springer Lecture Notes in Computer Science LNCS 4209 (2006) 122-133.
  124. M. Sohel Rahman, C. S. Iliopoulos, Inbok Lee, Manal Mohamed & W. F. Smyth, Finding patterns with variable length gaps or don't cares, Proc. 12th Annual International Computing & Combinatorics Conference (2006) 146-155.
  125. Manolis Christodoulakis, C. S. Iliopoulos, M. Sohel Rahman & W. F. Smyth, Song classifications for dancing, Proc. Prague Stringology Conference '06 (2006) 41-48.
  126. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, Suffix arrays: what are they good for?, Proc. 17th Annual Australasian Database Conference, vol. 49 (2006) 17-18.
  127. Richard Cole, C. S. Iliopoulos, Manal Mohamed, W. F. Smyth & Lu Yang, The complexity of the minimum k-cover problem, J. Automata, Languages & Combinatorics 10-5/6 (2005) 641-653.
  128. Frantisek Franek & W. F. Smyth, Sorting suffixes of two-pattern strings, Internat. J. Foundations of Computer Sci. 16-6 (2005) 1135-1144.
  129. W. F. Smyth, Computing periodicities in strings -- a new approach (invited paper), Proc. 16th Australasian Workshop on Combinatorial Algorithms (2005) 481-488.
  130. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, Some restrictions on periodicity in strings, Proc. 16th Australasian Workshop on Combinatorial Algorithms (2005) 263-268.
  131. Jan Holub, W. F. Smyth & Shu Wang, Fast pattern-matching on indeterminate strings (preliminary version), Proc. 16th Australasian Workshop on Combinatorial Algorithms (2005) 415-428.
  132. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, A taxonomy of suffix array construction algorithms (invited paper), Proc. Prague Stringology Conference '05 (2005) 1-30.
  133. Frantisek Franek & W. F. Smyth, Reconstructing a suffix array (preliminary version), Proc. Prague Stringology Conference '05 (2005) 54-68.
  134. Kangmin Fan, W. F. Smyth & Jamie Simpson, A new periodicity lemma (preliminary version), Proc. 16th Annual Symposium on Combinatorial Pattern Matching, Springer Lecture Notes in Computer Science LNCS 3537 (2005) 257-265.
  135. Frantisek Franek, Christopher G. Jennings & W. F. Smyth, A simple fast hybrid pattern-matching algorithm (preliminary version), Proc. 16th Annual Symposium on Combinatorial Pattern Matching, Springer Lecture Notes in Computer Science LNCS 3537 (2005) 288-297.
  136. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, The performance of linear time suffix sorting algorithms, Proc. Data Compression Conference, Jim Storer & Martin Cohn (eds.) (2005) 358-367.
  137. C. S. Iliopoulos, Manal Mohamed & W. F. Smyth, New complexity results for the k-covers problem (preliminary version), Proc. 15th Australasian Workshop on Combinatorial Algorithms, Seokhee Hong (ed.) (2004) 141-147.
  138. Antonitio, P. J. Ryan, W. F. Smyth, Andrew Turpin & Xiaoyang Yu, New suffix array algorithms -- linear but not fast?, Proc. 15th Australasian Workshop on Combinatorial Algorithms, Seokhee Hong (ed.) (2004) 148-156.
  139. Frantisek Franek & W. F. Smyth, Sorting suffixes of two-pattern strings (preliminary version), Proc. Prague Stringology Conference '04 (2004) 69-78.
  140. W. F. Smyth, Computing Patterns in Strings. Pearson Addison Wesley (UK) (2003) 423 pp.
  141. W. F. Smyth (ed.), Fundamenta Informaticae 56-1/2, Special Issue on Computing Patterns in Strings (June/July 2003).
  142. Frantisek Franek, Weilin Lu & W. F. Smyth, Two-pattern strings I -- a recognition algorithm, J. Discrete Algorithms 1-5/6 (2003) 445-460.
  143. Frantisek Franek, W. F. Smyth & Xiangdong Xiao, A note on Crochemore's repetitions algorithm -- a fast space-efficient approach, Nordic J. Computing 10-1 (2003) 21-28.
  144. C. S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina G. Perdikuri, W. F. Smyth & Athanasios K. Tsakalidis, String regularities with don't cares, Nordic J. Computing 10-1 (2003) 40-51.
  145. Frantisek Franek, W. F. Smyth & Yudong Tang, Computing all repeats using suffix arrays, J. Automata, Languages & Combinatorics 8-4 (2003) 579-591.
  146. Frantisek Franek, Jan Holub, W. F. Smyth & Xiangdong Xiao, Computing quasi suffix arrays, J. Automata, Languages & Combinatorics 8-4 (2003) 593-606.
  147. Frantisek Franek, Jamie Simpson & W. F. Smyth, The maximum number of runs in a string, Proc. 14th Australasian Workshop on Combinatorial Algorithms, Mirka Miller & Kunsoo Park (eds.) (2003) 26-35.
  148. Jan Holub & W. F. Smyth, Algorithms on indeterminate strings, Proc. 14th Australasian Workshop on Combinatorial Algorithms, Mirka Miller & Kunsoo Park (eds.) (2003) 36-45.
  149. Mirka Miller, Joe Ryan & W. F. Smyth, The sum number of a disjoint union of graphs, Proc. 14th Australasian Workshop on Combinatorial Algorithms, Mirka Miller & Kunsoo Park (eds.) (2003) 120-124.
  150. Richard Cole, C. S. Iliopoulos, Manal Mohamed, W. F. Smyth & Lu Yang, Computing the minimum k-cover of a string, Proc. Prague Stringology Conference '03 (2003) 51-62.
  151. W. F. Smyth, C. P. Lam, Xin Chen & Valerie Maxville, Heuristics for image retrieval using spatial configurations, Proc. Digital Image Computing -- Techniques & Applications (DICTA) (2003) 909-918.
  152. C. S. Iliopoulos, Mirka Miller & W. F. Smyth (eds.), Internat. J. Computer Math. 79-12, Special Issue on Combinatorial Algorithms (2002).
  153. Yin Li & W. F. Smyth, Computing the cover array in linear time, Algorithmica 32-1 (2002) 95-106.
  154. Frantisek Franek, Shudi Gao, Weilin Lu, P. J. Ryan, W. F. Smyth, Yu Sun & Lu Yang, Verifying a border array in linear time, J. Combinatorial Math. & Combinatorial Computing 42 (2002) 223-236.
  155. Frantisek Franek, Jiandong Jiang, Weilin Lu & W. F. Smyth, Two-pattern strings [ps], Proc. 13th Annual Symposium on Combinatorial Pattern Matching, Alberto Apostolico & Masayuki Takeda (eds.), Springer Lecture Notes in Computer Science LNCS 2373 (2002) 76-84.
  156. Frantisek Franek, W. F. Smyth & Yudong Tang, Computing all repeats using suffix arrays (preliminary version) [ps], Proc. 13th Australasian Workshop on Combinatorial Algorithms, Elizabeth Billington, Diane Donovan & Abdollah Khodkar (eds.) (2002) 171-184.
  157. Leila Baghdadi, Frantisek Franek, W. F. Smyth & Xiangdong Xiao, Computing quasi suffix arrays (preliminary version) [ps], Proc. 13th Australasian Workshop on Combinatorial Algorithms, Elizabeth Billington, Diane Donovan & Abdollah Khodkar (eds.) (2002) 278-296.
  158. C. S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina G. Perdikuri, W. F. Smyth & Athanasios K. Tsakalidis, String regularities with don't cares (preliminary version), Proc. Prague Stringology Conference '02, M. Balik & M. Simanek (eds.) (2002) 65-74.
  159. Frantisek Franek, W. F. Smyth & Xiangdong Xiao, A note on Crochemore's repetitions algorithm -- a fast space-efficient approach (preliminary version), Proc. Prague Stringology Conference '02, M. Balik & M. Simanek (eds.) (2002) 36-43.
  160. Andrew Turpin & W. F. Smyth, An approach to phrase selection for offline data compression [ps], Proc. 25th Australasian Computer Science Conference, Michael Oudshoorn (ed.) (2002) 267-273.
  161. Jeong Seop Sim, C. S. Iliopoulos, Kunsoo Park & W. F. Smyth, Approximate periods of strings [ps], Theoretical Computer Science 262 (2001) 557-568.
  162. Frantisek Franek, Weilin Lu & W. F. Smyth, Repetitions in two-pattern strings, Proc. Fifth World Multiconference on Systemics, Cybernetics & Informatics, Volume VII (2001) 132-135.
  163. W. F. Smyth, Repetitive perhaps, but certainly not boring, Theoretical Computer Science 249-2 (2000) 343-355.
  164. Frantisek Franek, Ayse Karaman & W. F. Smyth, Repetitions in Sturmian strings, Theoretical Computer Science 249-2 (2000) 289-303.
  165. Dennis_Moore, W. F. Smyth & Dianne Miller, Counting distinct strings, Algorithmica 23-1 (1999) 1-13.
  166. Jeong Seop Sim, C. S. Iliopoulos, W. F. Smyth & W. F. Smyth, Approximate periods of strings (preliminary version), Proc. Tenth Symposium on Combinatorial Pattern Matching (Lecture Notes in Computer Science 1645), Springer-Verlag (1999) 123-133.
  167. Frantisek Franek, Weilin Lu & P. J. Ryan, W. F. Smyth, Yu Sun & Lu Yang, Verifying a border array in linear time (preliminary version) [ps], Proc. Tenth Australasian Workshop on Combinatorial Algorithms, School of Computing, Curtin University of Technology (1999) 26-33.
  168. C. S. Iliopoulos, Dennis_Moore & W. F. Smyth, The covers of a circular Fibonacci string [ps], J. Combinatorial Math. & Combinatorial Computing 26 (1998) 227-236.
  169. Mirka Miller, Joe Ryan, Slamin & W. F. Smyth, Labelling wheels for minimum sum number [dvi | ps], J. Combinatorial Math. & Combinatorial Computing 28 (1998) 289-297.
  170. Mirka Miller, Joe Ryan & W. F. Smyth, The sum number of the cocktail party graph [ps], Bull. Institute of Combinatorics & Its Applications 22 (1998) 79-90.
  171. W. F. Smyth, Graphs with small generalized chromatic number [dvi | ps], Utilitas Mathematica 53 (1998) 167-177.
  172. W. F. Smyth, Repetitive perhaps, but certainly not boring (preliminary version) [ps], Proc. Ninth Australasian Workshop on Combinatorial Algorithms (AWOCA), School of Computing, Curtin University of Technology (1998) 64-73.
  173. C. S. Iliopoulos & W. F. Smyth, On-line algorithms for k-covering [ps], Proc. Ninth Australasian Workshop on Combinatorial Algorithms (AWOCA), School of Computing, Curtin University of Technology (1998) 97-106.
  174. Frantisek Franek, Ayse Karaman & W. F. Smyth, Repetitions in Sturmian strings (preliminary version) [ps], Proc. Ninth Australasian Workshop on Combinatorial Algorithms (AWOCA), School of Computing, Curtin University of Technology (1998) 107-116.
  175. W. F. Smyth, Approximate periodicity in strings [dvi | ps], Utilitas Mathematica 51 (1997) 125-135.
  176. L. J. Cummings & W. F. Smyth, Weak repetitions in strings [dvi | ps], J. Combinatorial Math. & Combinatorial Computing 24 (1997) 33-48.
  177. C. S. Iliopoulos, Dennis_Moore & W. F. Smyth, A characterization of the squares in a Fibonacci string [dvi | ps], Theoretical Computer Science 172 (1997) 281-291.
  178. Art M. Duval & W. F. Smyth, Covering a circular string with substrings of fixed length [ps], Internat. J. Foundations of Computer Sci. 7-1 (1996) 87-93.
  179. C. S. Iliopoulos, Dennis_Moore & W. F. Smyth, A characterization of the squares in a Fibonacci string (preliminary version) [ps], Proc. Computing: the Australasian Theory Symposium (1996) 57-63.
  180. C. S. Iliopoulos & W. F. Smyth, A fast average case algorithm for Lyndon decomposition [dvi | ps], Internat. J. Computer Math. 57-3/4 (1995) 15-31.
  181. Dennis_Moore & W. F. Smyth, A correction to: An optimal algorithm to compute all the covers of a string [dvi | ps], IPL 54 (1995) 101-103.
  182. Nora Hartsfield & W. F. Smyth, A family of sparse graphs of large sum number [dvi | ps], Discrete Math. 141 (1995) 163-171.
  183. Dennis_Moore & W. F. Smyth, An optimal algorithm to compute all the covers of a string [dvi | ps], IPL 50-5 (1994) 239-246.
  184. Jacqueline W. Daykin, C. S. Iliopoulos & W. F. Smyth, Parallel PRAM algorithms for factorizing words, Theoretical Computer Science 127 (1994) 53-67.
  185. Dennis_Moore & W. F. Smyth, Computing the covers of a string in linear time [ps], Proc. Fifth Annual ACM-SIAM Symp. on Discrete Algs. (1994) 511-515.
  186. P. Eades, X. Lin & W. F. Smyth, A fast and effective heuristic for the feedback arc set problem [dvi | ps], IPL 47-6 (1993) 319-323.
  187. C. S. Iliopoulos & W. F. Smyth, Optimal algorithms for computing the canonical form of a circular string, Theoretical Computer Science 92 (1992) 87-105.
  188. L. Caccetta & W. F. Smyth, Graphs of maximum diameter, Discrete Math. 102 (1992) 121-141.
  189. Nora Hartsfield & W. F. Smyth, The sum number of complete bipartite graphs, in Graphs & Matrices, edited by Rolf Rees (Marcel Dekker, 1992) 205-211.
  190. P. J. Ryan & W. F. Smyth, An approach to asymptotic complexity, Mathematics & Computer Education 26-2 (1992) 135-146.
  191. W. F. Smyth, Mu-balancing M-way search trees, Computer J. 34-5 (1991) 406-414.
  192. K. A. Redish & W. F. Smyth, Closed form expressions for the iterated floor function, Discrete Math. 91 (1991) 317-321.
  193. W. F. Smyth, Sum graphs: new results, new problems, Bull. Institute for Combinatorics & Its Applications 2 (1991) 79-81.
  194. W. F. Smyth, Sum graphs of small sum number, Colloquia Mathematica Societatis János Bolyai 60 (1991) 669-678.
  195. W. F. Smyth, Multiculturalism & racism: cause & effect, Immigration, Population & Sustainable Environments, Joseph Wayne Smith (ed.), Flinders Press (1991) 421-435.
  196. W. F. Smyth, Graph Diameter Problems Related to Network Analysis & Design, Ph.D. thesis, Curtin University (1990) 194 pp.
  197. C. S. Iliopoulos & W. F. Smyth, A comparison of three optimal algorithms for the canonization of circular strings, J. Combinatorics, Information & System Sciences 14-2/3 (1989) 59-72.
  198. C. S. Iliopoulos & W. F. Smyth, PRAM algorithms for identifying polygon similarity, Springer Lecture Notes in Computer Science 401, H. Djidjev (ed.), Springer-Verlag (1989) 25-32.
  199. W. F. Smyth, Sylvester configurations, James Cook Mathematical Notes 5-49 (1989) 5193-5196.
  200. L. Caccetta & W. F. Smyth, Redistribution of vertices for maximum edge count in K-edge-connected D-critical graphs, Ars Combinatoria 26B (1988) 115-132.
  201. L. Caccetta & W. F. Smyth, Diameter-critical graphs with a minimum number of edges, Congressus Numerantium 61 (1988) 143-153.
  202. W. H. Fleming, K. A. Redish & W. F. Smyth, Comparison of manual & automated marking of student programs, Information & Software Technology 30-9 (1988) 547-552.
  203. L. Caccetta & W. F. Smyth, Properties of edge-maximal K-edge-connected D-critical graphs, J. Combinatorial Math. & Combinatorial Computing 2 (1987) 111-131.
  204. L. Caccetta & W. F. Smyth, K-edge-connected D-critical graphs of minimum order, Congressus Numerantium 58 (1987) 225-232.
  205. W. F. Smyth, Sharp bounds on the diameter of a graph, Canadian Math. Bull. 30-1 (1987) 72-74.
  206. K. A. Redish & W. F. Smyth, Evaluating measures of program quality, Computer J. 30-3 (1987) 228-232.
  207. K. A. Redish & W. F. Smyth, Program style analysis: a natural by-product of program compilation, Commun. ACM 29-2 (1986) 126-133.
  208. W. F. Smyth, The construction of large graphs of given maximum degree & diameter, Congressus Numerantium 51 (1986) 277-285.
  209. W. F. Smyth, Sparse random graphs have small diameter, Proc. Fourth Hungarian Comp. Sci. Conf. (1986) 351-358.
  210. W. F. Smyth, Algorithms for the reduction of matrix bandwidth & profile, J. Computational & Applied Math. 12 & 13 (1985) 551-561.
  211. N. W. N. Jayasiri & W. F. Smyth (eds.), Proc. Second National Seminar on Computer Use in Sri Lanka (1981) 132 pp.
  212. A. M. Lount & W. F. Smyth, Stand-alone data manipulation programs, Computers in Industry 2-2 (1981) 97-103.
  213. W. F. Smyth & N. W. N. Jayasiri, The encouragement of effective computer use in developing countries, Proc. IFIP Congress 80 (1980) 885-890.
  214. W. F. Smyth & J. Wallace, Effective Computer Use in Developing Countries, International Labour Organization Publication MAN DEV/19 (1980), 12 pp.
  215. W. F. Smyth, The construction of rational iterating functions, Math. Comput. 32-143 (1978) 811-827.
  216. W. F. Smyth, Programming Workshop: A Management Information System (Statistical Publishing Company, Budapest, 1977) 132 pp. [in Hungarian].
  217. I. Arany & W. F. Smyth, Another algorithm for reducing bandwidth & profile of a sparse matrix, Proc. U.S. National Computer Conf. (1976) 987-994.
  218. W. F. Smyth & E. Râdâceanu, A storage scheme for hierarchic structures, Computer J. 17-2 (1974) 152-156.
  219. W. F. Smyth & W. M. L. Benzi, An algorithm for finding the diameter of a graph, Proc. IFIP Congress 74 (1974) 500-503.
  220. W. F. Smyth & Zs. Esztergár, On statistical databanks, Statisztikai Szemle (1973) 1012-1032 [in Hungarian].
  221. I. Arany, W. F. Smyth & L. Szóda, An improved algorithm for reducing the bandwidth of sparse symmetric matrices, Proc. IFIP Congress 71 (1971) 1246-1250.
  222. A. M. Lount & W. F. Smyth, Computer analysis of underground frames, Proc. Amer. Soc. Civil Engineers (Structural Division) (1966) 93-116.
Over the 20 years 1985-2004 I was a regular contributor to Computing Reviews, from 2009 to 2015 to Mathematical Reviews.
Last revised: Saturday, 21-Sep-2024 13:07:09 EDT