James D. Currie

According to our database1, James D. Currie authored at least 55 papers between 1991 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Avoidance bases for formulas with reversal.
Theor. Comput. Sci., 2018

Unary patterns under permutations.
Theor. Comput. Sci., 2018

On avoidability of formulas with reversal.
RAIRO - Theor. Inf. and Applic., 2017

A family of formulas with reversal of high avoidability index.
IJAC, 2017

Growth rate of binary words avoiding xxxR.
Theor. Comput. Sci., 2016

Avoidability Index for Binary Patterns with Reversal.
Electr. J. Comb., 2016

A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$.
Electr. J. Comb., 2016

Unary Patterns with Permutations.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Avoiding Three Consecutive Blocks of the Same Size and Same Sum.
J. ACM, 2014

Extremal words in morphic subshifts.
Discrete Mathematics, 2014

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
Dagstuhl Reports, 2014

Square-free Words with Square-free Self-shuffles.
Electr. J. Comb., 2014

Infinite ternary square-free words concatenated from permutations of a single word.
Theor. Comput. Sci., 2013

Extremal Words in the Shift Orbit Closure of a Morphic Sequence.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract).
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

Fixed points avoiding Abelian k-powers.
J. Comb. Theory, Ser. A, 2012

Unary Patterns with involution.
Int. J. Found. Comput. Sci., 2012

Lexicographically least words in the orbit closure of the Rudin-Shapiro word.
Theor. Comput. Sci., 2011

A proof of Dejean's conjecture.
Math. Comput., 2011

Recurrent words with constant Abelian complexity.
Adv. Appl. Math., 2011

Infinite words containing squares at every position.
RAIRO - Theor. Inf. and Applic., 2010

Cubefree words with many squares.
Discrete Mathematics & Theoretical Computer Science, 2010

Dejean's conjecture holds for n>=30.
Theor. Comput. Sci., 2009

A cyclic binary morphism avoiding Abelian fourth powers.
Theor. Comput. Sci., 2009

Least Periods of Factors of Infinite Words.
ITA, 2009

Dejean's conjecture holds for $\sf {N\ge 27}$.
ITA, 2009

There are k-uniform cubefree binary morphisms for all k>=0.
Discrete Applied Mathematics, 2009

Long binary patterns are Abelian 2-avoidable.
Theor. Comput. Sci., 2008

Palindrome positions in ternary square-free words.
Theor. Comput. Sci., 2008

For each α > 2 there is an Infinite Binary Word with Critical Exponent α.
Electr. J. Comb., 2008

Dejean's conjecture and Sturmian words.
Eur. J. Comb., 2007

On Abelian 2-avoidable binary patterns.
Acta Inf., 2007

Binary Words Containing Infinitely Many Overlaps.
Electr. J. Comb., 2006

Pattern avoidance: themes and variations.
Theor. Comput. Sci., 2005

The Thue-Morse word contains circular 5/2+ power free words of every length.
Theor. Comput. Sci., 2005

The number of binary words avoiding abelian fourth powers grows exponentially.
Theor. Comput. Sci., 2004

There Exist Binary Circular 5/2+ Power Free Words of Every Length.
Electr. J. Comb., 2004

The set of k-power free words over sigma is empty or perfect, .
Eur. J. Comb., 2003

The Fixing Block Method in Combinatorics on Words.
Combinatorica, 2003

A word on 7 letters which is non-repetitive up to mod 5.
Acta Inf., 2003

What Is the Abelian Analogue of Dejean's Conjecture?
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

Counting Endomorphisms of Crown-like Orders.
Order, 2002

No iterated morphism generates any Arshon sequence of odd order.
Discrete Mathematics, 2002

Non-Repetitive Tilings.
Electr. J. Comb., 2002

There Are Ternary Circular Square-Free Words of Length n for n >= 18.
Electr. J. Comb., 2002

Circular Words Avoiding Patterns.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Separating Words with Small Grammars.
Journal of Automata, Languages and Combinatorics, 1999

Words Strongly Avoiding Fractional Powers.
Eur. J. Comb., 1999

Extremal Infinite Overlap-Free Binary Words.
Electr. J. Comb., 1998

Non-Repetitive Words: Ages and Essences.
Combinatorica, 1996

On the structure and extendibility of k-power free words.
Eur. J. Comb., 1995

A Note on Antichains of Words.
Electr. J. Comb., 1995

Cantor Sets and Dejean's Conjecture.
Proceedings of the Developments in Language Theory II, 1995

Connectivity of distance graphs.
Discrete Mathematics, 1992

Which graphs allow infinite nonrepetitive walks?
Discrete Mathematics, 1991