dblp.uni-trier.dewww.uni-trier.de

William F. Smyth

Bill Smyth

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
45EEWilliam F. Smyth, Shu Wang: New Perspectives on the Prefix Array. SPIRE 2008: 133-143
44EEManolis 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)
43EEJan Holub, William F. Smyth, Shu Wang: Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6(1): 37-50 (2008)
42EEGang Chen, Simon J. Puglisi, William F. Smyth: Lempel-Ziv Factorization Using Less Time & Space. Mathematics in Computer Science 1(4): 605-623 (2008)
41EESimon J. Puglisi, Jamie Simpson, William F. Smyth: How many runs can a string contain? Theor. Comput. Sci. 401(1-3): 165-171 (2008)
2007
40EEGang Chen, Simon J. Puglisi, William F. Smyth: Fast and Practical Algorithms for Computing All the Runs in a String. CPM 2007: 307-315
39EEHamid Abdul Basit, Simon J. Puglisi, William F. Smyth, Andrew Turpin, Stan Jarzabek: Efficient token based clone detection with flexible tokenization. ESEC/SIGSOFT FSE (Companion) 2007: 513-516
38EESimon J. Puglisi, William F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39(2): (2007)
37EEFrantisek Franek, Christopher G. Jennings, William F. Smyth: A simple fast hybrid pattern-matching algorithm. J. Discrete Algorithms 5(4): 682-695 (2007)
36EEFrantisek Franek, Jiandong Jiang, William F. Smyth: Two-pattern strings II - frequency of occurrence and substring complexity. J. Discrete Algorithms 5(4): 739-748 (2007)
35EEManolis Christodoulakis, G. Brian Golding, Costas S. Iliopoulos, Yoan José Pinzón Ardila, William F. Smyth: Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. Journal of Computational Biology 14(7): 1001-1010 (2007)
2006
34EESimon J. Puglisi, William F. Smyth, Andrew Turpin: Suffix arrays: what are they good for? ADC 2006: 17-18
33EEM. 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
32EESimon J. Puglisi, William F. Smyth, Andrew Turpin: Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. SPIRE 2006: 122-133
31EEManolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth: Song classifications for dancing. Stringology 2006: 41-48
30EEFrantisek Franek, William F. Smyth: Reconstructing a Suffix Array. Int. J. Found. Comput. Sci. 17(6): 1281-1296 (2006)
29EEKangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin: A New Periodicity Lemma. SIAM J. Discrete Math. 20(3): 656-668 (2006)
2005
28EEKangmin Fan, William F. Smyth, R. J. Simpson: A New Periodicity Lemma. CPM 2005: 257-265
27EEFrantisek Franek, Christopher G. Jennings, William F. Smyth: A Simple Fast Hybrid Pattern-Matching Algorithm. CPM 2005: 288-297
26EESimon J. Puglisi, William F. Smyth, Andrew Turpin: The Performance of Linear Time Suffix Sorting Algorithms. DCC 2005: 358-367
25 Simon J. Puglisi, William F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms. Stringology 2005: 1-30
24 Frantisek Franek, William F. Smyth: Reconstructing a suffix array. Stringology 2005: 54-68
23EEFrantisek Franek, William F. Smyth: Sorting suffixes of two-pattern strings. Int. J. Found. Comput. Sci. 16(6): 1135-1144 (2005)
22 Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, L. Yang: The Complexity of the Minimum k-Cover Problem. Journal of Automata, Languages and Combinatorics 10(5/6): 641-653 (2005)
2004
21EEFrantisek Franek, William F. Smyth: Sorting suffixes of two-pattern strings. Stringology 2004: 69-78
2003
20EEBill Smyth, Chiou Peng Lam, Xin Chen, Valerie Maxville: Heuristics for Image Retrieval Using Spatial Configurations. DICTA 2003: 909-918
19EEFrantisek Franek, Weilin Lu, William F. Smyth: Two-pattern strings I - A recognition algorithm. J. Discrete Algorithms 1(5-6): 445-460 (2003)
18 Frantisek Franek, William F. Smyth, Yudong Tang: Computing All Repeats Using Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4): 579-591 (2003)
17 Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao: Computing Quasi Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4): 593-606 (2003)
16 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)
15 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)
2002
14EEAndrew Turpin, William F. Smyth: An Approach to Phrase Selection for Offline Data Compression. ACSC 2002: 267-273
13EEFrantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth: Two-Pattern Strings. CPM 2002: 76-84
12EEYin Li, William F. Smyth: Computing the Cover Array in Linear Time. Algorithmica 32(1): 95-106 (2002)
2001
11EEJeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001)
1999
10EEJeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate Periods of Strings. CPM 1999: 123-133
9EEDennis Moore, William F. Smyth, D. Miller: Counting Distinct Strings. Algorithmica 23(1): 1-13 (1999)
1997
8EECostas S. Iliopoulos, Dennis Moore, William F. Smyth: A Characterization of the Squares in a Fibonacci String. Theor. Comput. Sci. 172(1-2): 281-291 (1997)
1996
7 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
6EEDennis 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
5 Dennis Moore, William F. Smyth: Computing the Covers of a String in Linear Time. SODA 1994: 511-515
4 Dennis Moore, William F. Smyth: An Optimal Algorithm to Compute all the Covers of a String. Inf. Process. Lett. 50(5): 239-246 (1994)
3 Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth: Parallel RAM Algorithms for Factorizing Words. Theor. Comput. Sci. 127(1): 53-67 (1994)
1992
2 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)
1989
1 Costas S. Iliopoulos, William F. Smyth: PRAM Algorithms for Identifying Polygon Similarity. Optimal Algorithms 1989: 25-32

Coauthor Index

1Hamid Abdul Basit [39]
2Gang Chen [40] [42]
3Xin Chen [20]
4Manolis Christodoulakis [31] [35] [44]
5Richard Cole [22]
6Jacqueline W. Daykin [3]
7Art M. Duval [7]
8Kangmin Fan [28] [29]
9Frantisek Franek [13] [16] [17] [18] [19] [21] [23] [24] [27] [30] [36] [37]
10G. Brian Golding [35]
11Jan Holub [17] [43]
12Costas S. Iliopoulos [1] [2] [3] [8] [10] [11] [15] [22] [31] [33] [35] [44]
13Stan Jarzabek (Stanislaw Jarzabek) [39]
14Christopher G. Jennings [27] [37]
15Jiandong Jiang [13] [36]
16Chiou Peng Lam [20]
17Inbok Lee [33]
18Yin Li [12]
19Weilin Lu [13] [19]
20Valerie Maxville [20]
21D. Miller [9]
22Manal Mohamed [15] [22] [33]
23Dennis Moore [4] [5] [6] [8] [9]
24Laurent Mouchard [15]
25Kunsoo Park [10] [11]
26Katerina Perdikuri [15]
27Yoan J. Pinzon (Yoan José Pinzón Ardila) [35]
28Simon J. Puglisi [25] [26] [29] [32] [34] [38] [39] [40] [41] [42]
29Mohammad Sohel Rahman (M. Sohel Rahman) [31] [33] [44]
30Jeong Seop Sim [10] [11]
31Jamie Simpson [41]
32R. J. Simpson [28]
33Yudong Tang [18]
34Athanasios K. Tsakalidis [15]
35Andrew Turpin [14] [25] [26] [29] [32] [34] [38] [39]
36Shu Wang [43] [45]
37Xiangdong Xiao [16] [17]
38L. Yang [22]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)