Which graphs allow infinite nonrepetitive walks? - James D. Currie (Discret. Math., 1991)

Connectivity of distance graphs. - James D. Currie (Discret. Math., 1992)

A Note on Antichains of Words. - James D. Currie (Electron. J. Comb., 1995)

On the structure and extendibility of k-power free words. - James D. Currie (Eur. J. Comb., 1995)

Non-Repetitive Words: Ages and Essences. - James D. Currie (Comb., 1996)

Cantor Sets and Dejean's Conjecture. - James D. Currie; Robert O. Shelton (J. Autom. Lang. Comb., 1996)

Extremal Infinite Overlap-Free Binary Words. - Jean-Paul Allouche; James D. Currie; Jeffrey O. Shallit (Electron. J. Comb., 1998)

Words Strongly Avoiding Fractional Powers. - Julien Cassaigne; James D. Currie (Eur. J. Comb., 1999)

Separating Words with Small Grammars. - James D. Currie; Holger Petersen 001; John Michael Robson; Jeffrey O. Shallit (J. Autom. Lang. Comb., 1999)

Circular Words Avoiding Patterns. - James D. Currie; D. Sean Fitzpatrick (Developments in Language Theory, 2002)

There Are Ternary Circular Square-Free Words of Length n for n >= 18. - James D. Currie (Electron. J. Comb., 2002)

Non-Repetitive Tilings. - James D. Currie; Jamie Simpson (Electron. J. Comb., 2002)

No iterated morphism generates any Arshon sequence of odd order. - James D. Currie (Discret. Math., 2002)

Counting Endomorphisms of Crown-like Orders. - James D. Currie; Terry I. Visentin (Order, 2002)

What Is the Abelian Analogue of Dejean's Conjecture? - James D. Currie (Grammars and Automata for String Processing, 2003)

A word on 7 letters which is non-repetitive up to mod 5. - James D. Currie; Erica Moodie (Acta Informatica, 2003)

The Fixing Block Method in Combinatorics on Words. - James D. Currie; Cameron W. Pierce (Comb., 2003)

The set of k-power free words over sigma is empty or perfect, . - James D. Currie; Robert O. Shelton (Eur. J. Comb., 2003)

There Exist Binary Circular 5/2+ Power Free Words of Every Length. - Ali Aberkane; James D. Currie (Electron. J. Comb., 2004)

The number of binary words avoiding abelian fourth powers grows exponentially. - James D. Currie (Theor. Comput. Sci., 2004)

The Thue-Morse word contains circular 5/2+ power free words of every length. - Ali Aberkane; James D. Currie (Theor. Comput. Sci., 2005)

Pattern avoidance: themes and variations. - James D. Currie (Theor. Comput. Sci., 2005)

Binary Words Containing Infinitely Many Overlaps. - James D. Currie; Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2006)

On Abelian 2-avoidable binary patterns. - James D. Currie; Terry I. Visentin (Acta Informatica, 2007)

Dejean's conjecture and Sturmian words. - Morteza Mohammad Noori; James D. Currie (Eur. J. Comb., 2007)

For each α > 2 there is an Infinite Binary Word with Critical Exponent α. - James D. Currie; Narad Rampersad (Electron. J. Comb., 2008)

Palindrome positions in ternary square-free words. - James D. Currie (Theor. Comput. Sci., 2008)

Long binary patterns are Abelian 2-avoidable. - James D. Currie; Terry I. Visentin (Theor. Comput. Sci., 2008)

Dejean's conjecture holds for n>=27. - James D. Currie; Narad Rampersad (CoRR, 2009)

The lexicographically least word in the orbit closure of the Rudin-Shapiro word - James D. Currie (CoRR, 2009)

There are k-uniform cubefree binary morphisms for all k>=0. - James D. Currie; Narad Rampersad (Discret. Appl. Math., 2009)

Dejean's conjecture holds for $ sf {N ge 27}$. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2009)

Least Periods of Factors of Infinite Words. - James D. Currie; Kalle Saari (RAIRO Theor. Informatics Appl., 2009)

A cyclic binary morphism avoiding Abelian fourth powers. - James D. Currie; Ali Aberkane (Theor. Comput. Sci., 2009)

Dejean's conjecture holds for n>=30. - James D. Currie; Narad Rampersad (Theor. Comput. Sci., 2009)

Cubefree words with many squares. - James D. Currie; Narad Rampersad (Discret. Math. Theor. Comput. Sci., 2010)

Infinite words containing squares at every position. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2010)

Recurrent words with constant Abelian complexity. - James D. Currie; Narad Rampersad (Adv. Appl. Math., 2011)

Pattern avoidance with involution - James D. Currie (CoRR, 2011)

A proof of Dejean's conjecture. - James D. Currie; Narad Rampersad (Math. Comput., 2011)

Lexicographically least words in the orbit closure of the Rudin-Shapiro word. - James D. Currie (Theor. Comput. Sci., 2011)

Unary Patterns with involution. - Bastian Bischoff; James D. Currie; Dirk Nowotka (Int. J. Found. Comput. Sci., 2012)

