The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

James D. Currie: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James D. Currie
    What Is the Abelian Analogue of Dejean's Conjecture? [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:237-242 [Conf]
  2. James D. Currie, D. Sean Fitzpatrick
    Circular Words Avoiding Patterns. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:319-325 [Conf]
  3. James D. Currie, Robert O. Shelton
    Cantor Sets and Dejean's Conjecture. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:35-43 [Conf]
  4. James D. Currie, Erica Moodie
    A word on 7 letters which is non-repetitive up to mod 5. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:39, n:6-7, pp:451-468 [Journal]
  5. James D. Currie
    Non-Repetitive Words: Ages and Essences. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:19-40 [Journal]
  6. James D. Currie, Cameron W. Pierce
    The Fixing Block Method in Combinatorics on Words. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:4, pp:571-584 [Journal]
  7. Ali Aberkane, James D. Currie
    There Exist Binary Circular 5/2+; Power Free Words of Every Length. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  8. Jean-Paul Allouche, James D. Currie, Jeffrey Shallit
    Extremal Infinite Overlap-Free Binary Words. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  9. James D. Currie
    There Are Ternary Circular Square-Free Words of Length n for n >= 18. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  10. James D. Currie
    A Note on Antichains of Words. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  11. James D. Currie, Jamie Simpson
    Non-Repetitive Tilings. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  12. James D. Currie
    No iterated morphism generates any Arshon sequence of odd order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:277-283 [Journal]
  13. Julien Cassaigne, James D. Currie
    Words Strongly Avoiding Fractional Powers. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:8, pp:725-737 [Journal]
  14. James D. Currie, Robert O. Shelton
    The set of k-power free words over sigma is empty or perfect, . [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:5, pp:573-580 [Journal]
  15. M. Mohammad-Noori, James D. Currie
    Dejean's conjecture and Sturmian words. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:3, pp:876-890 [Journal]
  16. James D. Currie, Holger Petersen, John Michael Robson, Jeffrey Shallit
    Seperating Words with Small Grammars. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:2, pp:101-110 [Journal]
  17. James D. Currie, Robert O. Shelton
    Cantor Sets and Dejean's Conjecture. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1996, v:1, n:2, pp:113-128 [Journal]
  18. James D. Currie, Terry I. Visentin
    Counting Endomorphisms of Crown-like Orders. [Citation Graph (0, 0)][DBLP]
    Order, 2002, v:19, n:4, pp:305-317 [Journal]
  19. Ali Aberkane, James D. Currie
    The Thue-Morse word contains circular 5/2+ power free words of every length. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:573-581 [Journal]
  20. James D. Currie
    The number of binary words avoiding abelian fourth powers grows exponentially. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:441-446 [Journal]
  21. James D. Currie
    Pattern avoidance: themes and variations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:1, pp:7-18 [Journal]
  22. James D. Currie, Terry I. Visentin
    On Abelian 2-avoidable binary patterns. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:43, n:8, pp:521-533 [Journal]
  23. James D. Currie
    Which graphs allow infinite nonrepetitive walks? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:3, pp:249-260 [Journal]
  24. James D. Currie
    Connectivity of distance graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:1, pp:91-94 [Journal]

  25. Binary Words Containing Infinitely Many Overlaps. [Citation Graph (, )][DBLP]


  26. The lexicographically least word in the orbit closure of the Rudin-Shapiro word [Citation Graph (, )][DBLP]


  27. A proof of Dejean's conjecture [Citation Graph (, )][DBLP]


  28. There are k-uniform cubefree binary morphisms for all k>=0. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002