Jamie Simpson

516 total citations
31 papers, 221 citations indexed

About

Jamie Simpson is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Jamie Simpson has authored 31 papers receiving a total of 221 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 11 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Jamie Simpson's work include semigroups and automata theory (18 papers), Algorithms and Data Compression (14 papers) and DNA and Biological Computing (7 papers). Jamie Simpson is often cited by papers focused on semigroups and automata theory (18 papers), Algorithms and Data Compression (14 papers) and DNA and Biological Computing (7 papers). Jamie Simpson collaborates with scholars based in Australia, Canada and Israel. Jamie Simpson's co-authors include Aviezri S. Fraenkel, Simon J. Puglisi, W.F. Smyth, James D. Currie, Stephanie Ludi, Frank Ruskey, Marcus Sellars, John Ellis, František Franěk and Linda Nolte and has published in prestigious journals such as Journal of Pain and Symptom Management, Theoretical Computer Science and Proceedings of the American Mathematical Society.

In The Last Decade

Jamie Simpson

26 papers receiving 213 citations

Peers

Jamie Simpson
A. Ehrenfeucht United States
Pavol Ďuriš Slovakia
Massimiliano Goldwurm Italy
Chong Shangguan China
Kenza Guenda Algeria
Holger Dell Germany
Clemens Lautemann Germany
Rudi Pendavingh Netherlands
Ulrich Hertrampf Germany
Hualu Liu China
A. Ehrenfeucht United States
Jamie Simpson
Citations per year, relative to Jamie Simpson Jamie Simpson (= 1×) peers A. Ehrenfeucht

Countries citing papers authored by Jamie Simpson

Since Specialization
Citations

This map shows the geographic impact of Jamie Simpson'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 Jamie Simpson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jamie Simpson more than expected).

Fields of papers citing papers by Jamie Simpson

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jamie Simpson. 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 Jamie Simpson. The network helps show where Jamie Simpson may publish in the future.

Co-authorship network of co-authors of Jamie Simpson

This figure shows the co-authorship network connecting the top 25 collaborators of Jamie Simpson. A scholar is included among the top collaborators of Jamie Simpson 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 Jamie Simpson. Jamie Simpson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Simpson, Jamie, et al.. (2023). Counting subwords in circular words and their Parikh matrices. Theoretical Computer Science. 985. 114344–114344.
2.
Simpson, Jamie, et al.. (2020). Permutations in which pairs of numbers are not simultaneously close in position and close in size.. Australas. J Comb.. 78. 11–34.
3.
Simpson, Jamie. (2020). Short witnesses for Parikh-friendly permutations.. Australas. J Comb.. 78. 329–334. 2 indexed citations
4.
Sellars, Marcus, et al.. (2019). Volunteer Involvement in Advance Care Planning: A Scoping Review. Journal of Pain and Symptom Management. 57(6). 1166–1175.e1. 12 indexed citations
5.
Simpson, Jamie. (2015). An abelian periodicity lemma. Theoretical Computer Science. 656. 249–255. 2 indexed citations
6.
Simpson, Jamie. (2014). Palindromes in circular words. Theoretical Computer Science. 550. 66–78. 1 indexed citations
7.
Simpson, Jamie, et al.. (2012). Minimizing the weight of the union-closure of families of two-sets. CDU eSpace Institutional Repository (Charles Darwin University). 52(1). 67–73. 2 indexed citations
8.
Franěk, František, et al.. (2012). More results on overlapping squares. Journal of Discrete Algorithms. 17. 2–8. 7 indexed citations
9.
Simpson, Jamie. (2012). A general two-term recurrence. European Journal of Combinatorics. 34(4). 703–705. 1 indexed citations
10.
Simpson, Jamie. (2010). Modified Padovan words and the maximum number of runs in a word. eSpace (Curtin University). 46. 129–145. 14 indexed citations
11.
Simpson, Jamie, et al.. (2010). a note on the union-closed sets conjecture. CDU eSpace Institutional Repository (Charles Darwin University). 47. 265–267. 11 indexed citations
12.
Puglisi, Simon J. & Jamie Simpson. (2008). The expected number of runs in a word. RMIT Research Repository (RMIT University Library). 42. 45–54. 9 indexed citations
13.
Puglisi, Simon J., Jamie Simpson, & W.F. Smyth. (2008). How many runs can a string contain?. Theoretical Computer Science. 401(1-3). 165–171. 27 indexed citations
14.
Pleasants, P. A. B., et al.. (2005). The Frobenius problem on lattices.. Queensland's institutional digital repository (The University of Queensland). 32. 27–45. 3 indexed citations
15.
Fraenkel, Aviezri S. & Jamie Simpson. (2004). An extension of the periodicity lemma to longer periods. Discrete Applied Mathematics. 146(2). 146–155. 1 indexed citations
16.
Simpson, Jamie. (2004). Disjoint Beatty Sequences. Zenodo (CERN European Organization for Nuclear Research). 4 indexed citations
17.
Ellis, John, Frank Ruskey, Joe Sawada, & Jamie Simpson. (2003). Euclidean strings. Theoretical Computer Science. 301(1-3). 321–340. 6 indexed citations
18.
Fraenkel, Aviezri S. & Jamie Simpson. (1999). The exact number of squares in Fibonacci words. Theoretical Computer Science. 218(1). 95–106. 22 indexed citations
19.
Simpson, Jamie, et al.. (1999). On Disjoint Covering Systems with Precisely One Repeated Modulus. Advances in Applied Mathematics. 23(3). 322–332. 2 indexed citations
20.
Fraenkel, Aviezri S. & Jamie Simpson. (1998). How Many Squares Can a String Contain?. Journal of Combinatorial Theory Series A. 82(1). 112–120. 47 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by A. Ehrenfeucht Breakdown of academic impact, for papers by Pavol Ďuriš Breakdown of academic impact, for papers by Massimiliano Goldwurm Breakdown of academic impact, for papers by Chong Shangguan Breakdown of academic impact, for papers by Kenza Guenda Breakdown of academic impact, for papers by Holger Dell Breakdown of academic impact, for papers by Clemens Lautemann Breakdown of academic impact, for papers by Rudi Pendavingh Breakdown of academic impact, for papers by Ulrich Hertrampf Breakdown of academic impact, for papers by Hualu Liu
Rankless by CCL
2026