Publications: Smyth, William

Journal Article

Daykin, J.W., Mhaskar, N. and Smyth, W.F. (2021) Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order. Theoretical Computer Science, 880 . pp. 82-96.

Louza, F.A., Mhaskar, N. and Smyth, W.F. (2021) A new approach to regular & indeterminate strings. Theoretical Computer Science, 854 . pp. 105-115.

Glen, A.ORCID: 0000-0002-9434-3412, Simpson, J. and Smyth, W.F. (2019) More properties of the Fibonacci word on an infinite alphabet. Theoretical Computer Science, 795 . pp. 301-311.

Glen, A.ORCID: 0000-0002-9434-3412, Simpson, J. and Smyth, W.F. (2019) Palindromes in starlike trees. Australasian Journal of Combinatorics, 73 (1). pp. 242-246.

Alatabbi, A., Daykin, J.W., Mhaskar, N., Rahman, M.S. and Smyth, W.F. (2018) Applications of V-Order: Suffix arrays, the Burrows-Wheeler transform & the FM-index. Lecture Notes in Computer Science, 11355 . pp. 329-338.

Mhaskar, N., Smyth, W.F., Charalampopoulos, P., Crochemore, M. and Pissis, S.P. (2018) Frequency covers for strings. Fundamenta Informaticae, 163 (3). pp. 275-289.

Louza, F.A., Smyth, W.F., Manzini, G. and Telles, G.P. (2018) Lyndon Array construction during Burrows-Wheeler inversion. Journal of Discrete Algorithms, 50 . pp. 2-9.

Alzamel, M., Iliopoulos, C.S., Smyth, W.F. and Sung, W-K (2018) Off-line and on-line algorithms for closed string factorization. Theoretical Computer Science, 792 . pp. 12-19.

Mhaskar, N. and Smyth, W.F. (2018) String covering with optimal covers. Journal of Discrete Algorithms, 51 . pp. 26-38.

Helling, J., Ryan, P.J., Smyth, W.F. and Soltys, M. (2017) Constructing an indeterminate string from its associated graph. Theoretical Computer Science, 710 . pp. 88-96.

Glen, A.ORCID: 0000-0002-9434-3412, Simpson, J. and Smyth, W.F. (2017) Counting Lyndon factors. Electronic Journal of Combinatorics, 24 (3).

Daykin, J.W., Franěk, F., Holub, J., Islam, A.S.M.S. and Smyth, W.F. (2017) Reconstructing a string from its Lyndon arrays. Theoretical Computer Science, 710 . pp. 44-51.

Franěk, F., Smyth, W.F. and Wang, X. (2017) The role of the prefix array in sequence analysis: A survey. AIMS Medical Science, 4 (3). pp. 261-273.

Alatabbi, A., Daykin, J.W., Kärkkäinen, J., Sohel Rahman, M. and Smyth, W.F. (2016) V-Order: New combinatorial properties & a simple comparison algorithm. Discrete Applied Mathematics, 215 . pp. 41-46.

Bai, H., Franěk, F. and Smyth, W.F. (2016) The new periodicity lemma revisited. Discrete Applied Mathematics, 212 . pp. 30-36.

Beal, R., Adjeroh, D.A. and Smyth, W.F. (2016) A prefix array for parameterized strings. Journal of Discrete Algorithms, 42 . pp. 23-34.

Alatabbi, A., Sohel Rahman, M. and Smyth, W.F. (2015) Computing covers using prefix tables. Discrete Applied Mathematics, 212 . pp. 2-9.

Christodoulakis, M., Ryan, P.J., Smyth, W.F. and Wang, S. (2015) Indeterminate strings, prefix arrays & undirected graphs. Theoretical Computer Science, 600 . pp. 34-48.

Bharati, R. and Smyth, W.F. (ED) (2015) Part Special Issue: International Conference on Mathematics in Engineering and Business Management, 9–10 March 2012, Chennai, India. Journal of Discrete Algorithms, 33 . pp. 1-202.

Smyth, B. (2015) Perspectives: Journal of discrete algorithms special String Masters issue (editorial). Journal of Discrete Algorithms, 32 . pp. 3-5.

