W F Smyth

Cited by

	All	Since 2018
Citations	4089	985
h-index	34	13
i10-index	82	26

320

160

240

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202319 7 24 13 21 26 30 38 31 56 43 90 93 125 179 222 156 162 269 258 304 231 280 287 224 189 176 179 146 71

Public access

View all

18 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Simon J. PuglisiProfessor, Department of Computer Science, University of HelsinkiVerified email at cs.helsinki.fi
Andrew TurpinLions Eye Institute and Curtin UniversityVerified email at curtin.edu.au
M Sohel RahmanCSE, BUETVerified email at cse.buet.ac.bd
Jamie SimpsonMurdoch UniversityVerified email at curtin.edu.au
Manal Mohamedkings college londonVerified email at kcl.ac.uk
Ali AlatabbiKing's College LondonVerified email at kcl.ac.uk
Neerja MhaskarMcMaster UniversityVerified email at mcmaster.ca
Lucian IlieThe University of Western OntarioVerified email at csd.uwo.ca
Jan HolubFull Professor of Computer Science, Czech Technical University in PragueVerified email at fit.cvut.cz
Mirka MillerUniversity of Newcastle, Australia & University of West Bohemia, Czech RepublicVerified email at newcastle.edu.au
Joe RyanUniversity of NewcastleVerified email at newcastle.edu.au
L CaccettaProfessor of Mathematics, Curtin UniversityVerified email at curtin.edu.au
Maxime CrochemoreKCLVerified email at kcl.ac.uk
Peter D EadesUniversity of SydneyVerified email at sydney.edu.au
Xuemin LinChair Professor at Shanghai Jiaotong UniversityVerified email at cse.unsw.edu.au
Manolis ChristodoulakisDepartment of Electrical and Computer Engineering, University of CyprusVerified email at ucy.ac.cy
Laurent MouchardAssistant-Professor of Computer Science, University of RouenVerified email at univ-rouen.fr
Hamid Abdul BasitPrince Sultan UniversityVerified email at psu.edu.sa
Stan JarzabekBialystok University of TechnologyVerified email at pb.edu.pl
Evguenia KopylovaHost-microbiome data analysis | Managing Director, Clarity GenomicsVerified email at clarity-genomics.com

W F Smyth

Professor Emeritus, Computer Science, McMaster University

Verified email at mcmaster.ca - Homepage

combinatorics on words string algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A taxonomy of suffix array construction algorithms SJ Puglisi, WF Smyth, A Turpin ACM Computing Surveys 39 (1), 1-31, 2007	405	2007
Computing Patterns in Strings B Smyth Pearson Addison-Wesley, 2003	338	2003
A fast and effective heuristic for the feedback arc set problem P Eades, X Lin, WF Smyth Information Processing Letters 47 (6), 319-323, 1993	316	1993
Efficient token based clone detection with flexible tokenization HA Basit, SJ Puglisi, WF Smyth, A Turpin, S Jarzabek	167	2007
A characterization of the squares in a Fibonacci string CS Iliopoulos, D Moore, WF Smyth Proc. CATS, 57-63, 1996	110	1996
A simple algorithm for computing the Lempel Ziv factorization M Crochemore, L Ilie, WF Smyth Data Compression Conference (DCC 2008), 482-488, 2008	100	2008
Computing the Cover Array in Linear Time Y Li, WF Smyth Algorithmica 32, 95-106, 2002	87*	2002
A simple fast hybrid pattern-matching algorithm F Franek, CG Jennings, WF Smyth Journal of Discrete Algorithms 5 (4), 682-695, 2007	80	2007
How many runs can a string contain? SJ Puglisi, J Simpson, WF Smyth Theoretical Computer Science 401 (1-3), 165-171, 2008	75	2008
The maximum number of runs in a string F Franěk, RJ Simpson, WF Smyth	69	2003
An optimal algorithm to compute all the covers of a string D Moore, WF Smyth Information Processing Letters 50 (5), 239-246, 1994	68	1994
Fast pattern-matching on indeterminate strings J Holub, WF Smyth, S Wang Journal of Discrete Algorithms 6 (1), 37-50, 2008	67	2008
Verifying a border array in linear time F Franěk, W Lu, PJ Ryan, WF Smyth, Y Sun, L Yang	66	1999
An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices. I Arany, L Szoda, WF Smyth IFIP Congress (2), 1246-1250, 1971	64	1971
Finding patterns with variable length gaps or don’t cares MS Rahman, CS Iliopoulos, I Lee, M Mohamed, WF Smyth Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006	59	2006
A correction to “An optimal algorithm to compute all the covers of a string” D Moore, WF Smyth Information Processing Letters 54 (2), 101-103, 1995	54	1995
Fast and practical algorithms for computing all the runs in a string G Chen, SJ Puglisi, WF Smyth CPM 4580, 307-315, 2007	53	2007
Inverted files versus suffix arrays for locating patterns in primary memory SJ Puglisi, WF Smyth, A Turpin String Processing and Information Retrieval: 13th International Conference …, 2006	51	2006
The performance of linear time suffix sorting algorithms SJ Puglisi, WF Smyth, A Turpin Data Compression Conference, 358-367, 2005	51	2005
String regularities with don't cares (preliminary version) CS Iliopoulos, M Mohamed, L Mouchard, KG Perdikuri, WF Smyth, ... Proc. Prague Stringology Conference, 65-74, 2002	51*	2002

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors