Countries citing papers authored by William F. Smyth
Since
Specialization
Citations
This map shows the geographic impact of William F. Smyth's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by William F. Smyth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites William F. Smyth more than expected).
Fields of papers citing papers by William F. Smyth
This network shows the impact of papers produced by William F. Smyth. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by William F. Smyth. The network helps show where William F. Smyth may publish in the future.
Co-authorship network of co-authors of William F. Smyth
This figure shows the co-authorship network connecting the top 25 collaborators of William F. Smyth.
A scholar is included among the top collaborators of William F. Smyth based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with William F. Smyth. William F. Smyth is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bai, Haoyue, František Franěk, & William F. Smyth. (2014). Two squares canonical factorization. 52–58.2 indexed citations
8.
Fici, Gabriele, et al.. (2012). Quasi-linear Time Computation of the Abelian Periods of a Word. UWA Profiles and Research Repository (University of Western Australia). 103–110.6 indexed citations
9.
Flouri, Tomáš, Costas S. Iliopoulos, Tomasz Kociumaka, et al.. (2012). New and efficient approaches to the quasiperiodic characterisation of a string. UWA Profiles and Research Repository (University of Western Australia). 75–88.1 indexed citations
10.
Iliopoulos, Costas S., et al.. (2012). Proceedings of the Prague Stringology Conference (PSC 2012).1 indexed citations
11.
Iliopoulos, Costas S., et al.. (2011). Combinatorial Algorithms. Lecture notes in computer science.5 indexed citations
Smyth, William F., et al.. (2008). An adaptive hybrid pattern-matching algorithm on indeterminate strings. UWA Profiles and Research Repository (University of Western Australia). 95–107.
Franěk, František & William F. Smyth. (2005). Reconstructing a suffix array. Murdoch Research Repository (Murdoch University). 54–68.1 indexed citations
16.
Cole, Richard, et al.. (2003). Computing the minimum k-Cover of a string. Murdoch Research Repository (Murdoch University). 51–64.7 indexed citations
17.
Smyth, William F., et al.. (2003). Heuristics for image retrieval using spatial configurations. Australasian Journal of Paramedicine. 909–918.3 indexed citations
18.
Smyth, William F.. (2003). Computing Patterns in Strings. Murdoch Research Repository (Murdoch University).115 indexed citations
19.
Franěk, František, et al.. (2000). Repetitions in two-pattern strings. Murdoch Research Repository (Murdoch University). 32–48.
20.
Smyth, William F.. (1992). Controversy in a Tradition of Commentary: The Academic Legacy of Al-Sakkaki's Miftah Al-Ulum. Journal of the American Oriental Society. 112(4). 589.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.