Alatabbi, A., Daykin, J.W., Rahman, M.S. and Smyth, W.F. (2015) Simple Linear Comparison of Strings in V-order*. Fundamenta Informaticae, 139 (2). pp. 115-126.

Bland, W. and Smyth, W.F. (2015) Three overlapping squares: The general case characterized & applications. Theoretical Computer Science, 596 . pp. 23-40.

Fici, G., Lecroq, T., Lefebvre, A., Prieur-Gaston, É. and Smyth, W.F. (2015) A note on easy and efficient computation of full abelian periods of a word. Discrete Applied Mathematics, 212 . pp. 88-95.

Alatabbi, A., Sohel Rahman, M. and Smyth, W.F. (2014) Inferring an indeterminate string from a prefix graph. Journal of Discrete Algorithms, 32 . pp. 6-13.

Daykin, J.W. and Smyth, W.F. (2014) A bijective variant of the Burrows–Wheeler Transform using V-order. Theoretical Computer Science, 531 . pp. 77-89.

Arumugam, S. and Smyth, W.F. (ED) (2013) 23rd International Workshop on Combinatorial Algorithms (IWOCA 2012). Journal of Discrete Algorithms, 23 . pp. 1-164.

Ilie, L., Mohamadi, H., Golding, G.B. and Smyth, W.F. (2013) BOND: Basic OligoNucleotide Design. BMC Bioinformatics, 14 (1).

Smyth, W.F. (2013) Computing regularities in strings: A survey. European Journal of Combinatorics, 34 (1). pp. 3-14.

Flouri, T., Iliopoulos, C.S., Kociumaka, T., Pissis, S.P., Puglisi, S.J., Smyth, W.F. and Tyczyński, W. (2013) Enhanced string covering. Theoretical Computer Science, 506 . pp. 102-114.

Daykin, D.E., Daykin, J.W., Iliopoulos, C.S. and Smyth, W.F. (2013) Generic algorithms for factoring strings. Lecture Notes in Computer Science, 7777 . pp. 402-418.

Bland, W., Kucherov, G. and Smyth, W.F. (2013) Prefix table construction and conversion. Lecture Notes in Computer Science, 8288 . pp. 41-53.

Daykin, D.E., Daykin, J.W. and Smyth, W.F. (2013) A linear partitioning algorithm for Hybrid Lyndons using -order. Theoretical Computer Science, 483 . pp. 149-161.

Iliopoulos, C.S. and Smyth, W.F. (2012) Selected papers from the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010). Journal of Discrete Algorithms, 14 .

Iliopoulos, C.S. and Smyth, W.F. (ED) (2012) Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011). Journal of Discrete Algorithms, 16 .

Daykin, J.W., Smyth, B. and van Zijl, L. (2012) StringMasters 2009 & 2010 Special Issue. Journal of Discrete Algorithms, 10 .

Al-Hafeedh, A., Crochemore, M., Ilie, L., Kopylova, E., Smyth, W.F., Tischler, G. and Yusufu, M. (2012) A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Computing Surveys, 45 (1). pp. 1-17.

Smyth, W.F. (2011) Report on IWOCA 2011. Bulletin of the European Association for Theoretical Computer Science (105). pp. 244-247.

Puglisi, S.J., Smyth, W.F. and Yusufu, M. (2010) Fast, practical algorithms for computing all the repeats in a string. Mathematics in Computer Science, 3 (4). pp. 373-389.

Smyth, W.F. (2010) Report on IWOCA 2010. Bulletin of the European Association for Theoretical Computer Science (102). pp. 233-235.

Daykin, D.E., Daykin, J.W. and Smyth, W.F. (2009) Combinatorics of unique maximal factorization families (UMFFs). Fundamenta Informaticae, 97 (3). pp. 295-309.

Ilopoulos, C.S., Smyth, W.F. and Yusufu, M. (2009) Faster algorithms for computing maximal multirepeats in multiple sequences. Fundamenta Informaticae, 97 (3). pp. 311-320.

Smyth, W.F. and Wang, S. (2009) New perspectives on the prefix array. Lecture Notes in Computer Science, 5280 . pp. 133-143.

