James D. Currie

VLDB 2026 Research / reviewers in the wild / expert

dblp:59/946 · DBLP profile ↗

← Back

24ranked-venue papers

22as first author

3since 2021 · last 2024

0000-0002-0061-3849ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 23 · 22 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1

Year	Publication	Venue	Position
2024	Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers abstract Abstract. We construct an infinite binary word with critical exponent 3 that avoids abelian 4-powers. Our method gives an algorithm to determine whether certain types of morphic sequences avoid additive powers. We also show that there are [Formula: see text] binary words of length [Formula: see text] that avoid abelian 4-powers, which improves on previous estimates. James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey Shallit	SIAM J. Discret. Math.	1
2021	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.	1
2021	The undirected repetition threshold and undirected pattern avoidance James D. Currie, Lucas Mol	Theor. Comput. Sci.	1
2019	Some further results on squarefree arithmetic progressions in infinite words James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad	Theor. Comput. Sci.	1
2018	Unary patterns under permutations James D. Currie, Florin Manea, Dirk Nowotka, Kamellia Reshadi	Theor. Comput. Sci.	1
2018	Avoidance bases for formulas with reversal James D. Currie, Lucas Mol, Narad Rampersad	Theor. Comput. Sci.	1
2016	Growth rate of binary words avoiding xxxR James D. Currie, Narad Rampersad	Theor. Comput. Sci.	1
2015	Unary Patterns with Permutations James D. Currie, Florin Manea, Dirk Nowotka	DLT	1
2014	Avoiding Three Consecutive Blocks of the Same Size and Same Sum abstract We show that there exists an infinite word over the alphabet {0, 1, 3, 4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from 1994. Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey Shallit	J. ACM	2
2013	Extremal Words in the Shift Orbit Closure of a Morphic Sequence James D. Currie, Narad Rampersad, Kalle Saari	Developments in Language Theory	1
2013	Infinite ternary square-free words concatenated from permutations of a single word James D. Currie	Theor. Comput. Sci.	1
2011	Lexicographically least words in the orbit closure of the Rudin-Shapiro word James D. Currie	Theor. Comput. Sci.	1
2009	There are k-uniform cubefree binary morphisms for all k>=0 James D. Currie, Narad Rampersad	Discret. Appl. Math.	1
2009	A cyclic binary morphism avoiding Abelian fourth powers James D. Currie, Ali Aberkane	Theor. Comput. Sci.	1
2009	Dejean's conjecture holds for n>=30 James D. Currie, Narad Rampersad	Theor. Comput. Sci.	1
2008	Palindrome positions in ternary square-free words James D. Currie	Theor. Comput. Sci.	1
2008	Long binary patterns are Abelian 2-avoidable James D. Currie, Terry I. Visentin	Theor. Comput. Sci.	1
2007	On Abelian 2-avoidable binary patterns James D. Currie, Terry I. Visentin	Acta Informatica	1
2005	The Thue-Morse word contains circular 5/2+ power free words of every length Ali Aberkane, James D. Currie	Theor. Comput. Sci.	2
2005	Pattern avoidance: themes and variations James D. Currie	Theor. Comput. Sci.	1
2004	The number of binary words avoiding abelian fourth powers grows exponentially James D. Currie	Theor. Comput. Sci.	1
2003	A word on 7 letters which is non-repetitive up to mod 5 James D. Currie, Erica Moodie	Acta Informatica	1
2002	Circular Words Avoiding Patterns James D. Currie, D. Sean Fitzpatrick	Developments in Language Theory	1
1995	Cantor Sets and Dejean's Conjecture James D. Currie, Robert O. Shelton	Developments in Language Theory	1