James D. Currie

115 papers C 4Journal 106Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Complement Avoidance in Binary Words.
Electron. J. Comb.
James D. Currie, L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská, Narad Rampersad, Jeffrey O. Shallit
2025 J jnl
Low complexity binary words avoiding $(5/2)^+$-powers.
Discret. Math. Theor. Comput. Sci.
James D. Currie, Narad Rampersad
2025 J jnl
Low complexity binary words avoiding (5/2)
CoRR
Narad Rampersad, James D. Currie
2025 J jnl
Reduced complexities for sequences over finite alphabets.
CoRR
John M. Campbell, James D. Currie, Narad Rampersad
2025 J jnl
The Repetition Threshold for Ternary Rich Words.
Electron. J. Comb.
James D. Currie, Lucas Mol, Jarkko Peltomäki
2025 J jnl
The analogue of overlap-freeness for the Fibonacci morphism.
RAIRO Theor. Informatics Appl.
James D. Currie, Narad Rampersad
2025 — conf
Words Avoiding Half-Flips.
WORDS
James D. Currie, Narad Rampersad
2025 J jnl
Words with factor somplexity 2n+1 and minimal critical exponent.
CoRR
James D. Currie
2024 J jnl
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2.
RAIRO Theor. Informatics Appl.
James D. Currie, Narad Rampersad
2024 J jnl
Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers.
SIAM J. Discret. Math.
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2024 J jnl
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold.
Electron. J. Comb.
James D. Currie, Narad Rampersad
2024 J jnl
The repetition threshold for ternary rich words.
CoRR
James D. Currie, Lucas Mol, Jarkko Peltomäki
2023 J jnl
A small morphism giving Abelian repetition threshold less than 2.
CoRR
James D. Currie, Narad Rampersad
2023 J jnl
Antisquares and Critical Exponents.
Discret. Math. Theor. Comput. Sci.
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023 J jnl
Properties of a ternary infinite word.
RAIRO Theor. Informatics Appl.
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023 J jnl
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold.
CoRR
James D. Currie, Narad Rampersad
2023 J jnl
The analogue of overlap-freeness for the Fibonacci morphism.
CoRR
James D. Currie, Narad Rampersad
2023 J jnl
The analogue of overlap-freeness for the period-doubling sequence.
CoRR
James D. Currie
2022 J jnl
Antisquares and Critical Exponents.
CoRR
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022 J jnl
Complement Avoidance in Binary Words.
CoRR
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022 J jnl
Properties of a Ternary Infinite Word.
CoRR
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2021 J jnl
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101.
Theor. Comput. Sci.
James D. Currie, Jesse T. Johnson
2021 J jnl
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2021 J jnl
The undirected repetition threshold and undirected pattern avoidance.
Theor. Comput. Sci.
James D. Currie, Lucas Mol
2020 J jnl
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27.
J. Integer Seq.
James D. Currie, Lucas Mol, Narad Rampersad
2020 J jnl
The repetition threshold for binary rich words.
Discret. Math. Theor. Comput. Sci.
James D. Currie, Lucas Mol, Narad Rampersad
2020 J jnl
The undirected repetition threshold and undirected pattern avoidance.
CoRR
James D. Currie, Lucas Mol
2019 J jnl
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture.
Electron. J. Comb.
James D. Currie, Lucas Mol, Narad Rampersad
2019 J jnl
Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words.
J. Integer Seq.
James D. Currie
2019 J jnl
Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words.
CoRR
James D. Currie
2019 J jnl
Some further results on squarefree arithmetic progressions in infinite words.
CoRR
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019 J jnl
Some further results on squarefree arithmetic progressions in infinite words.
Theor. Comput. Sci.
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019 J jnl
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad
2019 — conf
The Undirected Repetition Threshold.
WORDS
James D. Currie, Lucas Mol
2019 J jnl
The repetition threshold for binary rich words.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad
2019 J jnl
The undirected repetition threshold.
CoRR
James D. Currie, Lucas Mol
2018 J jnl
Avoidance bases for formulas with reversal.
Theor. Comput. Sci.
James D. Currie, Lucas Mol, Narad Rampersad
2018 J jnl
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad
2018 J jnl
Unary patterns under permutations.
Theor. Comput. Sci.
James D. Currie, Florin Manea, Dirk Nowotka, Kamellia Reshadi
2017 J jnl
A family of formulas with reversal of high avoidability index.
Int. J. Algebra Comput.
James D. Currie, Lucas Mol, Narad Rampersad
2017 J jnl
On avoidability of formulas with reversal.
RAIRO Theor. Informatics Appl.
James D. Currie, Lucas Mol, Narad Rampersad
2016 J jnl
A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$.
Electron. J. Comb.
James D. Currie
2016 J jnl
A ternary square-free sequence avoiding factors equivalent to abcacba.
CoRR
James D. Currie
2016 J jnl
Avoidability Index for Binary Patterns with Reversal.
Electron. J. Comb.
James D. Currie, Philip Lafrance
2016 J jnl
Growth rate of binary words avoiding xxx
Theor. Comput. Sci.
James D. Currie, Narad Rampersad
2015 J jnl
Avoidability index for binary patterns with reversal.
CoRR
James D. Currie, Philip Lafrance
2015 J jnl
Binary Words Avoiding x xR x and Strongly Unimodal Sequences.
J. Integer Seq.
James D. Currie, Narad Rampersad
2015 J jnl
Binary words avoiding xx^Rx and strongly unimodal sequences.
CoRR
James D. Currie, Narad Rampersad
2015 J jnl
Growth rate of binary words avoiding xxx
CoRR
James D. Currie, Narad Rampersad
2015 C conf
Unary Patterns with Permutations.
DLT
James D. Currie, Florin Manea, Dirk Nowotka
2014 J jnl
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1.
Integers
Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox
2014 J jnl
Avoiding Three Consecutive Blocks of the Same Size and Same Sum.
J. ACM
Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
2014 J jnl
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
Dagstuhl Reports
Maxime Crochemore, James D. Currie, Gregory Kucherov, Dirk Nowotka
2014 J jnl
Extremal words in morphic subshifts.
Discret. Math.
James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni
2014 J jnl
Square-free Words with Square-free Self-shuffles.
Electron. J. Comb.
James D. Currie, Kalle Saari
2014 J jnl
The Least Self-Shuffle of the Thue-Morse Sequence.
J. Integer Seq.
James D. Currie
2013 C conf
Extremal Words in the Shift Orbit Closure of a Morphic Sequence.
Developments in Language Theory
James D. Currie, Narad Rampersad, Kalle Saari
2013 J jnl
Extremal words in the shift orbit closure of a morphic sequence
CoRR
James D. Currie, Narad Rampersad, Kalle Saari
2013 J jnl
Infinite ternary square-free words concatenated from permutations of a single word.
Theor. Comput. Sci.
James D. Currie
2013 — conf
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract).
WORDS
James D. Currie, Narad Rampersad, Kalle Saari
2013 J jnl
Suffix conjugates for a class of morphic subshifts.
CoRR
James D. Currie, Narad Rampersad, Kalle Saari
2012 J jnl
Fixed points avoiding Abelian k-powers.
J. Comb. Theory A
James D. Currie, Narad Rampersad
2012 J jnl
Infinite ternary square-free words concatenated from permutations of a single word
CoRR
James D. Currie
2012 J jnl
Unary Patterns with involution.
Int. J. Found. Comput. Sci.
Bastian Bischoff, James D. Currie, Dirk Nowotka
2011 J jnl
A proof of Dejean's conjecture.
Math. Comput.
James D. Currie, Narad Rampersad
2011 J jnl
Avoiding Three Consecutive Blocks of the Same Size and Same Sum
CoRR
Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
2011 J jnl
Fixed points avoiding Abelian $k$-powers
CoRR
James D. Currie, Narad Rampersad
2011 J jnl
Lexicographically least words in the orbit closure of the Rudin-Shapiro word.
Theor. Comput. Sci.
James D. Currie
2011 J jnl
Pattern avoidance with involution
CoRR
James D. Currie
2011 J jnl
Recurrent words with constant Abelian complexity.
Adv. Appl. Math.
James D. Currie, Narad Rampersad
2010 J jnl
Cubefree words with many squares.
Discret. Math. Theor. Comput. Sci.
James D. Currie, Narad Rampersad
2010 J jnl
Infinite words containing squares at every position.
RAIRO Theor. Informatics Appl.
James D. Currie, Narad Rampersad
2009 J jnl
A cyclic binary morphism avoiding Abelian fourth powers.
Theor. Comput. Sci.
James D. Currie, Ali Aberkane
2009 J jnl
A proof of Dejean's conjecture
CoRR
James D. Currie, Narad Rampersad
2009 J jnl
Dejean's conjecture holds for $\sf {N\ge 27}$.
RAIRO Theor. Informatics Appl.
James D. Currie, Narad Rampersad
2009 J jnl
Dejean's conjecture holds for n>=27.
CoRR
James D. Currie, Narad Rampersad
2009 J jnl
Dejean's conjecture holds for n>=30.
Theor. Comput. Sci.
James D. Currie, Narad Rampersad
2009 J jnl
Least Periods of Factors of Infinite Words.
RAIRO Theor. Informatics Appl.
James D. Currie, Kalle Saari
2009 J jnl
The lexicographically least word in the orbit closure of the Rudin-Shapiro word
CoRR
James D. Currie
2009 J jnl
There are k-uniform cubefree binary morphisms for all k>=0.
Discret. Appl. Math.
James D. Currie, Narad Rampersad
2008 J jnl
Cubefree words with many squares.
CoRR
James D. Currie, Narad Rampersad
2008 J jnl
Dejean's conjecture holds for n >= 30.
CoRR
James D. Currie, Narad Rampersad
2008 J jnl
For each $α$ > 2 there is an infinite binary word with critical exponent $α$.
CoRR
James D. Currie, Narad Rampersad
2008 J jnl
For each α > 2 there is an Infinite Binary Word with Critical Exponent α.
Electron. J. Comb.
James D. Currie, Narad Rampersad
2008 J jnl
Infinite words containing squares at every position.
CoRR
James D. Currie, Narad Rampersad
2008 J jnl
Long binary patterns are Abelian 2-avoidable.
Theor. Comput. Sci.
James D. Currie, Terry I. Visentin
2008 J jnl
Palindrome positions in ternary square-free words.
Theor. Comput. Sci.
James D. Currie
2008 J jnl
There are k-uniform cubefree binary morphisms for all k >= 0.
CoRR
James D. Currie, Narad Rampersad
2007 J jnl
Dejean's conjecture and Sturmian words.
Eur. J. Comb.
Morteza Mohammad Noori, James D. Currie
2007 J jnl
On Abelian 2-avoidable binary patterns.
Acta Informatica
James D. Currie, Terry I. Visentin
2006 J jnl
Binary Words Containing Infinitely Many Overlaps.
Electron. J. Comb.
James D. Currie, Narad Rampersad, Jeffrey O. Shallit
2005 J jnl
Pattern avoidance: themes and variations.
Theor. Comput. Sci.
James D. Currie
2005 J jnl
The Thue-Morse word contains circular 5/2+ power free words of every length.
Theor. Comput. Sci.
Ali Aberkane, James D. Currie
2004 J jnl
The number of binary words avoiding abelian fourth powers grows exponentially.
Theor. Comput. Sci.
James D. Currie
2004 J jnl
There Exist Binary Circular 5/2
Electron. J. Comb.
Ali Aberkane, James D. Currie
2003 J jnl
A word on 7 letters which is non-repetitive up to mod 5.
Acta Informatica
James D. Currie, Erica Moodie
2003 J jnl
The Fixing Block Method in Combinatorics on Words.
Comb.
James D. Currie, Cameron W. Pierce
2003 J jnl
The set of k-power free words over sigma is empty or perfect, .
Eur. J. Comb.
James D. Currie, Robert O. Shelton
2003 — conf
What Is the Abelian Analogue of Dejean's Conjecture?
Grammars and Automata for String Processing
James D. Currie
2002 C conf
Circular Words Avoiding Patterns.
Developments in Language Theory
James D. Currie, D. Sean Fitzpatrick
2002 J jnl
Counting Endomorphisms of Crown-like Orders.
Order
James D. Currie, Terry I. Visentin
2002 J jnl
No iterated morphism generates any Arshon sequence of odd order.
Discret. Math.
James D. Currie
2002 J jnl
Non-Repetitive Tilings.
Electron. J. Comb.
James D. Currie, Jamie Simpson
2002 J jnl
There Are Ternary Circular Square-Free Words of Length n for n >= 18.
Electron. J. Comb.
James D. Currie
1999 J jnl
Separating Words with Small Grammars.
J. Autom. Lang. Comb.
James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit
1999 J jnl
Words Strongly Avoiding Fractional Powers.
Eur. J. Comb.
Julien Cassaigne, James D. Currie
1998 J jnl
Extremal Infinite Overlap-Free Binary Words.
Electron. J. Comb.
Jean-Paul Allouche, James D. Currie, Jeffrey O. Shallit
1996 J jnl
Cantor Sets and Dejean's Conjecture.
J. Autom. Lang. Comb.
James D. Currie, Robert O. Shelton
1996 J jnl
Non-Repetitive Words: Ages and Essences.
Comb.
James D. Currie
1995 J jnl
A Note on Antichains of Words.
Electron. J. Comb.
James D. Currie
1995 C conf
Cantor Sets and Dejean's Conjecture.
Developments in Language Theory
James D. Currie, Robert O. Shelton
1995 J jnl
On the structure and extendibility of k-power free words.
Eur. J. Comb.
James D. Currie
1992 J jnl
Connectivity of distance graphs.
Discret. Math.
James D. Currie
1991 J jnl
Which graphs allow infinite nonrepetitive walks?
Discret. Math.
James D. Currie
1987 — —
Non-repetitive walks in graphs and digraphs.
James D. Currie