James D. Currie Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Infinite ternary square-free words concatenated from permutations of a single word. Theor. Comput. Sci. 482: 1-8 (2013)
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad, Kalle Saari: Extremal words in the shift orbit closure of a morphic sequence. CoRR abs/1301.4972 (2013)
2012
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bastian Bischoff, James D. Currie, Dirk Nowotka: Unary Patterns with involution. Int. J. Found. Comput. Sci. 23(8): 1641-1652 (2012)
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: Fixed points avoiding Abelian k-powers. J. Comb. Theory, Ser. A 119(5): 942-948 (2012)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Infinite ternary square-free words concatenated from permutations of a single word. CoRR abs/1207.3445 (2012)
2011
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: A proof of Dejean's conjecture. Math. Comput. 80(274): 1063-1070 (2011)
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Lexicographically least words in the orbit closure of the Rudin-Shapiro word. Theor. Comput. Sci. 412(35): 4742-4746 (2011)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Pattern avoidance with involution. CoRR abs/1105.2849 (2011)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: Fixed points avoiding Abelian $k$-powers. CoRR abs/1106.1842 (2011)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey Shallit: Avoiding Three Consecutive Blocks of the Same Size and Same Sum. CoRR abs/1106.5204 (2011)
2010
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: Cubefree words with many squares. Discrete Mathematics & Theoretical Computer Science 12(3): 29-34 (2010)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: Infinite words containing squares at every position. RAIRO - Theor. Inf. and Applic. 44(1): 113-124 (2010)
2009
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: There are k-uniform cubefree binary morphisms for all k>=0. Discrete Applied Mathematics 157(11): 2548-2551 (2009)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Kalle Saari: Least Periods of Factors of Infinite Words. ITA 43(1): 165-178 (2009)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: Dejean's conjecture holds for $\sf {N\ge 27}$. ITA 43(4): 775-778 (2009)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Ali Aberkane: A cyclic binary morphism avoiding Abelian fourth powers. Theor. Comput. Sci. 410(1): 44-52 (2009)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: Dejean's conjecture holds for n>=30. Theor. Comput. Sci. 410(30-32): 2885-2888 (2009)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: A proof of Dejean's conjecture. CoRR abs/0905.1129 (2009)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: The lexicographically least word in the orbit closure of the Rudin-Shapiro word. CoRR abs/0905.4923 (2009)
2008
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad: For each α > 2 there is an Infinite Binary Word with Critical Exponent α. Electr. J. Comb. 15(1) (2008)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Palindrome positions in ternary square-free words. Theor. Comput. Sci. 396(1-3): 254-257 (2008)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Terry I. Visentin: Long binary patterns are Abelian 2-avoidable. Theor. Comput. Sci. 409(3): 432-437 (2008)
2007
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Terry I. Visentin: On Abelian 2-avoidable binary patterns. Acta Inf. 43(8): 521-533 (2007)
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
M. Mohammad-Noori, James D. Currie: Dejean's conjecture and Sturmian words. Eur. J. Comb. 28(3): 876-890 (2007)
2006
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Narad Rampersad, Jeffrey Shallit: Binary Words Containing Infinitely Many Overlaps. Electr. J. Comb. 13(1) (2006)
2005
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ali Aberkane, James D. Currie: The Thue-Morse word contains circular 5/2+ power free words of every length. Theor. Comput. Sci. 332(1-3): 573-581 (2005)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Pattern avoidance: themes and variations. Theor. Comput. Sci. 339(1): 7-18 (2005)
2004
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ali Aberkane, James D. Currie: There Exist Binary Circular 5/2+ Power Free Words of Every Length. Electr. J. Comb. 11(1) (2004)
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: The number of binary words avoiding abelian fourth powers grows exponentially. Theor. Comput. Sci. 319(1-3): 441-446 (2004)
2003
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Erica Moodie: A word on 7 letters which is non-repetitive up to mod 5. Acta Inf. 39(6-7): 451-468 (2003)
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Cameron W. Pierce: The Fixing Block Method in Combinatorics on Words. Combinatorica 23(4): 571-584 (2003)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Robert O. Shelton: The set of k-power free words over sigma is empty or perfect, . Eur. J. Comb. 24(5): 573-580 (2003)
c3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: What Is the Abelian Analogue of Dejean's Conjecture? Grammars and Automata for String Processing 2003: 237-242
2002
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: There Are Ternary Circular Square-Free Words of Length n for n >= 18. Electr. J. Comb. 9(1) (2002)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Jamie Simpson: Non-Repetitive Tilings. Electr. J. Comb. 9(1) (2002)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: No iterated morphism generates any Arshon sequence of odd order. Discrete Mathematics 259(1-3): 277-283 (2002)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Terry I. Visentin: Counting Endomorphisms of Crown-like Orders. Order 19(4): 305-317 (2002)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, D. Sean Fitzpatrick: Circular Words Avoiding Patterns. Developments in Language Theory 2002: 319-325
1999
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Julien Cassaigne, James D. Currie: Words Strongly Avoiding Fractional Powers. Eur. J. Comb. 20(8): 725-737 (1999)
j7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Holger Petersen, John Michael Robson, Jeffrey Shallit: Separating Words with Small Grammars. Journal of Automata, Languages and Combinatorics 4(2): 101-110 (1999)
1998
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jean-Paul Allouche, James D. Currie, Jeffrey Shallit: Extremal Infinite Overlap-Free Binary Words. Electr. J. Comb. 5 (1998)
1996
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Non-Repetitive Words: Ages and Essences. Combinatorica 16(1): 19-40 (1996)
j4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Robert O. Shelton: Cantor Sets and Dejean's Conjecture. Journal of Automata, Languages and Combinatorics 1(2): 113-128 (1996)
1995
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: A Note on Antichains of Words. Electr. J. Comb. 2 (1995)
c1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie, Robert O. Shelton: Cantor Sets and Dejean's Conjecture. Developments in Language Theory 1995: 35-43
1992
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Connectivity of distance graphs. Discrete Mathematics 103(1): 91-94 (1992)
1991
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
James D. Currie: Which graphs allow infinite nonrepetitive walks? Discrete Mathematics 87(3): 249-260 (1991)

Coauthor Index

1Ali Aberkane
[j27] [j19] [j17]
2Jean-Paul Allouche
[j6]
3Bastian Bischoff
[j36]
4Julien Cassaigne
[i3] [j8]
5D. Sean Fitzpatrick
[c2]
6M. Mohammad-Noori
[j21]
7Erica Moodie
[j15]
8Dirk Nowotka
[j36]
9Holger Petersen
[j7]
10Cameron W. Pierce
[j14]
11Narad Rampersad
[i7] [j35] [j34] [i4] [j32] [j31] [j30] [j28] [j26] [i2] [j25] [j20]
12John Michael Robson (J. M. Robson)
[j7]
13Kalle Saari
[i7] [j29]
14Luke Schaeffer
[i3]
15Jeffrey Shallit (Jeffrey O. Shallit)
[i3] [j20] [j7] [j6]
16Robert O. Shelton
[j13] [j4] [c1]
17Jamie Simpson
[j11]
18Terry I. Visentin
[j23] [j22] [j9]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Mon May 20 16:25:28 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page