W. F. Smyth -- Refereed Publications

  1. C. S. Iliopoulos, Manal Mohamed & W. F. Smyth, New complexity results for the k-covers problem, Information Sciences (2010) to appear.
  2. Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Jenya Kopylov, W. F. Smyth, German Tischler & Munina Yusufu, A comparison of Lempel-Ziv factorization algorithms, submitted for publication (2009).
  3. Simon J. Puglisi, W. F. Smyth & Munina Yusufu, Fast optimal algorithms for computing all the repeats in a string, Mathematics in Computer Science, Special Issue "Advances in Combinatorial Algorithms II", Manolis Christodoulakis & C. S. Iliopoulos (eds.) (2010) to appear.
  4. Anisa Al-Hafeedh, Laurent Mouchard, Mikael Salson & W. F. Smyth, Updating a Suffix Array for a Sliding Window, submitted for publication (2010).
  5. Pedram Hayati, Vidyasagar Potdar, W. F. Smyth & Alex Talevski, Rule-based spambot detection using action strings, submitted for publication (2010).
  6. Yuqing Lin & Bill Smyth (eds.), J. Combinatorial Mathematics & Combinatorial Computing 71, Special Issue from IWOCA 2007 (2009) 172 pp.
  7. 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.
  8. 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.
  9. 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 & Mohammad Sohel Rahman (eds.) (2009) 295-309.
  10. 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 & Mohammad Sohel Rahman (eds.) (2009) 311-320.
  11. W. F. Smyth & Munina Yusufu, Computing regularities in strings, Proc. Second IEEE International Conference on Computer Science & Information Technology (2009) 298-302.
  12. Mirka Miller & Bill Smyth (eds.), Fundamenta Informaticae 84-1, Special Issue on Combinatorial Algorithms (2008).
  13. Simon J. Puglisi, Jamie Simpson & W. F. Smyth, How many runs can a string contain?, Theoretical Computer Science 401 (2008) 165-171.
  14. Jan Holub, W. F. Smyth & Shu Wang, Fast pattern-matching on indeterminate strings, J. Discrete Algorithms 6-1 (2008) 37-50.
  15. 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.
  16. Manolis Christodoulakis, C. S. Iliopoulos, Mohammad Sohel Rahman & W. F. Smyth, Identifying rhythms in musical texts, Internat. J. Foundations of Computer Sci. 19-1 (2008) 37-52.
  17. Maxime Crochemore, Lucian Ilie & W. F. Smyth, A simple algorithm for computing the Lempel-Ziv factorization, Proc. 18th Data Compression Conference, J. A. Storer & M. W. Marcellin (eds.) (2008) 482-488.
  18. W. F. Smyth & Shu Wang, New perspectives on the prefix array, Proc. 15th String Processing & Information Retrieval Symposium (2008) 133-143.
  19. 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.
  20. 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.
  21. 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.
  22. 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.
  23. Ljiljana Brankovic, Yuqing Lin & Bill Smyth (eds.), Proc. 18th International Workshop on Combinatorial Algorithms, College Publications (2007).
  24. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, A taxonomy of suffix array construction algorithms [ps], ACM Computing Surveys 39-2 (2007) 1-31.
  25. 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.
  26. Frantisek Franek, Christopher G. Jennings & W. F. Smyth, A simple fast hybrid pattern-matching algorithm, J. Discrete Algorithms 5-4 (2007) 682-695.
  27. Frantisek Franek, Jiandong Jiang & W. F. Smyth, Two-pattern strings II -- frequency of occurrence & substring complexity, J. Discrete Algorithms 5-4 (2007) 739-748.
  28. 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 (2007) 307-315.
  29. 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.
  30. Bill Smyth, The maximum number of runs in a string [pdf], 18th International Workshop on Combinatorial Algorithms (2007) Problem 7 in Problems Sessions.
  31. Bill Smyth, Computing Patterns in Strings (Russian translation), Williams Publishing House, Kiev (2006) 486 pp.
  32. Kangmin Fan, Simon J. Puglisi, W. F. Smyth & Andrew Turpin, A new periodicity lemma [pdf], SIAM J. Discrete Mathematics 20-3 (2006) 656-668.
  33. Frantisek Franek & W. F. Smyth, Reconstructing a suffix array, Internat. J. Foundations of Computer Sci. 17-6 (2006) 1281-1295.
  34. 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.
  35. Jan Holub, W. F. Smyth & Shu Wang, Hybrid pattern-matching algorithms on indeterminate strings, London Algorithmics and Stringology 2006, J. Daykin, M. Mohamed & K. Steinhoefel (eds.), King's College London Series Texts in Algorithmics (2006) 115-133.
  36. 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 (2006) 122-133.
  37. Mohammad 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.
  38. Manolis Christodoulakis, C. S. Iliopoulos, Mohammad Sohel Rahman & W. F. Smyth, Song classifications for dancing, Proc. Prague Stringology Conference '06 (2006) 41-48.
  39. 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.
  40. Richard Cole, C. S. Iliopoulos, Manal Mohamed, W. F. Smyth & Lu Yang, The complexity of the minimum k-cover problem [ps], J. Automata, Languages & Combinatorics 10-5/6 (2005) 641-653.
  41. Frantisek Franek & W. F. Smyth, Sorting suffixes of two-pattern strings, Internat. J. Foundations of Computer Sci. 16-6 (2005) 1135-1144.
  42. W. F. Smyth, Computing periodicities in strings -- a new approach (invited paper) [pdf], Proc. 16th Australasian Workshop on Combinatorial Algorithms (2005) 481-488.
  43. Simon J. Puglisi, W. F. Smyth & Andrew Turpin, Some restrictions on periodicity in strings [ps], Proc. 16th Australasian Workshop on Combinatorial Algorithms (2005) 263-268.
  44. Jan Holub, W. F. Smyth & Shu Wang, Fast pattern-matching on indeterminate strings (preliminary version) [pdf], Proc. 16th Australasian Workshop on Combinatorial Algorithms (2005) 415-428.
  45. 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.
  46. Frantisek Franek & W. F. Smyth, Reconstructing a suffix array (preliminary version), Proc. Prague Stringology Conference '05 (2005) 54-68.
  47. Kangmin Fan, W. F. Smyth & R. J. Simpson, A new periodicity lemma (preliminary version) [ps], Proc. 16th Annual Symposium on Combinatorial Pattern Matching, LNCS 3537, Springer-Verlag (2005) 257-265.
  48. Frantisek Franek, Christopher G. Jennings & W. F. Smyth, A simple fast hybrid pattern-matching algorithm (preliminary version) [ps], Proc. 16th Annual Symposium on Combinatorial Pattern Matching, LNCS 3537, Springer-Verlag (2005) 288-297.
  49. 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.
  50. C. S. Iliopoulos, Manal Mohamed & W. F. Smyth, New complexity results for the k-covers problem (preliminary version) [ps], Proc. 15th Australasian Workshop on Combinatorial Algorithms, Seok-Hee Hong (ed.) (2004) 141-147.
  51. Antonitio, P. J. Ryan, W. F. Smyth, Andrew Turpin & Xiaoyang Yu, New suffix array algorithms -- linear but not fast? [ps], Proc. 15th Australasian Workshop on Combinatorial Algorithms, Seok-Hee Hong (ed.) (2004) 148-156.
  52. Frantisek Franek & W. F. Smyth, Sorting suffixes of two-pattern strings (preliminary version), Proc. Prague Stringology Conference '04 (2004) 69-78.
  53. W. F. Smyth, Computing Patterns in Strings, Pearson Addison Wesley (UK) (2003) 423 pp.
  54. W. F. Smyth (ed.), Fundamenta Informaticae 56-1/2, Special Issue on Computing Patterns in Strings (June/July 2003).
  55. Frantisek Franek, Weilin Lu & W. F. Smyth, Two-pattern strings I -- a recognition algorithm [ps], J. Discrete Algorithms 1-5/6 (2003) 445-460.
  56. Frantisek Franek, W. F. Smyth & Xiangdong Xiao, A note on Crochemore's repetitions algorithm -- a fast space-efficient approach [ps], Nordic J. Computing 10-1 (2003) 21-28.
  57. C. S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina G. Perdikuri, W. F. Smyth & Athanasios K. Tsakalidis, String regularities with don't cares [ps], Nordic J. Computing 10-1 (2003) 40-51.
  58. Frantisek Franek, W. F. Smyth & Yudong Tang, Computing all repeats using suffix arrays [ps], J. Automata, Languages & Combinatorics 8-4 (2003) 579-591.
  59. Frantisek Franek, Jan Holub, W. F. Smyth & Xiangdong Xiao, Computing quasi suffix arrays [ps], J. Automata, Languages & Combinatorics 8-4 (2003) 593-606.
  60. Frantisek Franek, R. J. Simpson & W. F. Smyth, The maximum number of runs in a string [ps], Proc. 14th Australasian Workshop on Combinatorial Algorithms, Mirka Miller & Kunsoo Park (eds.) (2003) 26-35.
  61. Jan Holub & W. F. Smyth, Algorithms on indeterminate strings [ps], Proc. 14th Australasian Workshop on Combinatorial Algorithms, Mirka Miller & Kunsoo Park (eds.) (2003) 36-45.
  62. Mirka Miller, Joseph Ryan & W. F. Smyth, The sum number of a disjoint union of graphs [ps], Proc. 14th Australasian Workshop on Combinatorial Algorithms, Mirka Miller & Kunsoo Park (eds.) (2003) 120-124.
  63. Richard Cole, C. S. Iliopoulos, Manal Mohamed, W. F. Smyth & Lu Yang, Computing the minimum k-cover of a string [ps], Proc. Prague Stringology Conference '03 (2003) 51-62.
  64. W. F. Smyth, C. P. Lam, Xin Chen & Valerie Maxville, Heuristics for image retrieval using spatial configurations [ps], Proc. Digital Image Computing -- Techniques & Applications (2003) 909-918.
  65. C. S. Iliopoulos, Mirka Miller & W. F. Smyth (eds.), Internat. J. Computer Math. 79-12, Special Issue on Combinatorial Algorithms (2002).
  66. Yin Li & W. F. Smyth, An optimal on-line algorithm to compute all the covers of a string [ps], Algorithmica 32-1 (2002) 95-106.
  67. Frantisek Franek, Shudi Gao, Weilin Lu, P. J. Ryan, W. F. Smyth, Yu Sun & Lu Yang, Verifying a border array in linear time [ps], J. Combinatorial Math. & Combinatorial Computing 42 (2002) 223-236.
  68. 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.), LNCS 2373, Springer-Verlag (2002) 76-84.
  69. 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.
  70. 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.
  71. 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.
  72. 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.
  73. 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.
  74. Jeong Seop Sim, C. S. Iliopoulos, Kunsoo Park & W. F. Smyth, Approximate periods of strings [ps], Theoretical Computer Science 262 (2001) 557-568.
  75. 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.
  76. W. F. Smyth, Repetitive perhaps, but certainly not boring, Theoretical Computer Science 249-2 (2000) 343-355.
  77. Frantisek Franek, Ayse Karaman & W. F. Smyth, Repetitions in Sturmian strings, Theoretical Computer Science 249-2 (2000) 289-303.
  78. Dennis Moore, W. F. Smyth & Dianne Miller, Counting distinct strings [dvi | ps], Algorithmica 23-1 (1999) 1-13.
  79. Jeong Seop Sim, C. S. Iliopoulos, Kunsoo Park & 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.
  80. 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.
  81. 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.
  82. Mirka Miller, Joseph Ryan, Slamin & W. F. Smyth, Labelling wheels for minimum sum number [dvi | ps], J. Combinatorial Math. & Combinatorial Computing 28 (1998) 289-297.
  83. Mirka Miller, Joseph Ryan & W. F. Smyth, The sum number of the cocktail party graph [ps], Bull. Institute of Combinatorics & Its Applications 22 (1998) 79-90.
  84. W. F. Smyth, Graphs with small generalized chromatic number [dvi | ps], Utilitas Mathematica 53 (1998) 167-177.
  85. 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.
  86. 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.
  87. 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.
  88. W. F. Smyth, Approximate periodicity in strings [dvi | ps], Utilitas Mathematica 51 (1997) 125-135.
  89. L. J. Cummings & W. F. Smyth, Weak repetitions in strings [dvi | ps], J. Combinatorial Math. & Combinatorial Computing 24 (1997) 33-48.
  90. 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.
  91. 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.
  92. 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.
  93. 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.
  94. 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.
  95. Nora Hartsfield & W. F. Smyth, A family of sparse graphs of large sum number [dvi | ps], Discrete Math. 141 (1995) 163-171.
  96. Dennis Moore & W. F. Smyth, An optimal algorithm to compute all the covers of a string [dvi | ps], IPL 50-5 (1994) 239-246.
  97. J. W. Daykin, C. S. Iliopoulos & W. F. Smyth, Parallel PRAM algorithms for factorizing words, Theoretical Computer Science 127 (1994) 53-67.
  98. 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.
  99. 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.
  100. C. S. Iliopoulos & W. F. Smyth, Optimal algorithms for computing the canonical form of a circular string, Theoretical Computer Science 92 (1992) 87-105.
  101. L. Caccetta & W. F. Smyth, Graphs of maximum diameter, Discrete Math. 102 (1992) 121-141.
  102. Nora Hartsfield & W. F. Smyth, The sum number of complete bipartite graphs, in Graphs & Matrices, edited by Rolf Rees (Marcel Dekker, 1992) 205-211.
  103. P. J. Ryan & W. F. Smyth, An approach to asymptotic complexity, Math. & Computer Education 26-2 (1992) 135-146.
  104. W. F. Smyth, Mu-balancing M-way search trees, Computer J. 34-5 (1991) 406-414.
  105. K. A. Redish & W. F. Smyth, Closed form expressions for the iterated floor function, Discrete Math. 91 (1991) 317-321.
  106. W. F. Smyth, Sum graphs: new results, new problems [dvi | ps], Bull. Institute for Combinatorics & Its Applications 2 (1991) 79-81.
  107. W. F. Smyth, Sum graphs of small sum number [dvi | ps], Colloquia Mathematica Societatis János Bolyai 60 (1991) 669-678.
  108. W. F. Smyth, Multiculturalism & racism: cause & effect, Immigration, Population & Sustainable Environments, Joseph Wayne Smith (ed.), Flinders Press (1991) 421-435.
  109. 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.
  110. C. S. Iliopoulos & W. F. Smyth, PRAM algorithms for identifying polygon similarity, Lecture Notes in Computer Science 401, H. Djidjev (ed.), Springer-Verlag (1989) 25-32.
  111. W. F. Smyth, Sylvester configurations, James Cook Mathematical Notes 5-49 (1989) 5193-5196.
  112. 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.
  113. L. Caccetta & W. F. Smyth, Diameter-critical graphs with a minimum number of edges, Congressus Numerantium 61 (1988) 143-153.
  114. W. H. Fleming, K. A. Redish & W. F. Smyth, A comparison of manual & automated marking of student programs, Information & Software Technology 30-9 (1988) 547-552.
  115. L. Caccetta & W. F. Smyth, Properties of edge-maximal K-edge-connected D-critical graphs, J. Combinatorial Math. & Combinatorial Computing 2 (1987) 111-131.
  116. L. Caccetta & W. F. Smyth, K-edge-connected D-critical graphs of minimum order, Congressus Numerantium 58 (1987) 225-232.
  117. W. F. Smyth, Sharp bounds on the diameter of a graph, Canadian Math. Bull. 30-1 (1987) 72-74.
  118. K. A. Redish & W. F. Smyth, Evaluating measures of program quality, Computer J. 30-3 (1987) 228-232.
  119. K. A. Redish & W. F. Smyth, Program style analysis: a natural by-product of program compilation, Commun. ACM 29-2 (1986) 126-133.
  120. W. F. Smyth, The construction of large graphs of given maximum degree & diameter, Congressus Numerantium 51 (1986) 277-285.
  121. W. F. Smyth, Sparse random graphs have small diameter, Proc. Fourth Hungarian Comp. Sci. Conf. (1986) 351-358.
  122. W. F. Smyth, Algorithms for the reduction of matrix bandwidth & profile, J. Computational & Applied Math. 12 & 13 (1985) 551-561.
  123. N. W. N. Jayasiri & W. F. Smyth (eds.), Proc. Second National Seminar on Computer Use in Sri Lanka (1981) 132 pp.
  124. A. M. Lount & W. F. Smyth, Stand-alone data manipulation programs, Computers in Industry 2-2 (1981) 97-103.
  125. W. F. Smyth & N. W. N. Jayasiri, The encouragement of effective computer use in developing countries, Proc. IFIP Congress 80 (1980) 885-890.
  126. W. F. Smyth & J. Wallace, Effective Computer Use in Developing Countries, International Labour Organization Publication MAN DEV/19 (1980), 12 pp.
  127. W. F. Smyth, The construction of rational iterating functions, Math. Comput. 32-143 (1978) 811-827.
  128. W. F. Smyth, Programming Workshop: A Management Information System (Statistical Publishing Company, Budapest, 1977) 132 pp. [in Hungarian].
  129. I. Arany & W. F. Smyth, Another algorithm for reducing bandwidth & profile of a sparse matrix, Proc. U.S. National Computer Conf. (1976) 987-994.
  130. W. F. Smyth & E. Râdâceanu, A storage scheme for hierarchic structures, Computer J. 17-2 (1974) 152-156.
  131. W. F. Smyth & W. M. L. Benzi, An algorithm for finding the diameter of a graph, Proc. IFIP Congress 74 (1974) 500-503.
  132. W. F. Smyth & Zs. Esztergár, On statistical databanks, Statisztikai Szemle (1973) 1012-1032 [in Hungarian].
  133. 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.
  134. 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. I am currently a contributor to Mathematical Reviews.
Last revised: Tuesday, 26-Jan-2010 12:12:18 EST