| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jacqueline W. Daykin, Bill Smyth, Lynette van Zijl |
Editorial.  |
J. Discrete Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Manal Mohamed, William F. Smyth |
New complexity results for the k-covers problem. |
Inf. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucian Ilie, William F. Smyth |
Minimum Unique Substrings and Maximum Repeats. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David E. Daykin, Jacqueline W. Daykin, William F. Smyth |
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, William F. Smyth (eds.) |
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers |
IWOCA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, William F. Smyth (eds.) |
Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers |
IWOCA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon J. Puglisi, William F. Smyth, Munina Yusufu |
Fast, Practical Algorithms for Computing All the Repeats in a String. |
Mathematics in Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Farida Ridzuan, Vidyasagar Potdar, Alex Talevski, William F. Smyth |
Key Parameters in Identifying Cost of Spam 2.0. |
AINA |
2010 |
DBLP DOI BibTeX RDF |
cost of spam, web spam |
| 1 | William F. Smyth, Shu Wang |
A new approach to the periodicity lemma on strings with holes. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | William F. Smyth, Shu Wang |
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, William F. Smyth, Munina Yusufu |
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David E. Daykin, Jacqueline W. Daykin, William F. Smyth |
Combinatorics of Unique Maximal Factorization Families (UMFFs). |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon J. Puglisi, Jamie Simpson, William F. Smyth |
How many runs can a string contain? |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth |
Identifying Rhythms in Musical Texts. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gang Chen, Simon J. Puglisi, William F. Smyth |
Lempel-Ziv Factorization Using Less Time & Space. |
Mathematics in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
Lempel-Ziv factorization, LZ factorization, suffix tree, suffix array |
| 1 | Jan Holub, William F. Smyth, Shu Wang |
Fast pattern-matching on indeterminate strings. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | William F. Smyth, Shu Wang, Mao Yu |
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. |
Stringology |
2008 |
DBLP BibTeX RDF |
|
| 1 | Simon J. Puglisi, William F. Smyth, Munina Yusufu |
Fast Optimal Algorithms for Computing All the Repeats in a String. |
Stringology |
2008 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie, William F. Smyth |
A Simple Algorithm for Computing the Lempel Ziv Factorization. |
DCC |
2008 |
DBLP DOI BibTeX RDF |
longest common prefix, longest previous factor, Lempel-Ziv factorization, strings, suffix array, algorithms design, runs, repetitions |
| 1 | William F. Smyth, Shu Wang |
New Perspectives on the Prefix Array. |
SPIRE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manolis 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
A taxonomy of suffix array construction algorithms. |
ACM Comput. Surv. |
2007 |
DBLP DOI BibTeX RDF |
suffix sorting, suffix tree, Suffix array, Burrows-Wheeler transform |
| 1 | Frantisek Franek, Jiandong Jiang, William F. Smyth |
Two-pattern strings II - frequency of occurrence and substring complexity. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Franek, Christopher G. Jennings, William F. Smyth |
A simple fast hybrid pattern-matching algorithm. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gang Chen, Simon J. Puglisi, William F. Smyth |
Fast and Practical Algorithms for Computing All the Runs in a String. |
CPM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamid 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 |
DBLP DOI BibTeX RDF |
token-based clone detection, reverse engineering, software maintenance, clone detection |
| 1 | Frantisek Franek, William F. Smyth |
Reconstructing a Suffix Array. |
Int. J. Found. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin |
A New Periodicity Lemma. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
Suffix arrays: what are they good for? |
ADC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth |
Song classifications for dancing. |
Stringology |
2006 |
DBLP BibTeX RDF |
|
| 1 | M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth |
Finding Patterns with Variable Length Gaps or Don't Cares. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. |
SPIRE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Franek, William F. Smyth |
Sorting suffixes of two-pattern strings. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2005 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Franek, William F. Smyth |
Reconstructing a suffix array. |
Stringology |
2005 |
DBLP BibTeX RDF |
|
| 1 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
A taxonomy of suffix array construction algorithms. |
Stringology |
2005 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Franek, Christopher G. Jennings, William F. Smyth |
A Simple Fast Hybrid Pattern-Matching Algorithm. |
CPM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangmin Fan, William F. Smyth, R. J. Simpson |
A New Periodicity Lemma. |
CPM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
The Performance of Linear Time Suffix Sorting Algorithms. |
DCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Franek, William F. Smyth |
Sorting suffixes of two-pattern strings. |
Stringology |
2004 |
DBLP BibTeX RDF |
|
| 1 | Bill Smyth, Chiou Peng Lam, Xin Chen, Valerie Maxville |
Heuristics for Image Retrieval Using Spatial Configurations. |
DICTA |
2003 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Franek, William F. Smyth, Yudong Tang |
Computing All Repeats Using Suffix Arrays. |
Journal of Automata, Languages and Combinatorics |
2003 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao |
Computing Quasi Suffix Arrays. |
Journal of Automata, Languages and Combinatorics |
2003 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Franek, Weilin Lu, William F. Smyth |
Two-pattern strings I - A recognition algorithm. |
J. Discrete Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis |
String Regularities with Don't Cares. |
Nord. J. Comput. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Franek, William F. Smyth, Xiangdong Xiao |
A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach. |
Nord. J. Comput. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Yin Li, William F. Smyth |
Computing the Cover Array in Linear Time. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Quasiperiod, Algorithm, Period, String, Cover, Word |
| 1 | Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth |
Two-Pattern Strings. |
CPM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Turpin, William F. Smyth |
An Approach to Phrase Selection for Offline Data Compression. |
ACSC |
2002 |
DBLP BibTeX RDF |
|
| 1 | Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth |
Approximate periods of strings. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Moore, William F. Smyth, D. Miller |
Counting Distinct Strings. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Distinct, Algorithm, Testing, String, Word |
| 1 | Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth |
Approximate Periods of Strings. |
CPM |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Dennis Moore, William F. Smyth |
A Characterization of the Squares in a Fibonacci String. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Art M. Duval, William F. Smyth |
Covering a Circular String with Substrings of Fixed Length. |
Int. J. Found. Comput. Sci. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Dennis Moore, William F. Smyth |
A Correction to ``An Optimal Algorithm to Compute all the Covers of a String''. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Moore, William F. Smyth |
An Optimal Algorithm to Compute all the Covers of a String. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth |
Parallel RAM Algorithms for Factorizing Words. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Moore, William F. Smyth |
Computing the Covers of a String in Linear Time. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, William F. Smyth |
Optimal Algorithms for Computing the canonical form of a circular string. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, William F. Smyth |
PRAM Algorithms for Identifying Polygon Similarity. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")