Fixed points avoiding Abelian k-powers. - James D. Currie; Narad Rampersad (J. Comb. Theory A, 2012)

Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). - James D. Currie; Narad Rampersad; Kalle Saari (WORDS, 2013)

Extremal Words in the Shift Orbit Closure of a Morphic Sequence. - James D. Currie; Narad Rampersad; Kalle Saari (Developments in Language Theory, 2013)

Suffix conjugates for a class of morphic subshifts. - James D. Currie; Narad Rampersad; Kalle Saari (CoRR, 2013)

Infinite ternary square-free words concatenated from permutations of a single word. - James D. Currie (Theor. Comput. Sci., 2013)

Square-free Words with Square-free Self-shuffles. - James D. Currie; Kalle Saari (Electron. J. Comb., 2014)

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). - Maxime Crochemore; James D. Currie; Gregory Kucherov; Dirk Nowotka (Dagstuhl Reports, 2014)

Extremal words in morphic subshifts. - James D. Currie; Narad Rampersad; Kalle Saari; Luca Q. Zamboni (Discret. Math., 2014)

Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. - Francine Blanchet-Sadri; James D. Currie; Narad Rampersad; Nathan Fox (Integers, 2014)

Avoiding Three Consecutive Blocks of the Same Size and Same Sum. - Julien Cassaigne; James D. Currie; Luke Schaeffer; Jeffrey O. Shallit (J. ACM, 2014)

The Least Self-Shuffle of the Thue-Morse Sequence. - James D. Currie (J. Integer Seq., 2014)

Unary Patterns with Permutations. - James D. Currie; Florin Manea; Dirk Nowotka (DLT, 2015)

Binary words avoiding xx^Rx and strongly unimodal sequences. - James D. Currie; Narad Rampersad (CoRR, 2015)

Binary Words Avoiding x xR x and Strongly Unimodal Sequences. - James D. Currie; Narad Rampersad (J. Integer Seq., 2015)

A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$. - James D. Currie (Electron. J. Comb., 2016)

Avoidability Index for Binary Patterns with Reversal. - James D. Currie; Philip Lafrance (Electron. J. Comb., 2016)

Growth rate of binary words avoiding xxxR. - James D. Currie; Narad Rampersad (Theor. Comput. Sci., 2016)

A family of formulas with reversal of high avoidability index. - James D. Currie; Lucas Mol; Narad Rampersad (Int. J. Algebra Comput., 2017)

On avoidability of formulas with reversal. - James D. Currie; Lucas Mol; Narad Rampersad (RAIRO Theor. Informatics Appl., 2017)

Unary patterns under permutations. - James D. Currie; Florin Manea; Dirk Nowotka; Kamellia Reshadi (Theor. Comput. Sci., 2018)

Avoidance bases for formulas with reversal. - James D. Currie; Lucas Mol; Narad Rampersad (Theor. Comput. Sci., 2018)

The Undirected Repetition Threshold. - James D. Currie; Lucas Mol (WORDS, 2019)

Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. - James D. Currie; Lucas Mol; Narad Rampersad (Electron. J. Comb., 2019)

Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words. - James D. Currie (CoRR, 2019)

Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words. - James D. Currie (J. Integer Seq., 2019)

Some further results on squarefree arithmetic progressions in infinite words. - James D. Currie; Tero Harju; Pascal Ochem; Narad Rampersad (Theor. Comput. Sci., 2019)

The repetition threshold for binary rich words. - James D. Currie; Lucas Mol; Narad Rampersad (Discret. Math. Theor. Comput. Sci., 2020)

The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. - James D. Currie; Lucas Mol; Narad Rampersad (J. Integer Seq., 2020)

Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101. - James D. Currie; Jesse T. Johnson (Theor. Comput. Sci., 2021)

The undirected repetition threshold and undirected pattern avoidance. - James D. Currie; Lucas Mol (Theor. Comput. Sci., 2021)

Complement Avoidance in Binary Words. - James D. Currie; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2022)

The analogue of overlap-freeness for the period-doubling sequence. - James D. Currie (CoRR, 2023)

A small morphism giving Abelian repetition threshold less than 2. - James D. Currie; Narad Rampersad (CoRR, 2023)

Antisquares and Critical Exponents. - Aseem R. Baranwal; James D. Currie; Lucas Mol; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Discret. Math. Theor. Comput. Sci., 2023)

Properties of a ternary infinite word. - James D. Currie; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2023)

The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. - James D. Currie; Narad Rampersad (Electron. J. Comb., 2024)

A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2024)

Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. - James D. Currie; Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (SIAM J. Discret. Math., 2024)

Words Avoiding Half-Flips. - James D. Currie; Narad Rampersad (WORDS, 2025)

The Repetition Threshold for Ternary Rich Words. - James D. Currie; Lucas Mol; Jarkko Peltomäki (Electron. J. Comb., 2025)

The analogue of overlap-freeness for the Fibonacci morphism. - James D. Currie; Narad Rampersad (RAIRO Theor. Informatics Appl., 2025)

Low complexity binary words avoiding (5/2)+-powers. - Narad Rampersad; James D. Currie (CoRR, 2025)

Words with factor somplexity 2n+1 and minimal critical exponent. - James D. Currie (CoRR, 2025)