W F Smyth

Cited by

	All	Since 2019
Citations	4376	997
h-index	34	14
i10-index	85	24

320

160

240

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202419 8 25 15 28 25 31 42 32 58 44 90 92 131 190 224 161 169 270 266 313 242 235 307 222 190 185 182 138 178 124

Public access

View all

18 articles

1 article

available

not available

Based on funding mandates

Co-authors

Costas IliopoulosProfessor in Algorithm Design & BioinformaticsVerified email at kcl.ac.uk
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
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
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
Joe RyanUniversity of NewcastleVerified email at newcastle.edu.au
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
Kunsoo ParkProfessor of Computer Science, Seoul National UniversityVerified email at theory.snu.ac.kr

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	417	2007
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	349	1993
Computing Patterns in Strings B Smyth Pearson Addison-Wesley, 2003	348	2003
Efficient token based clone detection with flexible tokenization HA Basit, SJ Puglisi, WF Smyth, A Turpin, S Jarzabek	186	2007
A characterization of the squares in a Fibonacci string CS Iliopoulos, D Moore, WF Smyth Proc. CATS, 57-63, 1996	116	1996
A simple algorithm for computing the Lempel Ziv factorization M Crochemore, L Ilie, WF Smyth Data Compression Conference (DCC 2008), 482-488, 2008	99	2008
A simple fast hybrid pattern-matching algorithm F Franek, CG Jennings, WF Smyth Journal of Discrete Algorithms 5 (4), 682-695, 2007	92	2007
Computing the Cover Array in Linear Time Y Li, WF Smyth Algorithmica 32, 95-106, 2002	89*	2002
How many runs can a string contain? SJ Puglisi, J Simpson, WF Smyth Theoretical Computer Science 401 (1-3), 165-171, 2008	80	2008
Lempel–Ziv factorization using less time & space G Chen, SJ Puglisi, WF Smyth Mathematics in Computer Science 1, 605-623, 2008	73	2008
An optimal algorithm to compute all the covers of a string D Moore, WF Smyth Information Processing Letters 50 (5), 239-246, 1994	73	1994
Fast pattern-matching on indeterminate strings J Holub, WF Smyth, S Wang Journal of Discrete Algorithms 6 (1), 37-50, 2008	72	2008
The maximum number of runs in a string F Franěk, RJ Simpson, WF Smyth 14th Australasian Workshop on Combinatorial Algorithms, 2003	70	2003
Verifying a border array in linear time F Franek, S Gao, W Lu, PJ Ryan, WF Smyth, Y Sun, L Yang Journal of Combinatorial Mathematics and Combinatorial Computing 42, 223-236, 2002	67	2002
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	62	1995
An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices. I Arany, L Szoda, WF Smyth IFIP Congress (2), 1246-1250, 1971	62	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	58	2006
Fast and practical algorithms for computing all the runs in a string G Chen, SJ Puglisi, WF Smyth Annual Symposium on Combinatorial Pattern Matching, 307-315, 2007	54	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	53	2006
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	52*	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