Smyth, W.F. and Wang, S. (2009) An adaptive hybrid pattern-matching algorithm on indeterminate strings. International Journal of Foundations of Computer Science, 20 (6). pp. 985-1004.

Smyth, W.F. and Wang, Shu (2009) A new approach to the periodicity lemma on strings with holes. Theoretical Computer Science, 410 (43). pp. 4295-4302.

Holub, J., Smyth, W.F. and Wang, S. (2008) Fast pattern-matching on indeterminate strings. Journal of Discrete Algorithms, 6 (1). pp. 37-50.

Puglisi, S.J., Simpson, J. and Smyth, W.F. (2008) How many runs can a string contain? Theoretical Computer Science, 401 (1-3). pp. 165-171.

Christodoulakis, M., Iliopoulos, C.S., Rahman, M.S. and Smyth, W.F. (2008) Identifying rhythms in musical texts. International Journal of Foundations of Computer Science, 19 (1). pp. 37-51.

Chen, G., Puglisi, S.J. and Smyth, W.F. (2008) Lempel–Ziv factorization using less time & space. Mathematics in Computer Science, 1 (4). pp. 605-623.

Smyth, W.F. (2008) Report on CPM 2007. Bulletin of the European Association for Theoretical Computer Science, 94 . pp. 235-237.

Smyth, W.F. (2008) Report on IWOCA 2007. Bulletin of the European Association for Theoretical Computer Science, 94 . pp. 240-242.

Christodoulakis, M., Golding, G.B., Iliopoulos, C.S., Ardila, Y.J.P. and Smyth, W.F. (2007) Efficient algorithms for counting and reporting segregating sites in genomic sequences. Journal of Computational Biology, 14 (7). pp. 1001-1010.

Chen, G., Puglisi, S.J. and Smyth, W.F. (2007) Fast and practical algorithms for computing all the runs in a string. Lecture Notes in Computer Science, 4580 . pp. 307-315.

Franěk, F., Jiang, J. and Smyth, W.F. (2007) Two-pattern strings II—frequency of occurrence and substring complexity. Journal of Discrete Algorithms, 5 (4). pp. 739-748.

Franěk, F., Jennings, C.G. and Smyth, W.F. (2007) A simple fast hybrid pattern-matching algorithm. Journal of Discrete Algorithms, 5 (4). pp. 682-695.

Puglisi, S.J., Smyth, W.F. and Turpin, A.H. (2007) A taxonomy of suffix array construction algorithms. ACM Computing Surveys, 39 (2).

Rahman, M.S., Iliopoulos, C.S., Lee, I., Mohamed, M. and Smyth, W.F. (2006) Finding patterns with variable length gaps or don’t cares. Lecture Notes in Computer Science, 4112 . pp. 146-155.

Puglisi, S.J., Smyth, W.F. and Turpin, A. (2006) Inverted files versus suffix arrays for locating patterns in primary memory. Lecture Notes in Computer Science, 4209 . pp. 122-133.

Fan, K., Puglisi, S.J., Smyth, W.F. and Turpin, A. (2006) A New Periodicity Lemma. SIAM Journal on Discrete Mathematics, 20 (3). pp. 656-668.

Koh, K.M., Miller, M., Smyth, W.F. and Wang, Y. (2006) On optimal summable graphs. AKCE International Journal of Graphs and Combinatorics, 3 (1). pp. 45-57.

Franěk, F. and Smyth, W.F. (2006) Reconstructing a suffix array. International Journal of Foundations of Computer Science, 17 (06). pp. 1281-1295.

Franěk, F. and Smyth, W.F. (2005) Sorting suffixes of two-pattern strings. International Journal of Foundations of Computer Science, 16 (6). pp. 1135-1144.

Cole, R., Ilopoulos, C.S., Mohamed, M., Smyth, W.F. and Yang, L. (2005) The complexity of the minimum k-Cover Problem. Journal of Automata, Languages and Combinatorics, 10 (5-6). pp. 641-653.

Fan, K., Smyth, W.F. and Simpson, R.J. (2005) A new periodicity lemma. Lecture Notes in Computer Science, 3537 . pp. 257-265.

Franěk, F., Jennings, C.G. and Smyth, W.F. (2005) A simple fast hybrid pattern-matching algorithm. Lecture Notes in Computer Science, 3537 . pp. 288-297.

Franěk, F., Smyth, W.F. and Tang, Y. (2003) Computing all repeats using suffix arrays. Journal of Automata, Languages and Combinatorics, 8 (4). pp. 579-591.

Franěk, F., Smyth, W.F. and Xiao, X. (2003) Computing quasi suffix arrays. Journal of Automata, Languages and Combinatorics, 8 (4). pp. 593-606.

Ilopoulos, C.S., Mohamed, M., Mouchard, L., Smyth, W.F., Perdikuri, K.G. and Tsakalidis, A.K. (2003) String regularities with don't cares. Nordic Journal of Computing, 10 (1). pp. 40-51.

Franěk, F., Lu, W. and Smyth, W.F. (2003) Two-pattern strings I—A recognition algorithm. Journal of Discrete Algorithms, 1 (5-6). pp. 445-460.

Li, Y. and Smyth, W.F. (2002) Computing the cover array in linear time. Algorithmica, 32 (1). pp. 95-106.

Franěk, F., Jiang, J., Lu, W. and Smyth, W.F. (2002) Two-Pattern strings. Lecture Notes in Computer Science, 2373 . pp. 76-84.

Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y. and Yang, L. (2002) Verifying a border array in linear time. Journal of Combinatorial Mathematics and Combinatorial Computing, 42 . pp. 223-236.

Sim, J.S., Iliopoulos, C.S., Park, K. and Smyth, W.F. (2001) Approximate periods of strings. Theoretical Computer Science, 262 (1-2). pp. 557-568.

Franěk, F., Karaman, A. and Smyth, W.F. (2000) Repetitions in Sturmian strings. Theoretical Computer Science, 249 (2). pp. 289-303.

Smyth, W.F. (2000) Repetitive perhaps, but certainly not boring. Theoretical Computer Science, 249 (2). pp. 343-355.

Sim, J.S., Park, K., Iliopoulos, C.S. and Smyth, W.F. (1999) Approximate Periods of Strings. Lecture Notes in Computer Science, 1645 . pp. 123-133.

Moore, D., Smyth, W.F. and Miller, D. (1999) Counting distinct strings. Algorithmica, 23 (1). pp. 1-13.

Smyth, W.F. (1998) Graphs with small generalized chromatic number. Utilitas Mathematica, 53 . pp. 167-177.

Miller, M., Ryan, J., SLAMIN, . and Smyth, W.F. (1998) Labelling wheels for minimum sum number. Journal of Combinatorial Mathematics and Combinatorial Computing, 28 . pp. 289-297.

Iliopoulos, C.S., Moore, D. and Smyth, W.F. (1998) The covers of a circular Fibonacci string. Journal of Combinatorial Mathematics and Combinatorial Computing, 26 . pp. 227-236.

Miller, M., Ryan, J.F. and Smyth, W.F. (1998) The sum number of the cocktail party graph. Bulletin of the Institute of Combinatorics and its Applications, 22 . pp. 79-90.

Smyth, W.F. (1997) Approximate periodicity in strings. Utilitas Mathematica, 51 . pp. 125-135.

Cummings, L.J. and Smyth, W.F. (1997) Weak repetitions in strings. Journal of Combinatorial Mathematics and Combinatorial Computing, 24 . pp. 33-48.

Iliopoulos, C.S., Moore, D. and Smyth, W.F. (1997) A characterization of the squares in a Fibonacci string. Theoretical Computer Science, 172 (1-2). pp. 281-291.

Duval, A.M. and Smyth, W.F. (1996) Covering a circular string with substrings of fixed length. International Journal of Foundations of Computer Science, 7 (1). pp. 87-93.

Moore, D. and Smyth, W.F. (1995) A correction to “An optimal algorithm to compute all the covers of a string”. Information Processing Letters, 54 (2). pp. 101-103.

Hartsfield, N. and Smyth, W.F. (1995) A family of sparse graphs of large sum number. Discrete Mathematics, 141 (1-3). pp. 163-171.

