World's Best Scientists 2026 revealed!
William F. Smyth

William F. Smyth

D-Index & Metrics

Computer Science

D-Index
31
Citations
3986
World Ranking
13689
National Ranking
534

Overview

William F. Smyth is affiliated with McMaster University in Canada. Their research primarily contributes to the field of Management Science and Operations Research, with a particular focus on Stock Market Forecasting Methods.

Recent publications include two papers co-authored with Daniel Broby. These papers are:

  • On the use of principal components analysis in index construction, 2025, Financial Statistical Journal
  • On the Use of Principal Components Analysis in Index Construction, 2023, SSRN Electronic Journal

Smyth's research topics revolve around stock market forecasting methodologies, highlighting analytical techniques to improve financial index construction and related forecasting applications.

Frequent collaborators include:

  • Daniel Broby

They have published primarily in the following venues:

  • Financial Statistical Journal
  • SSRN Electronic Journal

Best Publications

  • A taxonomy of suffix array construction algorithms

    Simon J. Puglisi;W. F. Smyth;Andrew H. Turpin

  • Computing Patterns in Strings

    William Smyth

  • A fast and effective heuristic for the feedback arc set problem

    Peter Eades;Xuemin Lin;W. F. Smyth;W. F. Smyth

  • Efficient token based clone detection with flexible tokenization

    Hamid Abdul Basit;Simon J. Puglisi;William F. Smyth;Andrew Turpin

  • A characterization of the squares in a Fibonacci string

    Costas S. Iliopoulos;Costas S. Iliopoulos;Dennis W. G. Moore;William F. Smyth;William F. Smyth

  • A Simple Algorithm for Computing the Lempel Ziv Factorization

    M. Crochemore;L. Ilie;W.F. Smyth

  • Computing the Cover Array in Linear Time

    Yin Li;William F. Smyth

  • How many runs can a string contain

    Simon J. Puglisi;Jamie Simpson;W. F. Smyth

  • A simple fast hybrid pattern-matching algorithm

    Frantisek Franek;Christopher G. Jennings;W. F. Smyth

  • Verifying a border array in linear time

    W. Lu;P.J. Ryan;W.F. Smyth;Y. Sun

  • Program style analysis: a natural by-product of program compilation

    K. A. Redish;W. F. Smyth

  • An optimal algorithm to compute all the covers of a string

    Dennis Moore;W. F. Smyth;W. F. Smyth

  • Lempel-Ziv Factorization Using Less Time & Space

    Gang Chen;Simon J. Puglisi;William F. Smyth;William F. Smyth

  • Fast pattern-matching on indeterminate strings

    Jan Holub;W. F. Smyth;Shu Wang

  • The maximum number of runs in a string

    F. Franěk;R.J. Simpson;W.F. Smyth

  • An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices.

    Ilona Arany;Lajos Szoda;W. F. Smyth

  • A correction to “An optimal algorithm to compute all the covers of a string”

    Dennis Moore;W. F. Smyth;W. F. Smyth

  • Finding patterns with variable length gaps or don’t cares

    M. Sohel Rahman;Costas S. Iliopoulos;Inbok Lee;Manal Mohamed

  • Inverted files versus suffix arrays for locating patterns in primary memory

    Simon J. Puglisi;W. F. Smyth;Andrew Turpin

  • The performance of linear time suffix sorting algorithms

    S.J. Puglisi;W.F. Smyth;A. Turpin

  • Weak repetitions in strings

    L.J. Cummings;W.F. Smyth

Frequent Co-Authors

Costas S. Iliopoulos
Costas S. Iliopoulos King's College London
Simon J. Puglisi
Simon J. Puglisi University of Helsinki
Andrew Turpin
Andrew Turpin University of Melbourne
Maxime Crochemore
Maxime Crochemore King's College London
Giovanni Manzini
Giovanni Manzini University of Eastern Piedmont Amadeo Avogadro
Richard Cole
Richard Cole New York University
Donald A. Adjeroh
Donald A. Adjeroh West Virginia University
Xuemin Lin
Xuemin Lin Shanghai Jiao Tong University
Peter Eades
Peter Eades University of Sydney
Wing-Kin Sung
Wing-Kin Sung Chinese University of Hong Kong

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA can open doors to many dynamic career paths, but it’s also important to explore related fields and fast-track options. For instance, students interested in hardware and circuit design might consider the best online electrical engineering programs USA to expand their skillset and enhance employability.

Those looking for quick entry into the tech workforce may be interested in 3-month certificate programs that pay well. These short courses can provide credentials in areas like cybersecurity or data analytics; perfect for boosting your resume without a long-term commitment.

If you’re aiming for leadership or specialized roles, explore the quickest online masters degree offerings. Accelerated online master’s programs help working professionals quickly advance in fields such as IT management or software engineering.

Finally, focus your educational investment on the most useful masters degrees in current demand. This ensures your studies align with emerging trends and top-paying roles in tech and beyond.

Best Scientists Citing William F. Smyth

Trending Scientists