James D. Currie

1.2k total citations
68 papers, 568 citations indexed

About

James D. Currie is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, James D. Currie has authored 68 papers receiving a total of 568 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Computational Theory and Mathematics, 36 papers in Artificial Intelligence and 12 papers in Molecular Biology. Recurrent topics in James D. Currie's work include semigroups and automata theory (47 papers), Algorithms and Data Compression (23 papers) and Computability, Logic, AI Algorithms (14 papers). James D. Currie is often cited by papers focused on semigroups and automata theory (47 papers), Algorithms and Data Compression (23 papers) and Computability, Logic, AI Algorithms (14 papers). James D. Currie collaborates with scholars based in Canada, France and Finland. James D. Currie's co-authors include Narad Rampersad, Morteza Mohammad-Noori, Jeffrey Shallit, Jamie Simpson, Julien Cassaigne, Jean‐Paul Allouche, Kenneth S. Williams, Jeff Babb, Dirk Nowotka and Luke Schaeffer and has published in prestigious journals such as The Lancet, Mathematics of Computation and Journal of Affective Disorders.

In The Last Decade

James D. Currie

57 papers receiving 537 citations

Peers

James D. Currie

CTM

AI

MB

DMC

EEE

Maurice Pouzet France

Giuseppe Pirillo Italy

Térésa Krick Argentina

Robert H. Oehmke United States

Gilles Lachaud France

Jaroslav Ježek Czechia

Delphine Boucher France

Hyun Kwang Kim South Korea

Sophie Huczynska United Kingdom

Maurice Pouzet France

James D. Currie

330 ×0.7

CTM

64 ×0.2

AI

36 ×0.4

MB

108 ×1.3

DMC

28 ×0.7

EEE

Citations per year, relative to James D. Currie James D. Currie (= 1×) peers Maurice Pouzet

Countries citing papers authored by James D. Currie

Since Specialization

Citations

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

Fields of papers citing papers by James D. Currie

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of James D. Currie

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Currie, James D., et al.. (2025). Complement Avoidance in Binary Words. The Electronic Journal of Combinatorics. 32(4).

2.

Currie, James D., Pascal Ochem, Narad Rampersad, & Jeffrey Shallit. (2023). Properties of a ternary infinite word. SPIRE - Sciences Po Institutional REpository. 57. 1–1. 1 indexed citations

3.

Currie, James D., et al.. (2020). The repetition threshold for binary rich words. Discrete Mathematics & Theoretical Computer Science. vol. 22 no. 1(Analysis of Algorithms).

4.

Currie, James D., et al.. (2019). The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27.. arXiv (Cornell University). 23.

5.

Currie, James D., et al.. (2018). Unary patterns under permutations. Theoretical Computer Science. 743. 72–82.

6.

Currie, James D., et al.. (2014). Extremal words in morphic subshifts. Discrete Mathematics. 322. 53–60. 1 indexed citations

7.

Currie, James D. & Narad Rampersad. (2012). Fixed points avoiding Abelian k-powers. Journal of Combinatorial Theory Series A. 119(5). 942–948. 5 indexed citations

8.

Currie, James D. & Narad Rampersad. (2009). Dejean’s conjecture holds for n≥30. Theoretical Computer Science. 410(30-32). 2885–2888. 8 indexed citations

9.

Currie, James D. & Narad Rampersad. (2008). For each α > 2 there is an Infinite Binary Word with Critical Exponent α.. arXiv (Cornell University). 15. 4 indexed citations

10.

Currie, James D.. (2007). Palindrome positions in ternary square-free words. Theoretical Computer Science. 396(1-3). 254–257. 1 indexed citations

11.

Mohammad-Noori, Morteza & James D. Currie. (2006). Dejean’s conjecture and Sturmian words. European Journal of Combinatorics. 28(3). 876–890. 30 indexed citations

12.

Currie, James D.. (2005). Pattern avoidance: themes and variations. Theoretical Computer Science. 339(1). 7–18. 29 indexed citations

13.

Currie, James D., et al.. (2004). The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially. Journal of integer sequences. 7(2). 27. 10 indexed citations

14.

Currie, James D.. (2004). The number of binary words avoiding abelian fourth powers grows exponentially. Theoretical Computer Science. 319(1-3). 441–446. 7 indexed citations

15.

Currie, James D.. (2002). No iterated morphism generates any Arshon sequence of odd order. Discrete Mathematics. 259(1-3). 277–283. 1 indexed citations

16.

Currie, James D., et al.. (2001). Avoiding Patterns in the Abelian Sense. Canadian Journal of Mathematics. 53(4). 696–714. 12 indexed citations

17.

Cassaigne, Julien & James D. Currie. (1999). Words Strongly Avoiding Fractional Powers. European Journal of Combinatorics. 20(8). 725–737. 9 indexed citations

18.

Currie, James D.. (1995). On the structure and extendibility of k-power free words. European Journal of Combinatorics. 16(2). 111–124. 6 indexed citations

19.

Currie, James D.. (1993). Open Problems in Pattern Avoidance. American Mathematical Monthly. 100(8). 790–793. 7 indexed citations

20.

Williams, Kenneth S. & James D. Currie. (1982). Class Numbers and Biquadratic Reciprocity. Canadian Journal of Mathematics. 34(4). 969–988. 8 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