Iliopoulos, C.S. and Smyth, W.F. (1995) A fast average case algorithm for lyndon decomposition. International Journal of Computer Mathematics, 57 (1-2). pp. 15-31.

Daykin, J.W., Iliopoulos, C.S. and Smyth, W.F. (1994) Parallel RAM algorithms for factorizing words. Theoretical Computer Science, 127 (1). pp. 53-67.

Moore, D. and Smyth, W.F. (1994) An optimal algorithm to compute all the covers of a string. Information Processing Letters, 50 (5). pp. 239-246.

Eades, P., Lin, X. and Smyth, W.F. (1993) A fast and effective heuristic for the feedback arc set problem. Information Processing Letters, 47 (6). pp. 319-323.

Caccetta, L. and Smyth, W.F. (1992) Graphs of maximum diameter. Discrete Mathematics, 102 (2). pp. 121-141.

Iliopoulos, C.S. and Smyth, W.F. (1992) Optimal algorithms for computing the canonical form of a circular string. Theoretical Computer Science, 92 (1). pp. 87-105.

Ryan, P.J. and Smyth, W.F. (1992) An approach to asymptotic complexity. Mathematics and Computer Education, 26 (2). pp. 135-146.

Redish, K.A. and Smyth, W.F. (1991) Closed form expressions for the iterated floor function. Discrete Mathematics, 91 (3). pp. 317-321.

Smyth, W.F. (1991) Mu-balancing M-way Search Trees. The Computer Journal, 34 (5). pp. 406-414.

Hartsfield, N. and Smyth, W.F. (1991) Problems & conjectures on sum graphs. Bulletin of the Institute of Combinatorics and its Applications, 2 . pp. 79-81.

Smyth, W.F. (1991) Sum graphs of small sum number. Colloquia mathematica Societatis János Bolyai, 60 . pp. 669-678.

Iliopoulos, C.S. and Smyth, W.F. (1989) PRAM algorithms for identifying polygon similarity. Lecture Notes in Computer Science, 401 . pp. 25-32.

Iliopoulos, C.S. and Smyth, W.F. (1989) A comparison of three optimal algorithms for the canonization of circular strings. Journal of Combinatorics, Information & System Sciences, 14 (2/3). pp. 59-72.

Fleming, W.H., Redish, K.A. and Smyth, W.F. (1988) Comparison of manual and automated marking of student programs. Information and Software Technology, 30 (9). pp. 547-552.

Caccetta, L. and Smyth, W.F. (1988) Diameter-critical graphs with a minimum number of edges. Congressus Numerantium, 61 . pp. 143-153.

Caccetta, L. and Smyth, W.F. (1988) Redistribution of vertices for maximum edge count in K-edge-connected D-critical graphs. Ars Combinatoria: A Canadian Journal of Combinatorics, 26B . pp. 115-132.

Redish, K. A. and Smyth, W.F. (1987) Evaluating measure of program quality. The Computer Journal, 30 (3). pp. 228-232.

Caccetta, L. and Smyth, W.F. (1987) K-edge-connected D-critical graphs of minimum order. Congressus Numerantium, 58 . pp. 225-232.

Caccetta, L. and Smyth, W.F. (1987) Properties of edge-maximal K-edge-connected D-critical graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 2 . pp. 111-131.

Smyth, W.F. (1987) Sharp bounds on the diameter of a graph. Canadian Mathematical Bulletin, 30 (1). pp. 72-74.

Redish, K.A. and Smyth, W.F. (1986) Program style analysis: A natural by-product of program compilation. Communications of the ACM, 29 (2). pp. 126-133.

Smyth, W.F. (1986) The construction of large graphs of given maximum degree and diameter. Congressus Numerantium, 51 . pp. 277-285.

Smyth, W.F. (1985) Algorithms for the reduction of matrix bandwidth and profile. Journal of Computational and Applied Mathematics, 12-13 . pp. 551-561.

Lount, A.M. and Smyth, W.F. (1981) Stand-alone data manipulation programs. Computers in Industry, 2 (2). pp. 97-103.

Smyth, W.F. (1978) The construction of rational iterating functions. Mathematics of Computation, 32 (143). p. 811.

Smyth, W. (1974) A storage scheme for hierarchic structures. The Computer Journal, 17 (2). pp. 152-156.

Smyth, W.F. and Esztergár, Z. (1972) On statistical databanks. Statisztikai Szemle, 50 (10). pp. 1012-1032.

Lount, A.M. and Smyth, W.F. (1966) Computer analysis of underground frames. Proceedings. American Society of Civil Engineers (Structural Division), 92 (6). pp. 93-116.

Conference Paper

Franěk, F., Liut, M. and Smyth, W.F. (2018) On baier's sort of maximal Lyndon substrings. In: Prague Stringology Conference (PSC) 2018, 27 - 28 August 2018, Czech Technical University, Prague

Franěk, F., Sohidull Islam, A.S.M., Rahman, M.S. and Smyth, W.F. (2016) Algorithms to compute the lyndon array. In: Prague Stringology Conference (PSC) 2016, 29 - 31 August 2016, Prague, Czech Republic

Crochemore, M., Mouchard, L., Salson, M. and Smyth, W.F. (2010) Efficient dynamic range minimum query. In: 9th International Stringology Conference, 2010, Tel Aviv, Israel

Ridzuan, F., Potdar, V., Talevski, A. and Smyth, W.F. (2010) Key parameters in identifying cost of spam 2.0. In: 24th IEEE International Conference on Advanced Information Networking and Applications (AINA 2010), 20 - 23 April 2010, Perth, W.A

Hayati, P., Potdar, V., Talevski, A. and Smyth, W.F. (2010) Rule-based On-the-fly web spambot detection using action strings. In: 7th Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference (CEAS 2010), 13 - 14 July 2010, Washington DC, U.S.A

Smyth, W.F. and Yusufu, M. (2009) Computing regularities in strings. In: 2nd IEEE International Conference Computer Science and Information Technology (ICCSIT 2009), 8 - 11 Aug 2009, Beijing, China pp. 298-302.

Puglisi, S.J., Smyth, W.F. and Yusufu, M. (2008) Fast optimal algorithms for computing all the repeats in a string. In: Prague Stringology Conference 2008, 1 - 3 September 2008, Czech Technical University, Prague

Smyth, W.F., Wang, S. and Yu, M. (2008) An adaptive hybrid pattern-matching algorithm on indeterminate strings. In: Prague Stringology Conference 2008, 1 - 3 September 2008, Czech Technical University, Prague

Crochemore, M., Ilie, L. and Smyth, W.F. (2008) A simple algorithm for computing the lempel ziv factorization. In: Data Compression Conference (DCC 2008), 25 - 27 March 2008, Snowbird, Utah, USA

Basit, H.A., Puglisi, S.J., Smyth, W.F., Turpin, A. and Jarzabek, S. (2007) Efficient token based clone detection with flexible tokenization. In: 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium 2007, 3 - 7 September 2007, Dubrovnik, Croatia p. 513.

Christodoulakis, M., Ilopoulos, C.S., Rahman, M.S. and Smyth, W.F. (2006) Song classifications for dancing. In: Prague Stringology Conference 2006, 28 - 30 August 2006, Czech Technical University, Prague

Puglisi, S.J., Smyth, W.F. and Turpin, A. (2006) Suffix arrays: what are they good for? In: 17th Australasian Database Conference, 16 - 19 January 2006, Hobart, Tasmania

Smyth, W.F. (2005) Computing periodicities in strings: A new approach. In: 16th Australasian Workshop on Combinatorial Algorithms (AWOCA) 2005, 18 - 21 September 2005, Ballarat, VIC

Holub, J., Smyth, W.F. and Wang, S. (2005) Fast pattern-matching on indeterminate strings. In: 16th Australasian Workshop on Combinatorial Algorithms (AWOCA) 2005, 18 - 21 September 2005, Ballarat, VIC

Franěk, F. and Smyth, W.F. (2005) Reconstructing a suffix array. In: The Prague Stringology Conference 2005, 29 - 31 August 2005, Czech Technical University, Prague

Puglisi, S.J., Smyth, W.F. and Turpin, A. (2005) Some restrictions on periodicity in strings. In: 16th Australasian Workshop on Combinatorial Algorithms (AWOCA) 2005, 18 - 21 September 2005, Ballarat, VIC

Puglisi, S.J., Smyth, W.F. and Turpin, A. (2005) The performance of linear time suffix sorting algorithms. In: Data Compression Conference (DCC) 2005, 29 - 31 March 2005, Snowbird, Utah, USA pp. 358-367.

Puglisi, S.J., Smyth, W.F. and Turpin, A. (2005) A taxonomy of suffix array construction algorithms. In: The Prague Stringology Conference 2005, 29 - 31 August 2005, Czech Technical University, Prague

Antonitio, ., Ryan, P.J., Smyth, W.F., Turpin, A. and Yu, X. (2004) New suffix array algorithms - Linear but not fast? In: 15th Australasian Workshop on Combinatorial Algorithms (AWOCA) 2004, 7 - 9 July 2004, Ballina Beach Resort, New South Wales

Franěk, F. and Smyth, W.F. (2004) Sorting suffixes of two-pattern strings. In: Prague Stringology Conference 2004, 30 August - 1 September 2004, Czech Technical University, Prague

Holub, J. and Smyth, W.F. (2003) Algorithms on indeterminate strings. In: 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), 13 - 16 July 2003, Seoul National University, Seoul, Korea

Cole, R., Iliopoulos, C.S., Mohamed, M., Smyth, W.F. and Yang, L. (2003) Computing the minimum k-Cover of a string. In: Prague Stringology Conference 2003, 22 - 24 September 2003, Czech Technical University, Prague

Smyth, W.F., Lam, C.P., Chen, X. and Maxville, V. (2003) Heuristics for image retrieval using spatial configurations. In: Seventh International Confernece on Digital Image Computing: Techniques and Applications (DICTA 2003), 10 - 12 December 2003, Sydney, Australia

Franěk, F., Simpson, R.J. and Smyth, W.F. (2003) The maximum number of runs in a string. In: 14th Australasian Workshop on Combinatorial Algorithms, 13 - 16 July 2003, Seoul National University, Seoul, Korea

Miller, M., Ryan, J. and Smyth, W.F. (2003) The sum number of a disjoint union of graphs. In: 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), 13 - 16 July 2003, Seoul National University, Seoul, Korea

Franěk, F., Smyth, W.F. and Xiao, X. (2002) A Note on Crochemore's repetitions algorithm a fast Space-Efficient approach. In: Prague Stringology Conference 2002, 23 - 24 September 2002, Czech Technical University, Prague

Iliopoulos, C.S., Mohamed, M., Mouchard, L., Perdikuri, K.G., Smyth, W.F. and Tsakalidis, A.K. (2002) String regularities with don't cares. In: Prague Stringology Conference 2002, 23 - 24 September 2002, Czech Technical University, Prague

Turpin, A. and Smyth, W.F. (2002) An approach to phrase selection for offline data compression. In: 25th Australasian Computer Science Conference, Jan/Feb 2002, Monash University, Melbourne

Franěk, F., Lu, W. and Smyth, W.F. (2001) Repetitions in two-pattern strings. In: 5th World Multiconference on Systemics, Cybernetics, and Informatics, 22 - 25 July 2001, Orlando, FL

Franěk, F., Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y. and Yang, L. (1999) Verifying a border array in linear time. In: 10th Australasian Workshop on Combinatorial Algorithms (AWOCA) 1999, Perth, Western Australia

Iliopoulos, C.S. and Smyth, W.F. (1998) On-line algorithms for k-Covering. In: 9th Australasian Workshop on Combinatorial Algorithms (AWOCA '98), 27 - 30 July 1998, Perth, Western Australia

Franěk, F., Karaman, A. and Smyth, W.F. (1998) Repetitions in Sturmian strings. In: 9th Australasian Workshop on Combinatorial Algorithms (AWOCA '98), 27 - 30 July 1998, Perth, Western Australia

Smyth, W.F. (1998) Repetitive perhaps, but certainly not boring. In: 9th Australasian Workshop on Combinatorial Algorithms (AWOCA '98), 27 - 30 July 1998, Perth, Western Australia

Iliopoulos, C.S., Moore, D. and Smyth, W.F. (1996) A linear algorithm for computing all the squares of a Fibonacci string. In: Computing: The Australasian Theory Symposium (CATS '96), 29 - 30 January 1996, Melbourne, Australia

Moore, D. and Smyth, W.F. (1994) Computing the covers of a string in linear time. In: Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 23 - 25 January 1994, Arlington, Virginia

Smyth, W.F. and Jayasiri, N.W.N. (1980) The encouragement of effective computer use in developing countries. In: International Federation for Information Processing (IFIP) Congress 80, 6 - 9 October 1980, Tokyo, Japan

Smyth, W.F. and Arany, I. (1976) Another algorithm for reducing bandwidth and profile of a sparse matrix. In: National Computer Conference (AFIPS '76), 7 - 10 June 1976, New York pp. 987-994.

Smyth, W.F. and Benzi, W.M.L. (1974) An algorithm for finding the diameter of a graph. In: International Federation for Information Processing (IFIP) Congress 74, 5 - 10 August 1974, Stockholm, Sweden

Arany, I., Smyth, W.F. and Szóda, L. (1971) An improved algorithm for reducing the bandwidth of sparse symmetric matrices. In: International Federation for Information Processing (IFIP) Congress 71, 23 - 28 August 1971, Ljublijana, Yugoslavia

Conference Item

Smyth, W.F. (2007) The maximum number of of runs in a string. In: International Workshop on Combinatorial Algorithms (IWOCA) 2007, 5 - 9 November 2007, Newcastle, NSW.

Ilopoulos, C.S., Mohamed, M. and Smyth, W.F. (2004) New complexity results for the k-covers problem. In: 15th Australasian Workshop on Combinatorial Algorithms (AWOCA) 2004, 7 - 9 July 2004, Ballina Beach Resort, New South Wales.

Book Chapter

Daykin, J.W. and Smyth, W.F. (2013) Analyzing strings with ordered Lyndon-like structures. In: Gruner, S. and Watson, B., (eds.) Formal Aspects of Computing: Essays Dedicated to Derrick Kourie on the Occasion of His 65th Birthday. Shaker Verlag GmbH, Germany, pp. 95-110.

Smyth, W.F. (2013) Are three squares possible? In: Gruner, S. and Watson, B., (eds.) Formal Aspects of Computing: Essays Dedicated to Derrick Kourie on the Occasion of His 65th Birthday. Shaker Verlag GmbH, Germany, pp. 135-150.

Holub, J., Smyth, W.F. and Wang, S. (2007) Hybrid pattern-matching algorithms on indeterminate strings. In: Daykin, J.W., Mohamed, M. and Steinhöfel, K., (eds.) London Algorithmics and Stringology 2006. King's College Publications, pp. 115-133.

Hartsfield, N. and Smyth, W.F. (1992) The sum number of complete bipartite graphs. In: Rolf, R., (ed.) Graphs, Matrices, and Designs. CRC Press, pp. 205-211.

Smyth, W.F. (1991) Multiculturalism and racism: Cause and effect. In: Smith, J.W., (ed.) Immigration, Population & Sustainable Environments. Flinders Press, Flinders University. South Australia, pp. 421-435.

Book

Arumugam, S. and Smyth, W.F. (ED) (2012) Combinatorial Algorithms. Springer Berlin Heidelberg.

Iliopoulos, C.S. and Smyth, W.F.(ED) (2011) Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Springer Berlin Heidelberg.

Brankovich, L., Lin, Y. and Smyth, W.F. (ED) (2008) Proceedings of the International Workshop on Combinatorial Algorithms 2007. College Publications.

Smyth, W.F. (2003) Computing patterns in strings. Addison-Wesley.

Other

Alatabbi, A., Sohidull Islam, A.S., Rahman, M.S., Simpson, J. and Smyth, W.F. (2015) Enhanced covers of regular & indeterminate strings using prefix tables. Unpublished Publication .

Alatabbi, A., Daykin, J.W., Rahman, M.S. and Smyth, W.F. (2015) String comparison in V-Order: New lexicographic properties & On-line applications. Unpublished Publication .