James Currie 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	1343	421
h 指数	21	10
i10 指数	35	12

100

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320245 3 17 3 2 7 11 3 8 22 23 24 22 14 54 36 33 50 77 92 61 82 64 69 72 55 64 78 83 47 80 69

开放获取的出版物数量

查看全部

11 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Narad RampersadUniversity of Winnipeg在 uwinnipeg.ca 的电子邮件经过验证
Jeffrey ShallitProfessor of Computer Science, University of Waterloo在 cs.uwaterloo.ca 的电子邮件经过验证
Lucas MolAssistant Teaching Professor, Thompson Rivers University在 tru.ca 的电子邮件经过验证
Kalle SaariAdjunct Professor, University of Turku在 utu.fi 的电子邮件经过验证
Pascal OchemLIRMM - CNRS在 lirmm.fr 的电子邮件经过验证
Dirk NowotkaProfessor für Informatik, Christian-Albrechts-Universität zu Kiel在 zs.uni-kiel.de 的电子邮件经过验证
Morteza Mohammad-NooriUniversity of Tehran在 ut.ac.ir 的电子邮件经过验证
Jamie SimpsonMurdoch University在 curtin.edu.au 的电子邮件经过验证
Florin ManeaUniversity of Göttingen在 informatik.uni-goettingen.de 的电子邮件经过验证
Francine Blanchet-SadriProfessor, University of North Carolina-Greensboro在 uncg.edu 的电子邮件经过验证
Nathan FoxAssistant Professor of Mathematics and Statistics, Canisius College在 canisius.edu 的电子邮件经过验证
Kenneth Williams在 cunet.carleton.ca 的电子邮件经过验证
Bastian BischoffBosch Center for Artificial Intelligence在 de.bosch.com 的电子邮件经过验证
Luca ZamboniSaint Sauveur-en-Rue在 math.univ-lyon1.fr 的电子邮件经过验证
Erica EM MoodieMcGill University在 mcgill.ca 的电子邮件经过验证
Richard NowakowskiProfessor Emeritus, Mathematics, Dalhousie University, Nova Scotia, Canada在 dal.ca 的电子邮件经过验证
Aseem BaranwalUniversity of Waterloo在 uwaterloo.ca 的电子邮件经过验证

关注

James Currie

Mathematics and Statistics, University of Winnipeg

在 uwinnipeg.ca 的电子邮件经过验证

combinatorics on words history of mathematics graph theory ordered sets formal languages


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
A proof of Dejean’s conjecture J Currie, N Rampersad Mathematics of computation 80 (274), 1063-1070, 2011	110	2011
The metric dimension and metric independence of a graph J Currie, OR Oellerman The Charles Babbage Research Centre, 2001	110	2001
There are ternary circular square-free words of length n for n≥ 18 JD Currie The Electronic Journal of Combinatorics, 2002	94	2002
Pattern avoidance: themes and variations JD Currie Theoretical Computer Science 339 (1), 7-18, 2005	82	2005
Open problems in pattern avoidance J Currie The American mathematical monthly 100 (8), 790-793, 1993	76	1993
Dejean’s conjecture and Sturmian words M Mohammad-Noori, JD Currie European Journal of Combinatorics 28 (3), 876-890, 2007	72	2007
Avoiding three consecutive blocks of the same size and same sum J Cassaigne, JD Currie, L Schaeffer, J Shallit Journal of the ACM (JACM) 61 (2), 1-17, 2014	47	2014
Extremal infinite overlap-free binary words JP Allouche, J Currie, J Shallit the electronic journal of combinatorics, R27-R27, 1998	42	1998
Least periods of factors of infinite words JD Currie, K Saari RAIRO-Theoretical Informatics and Applications 43 (1), 165-178, 2009	40	2009
Dejean's conjecture holds for n≥ 27 J Currie, N Rampersad RAIRO-Theoretical Informatics and Applications 43 (4), 775-778, 2009	35	2009
Non-repetitive tilings JD Currie, J Simpson the electronic journal of combinatorics, R28-R28, 2002	28	2002
The number of ternary words avoiding abelian cubes grows exponentially. A Aberkane, JD Currie, N Rampersad Journal of Integer Sequences [electronic only] 7 (2), currie18. pdf, 2004	27	2004
A cyclic binary morphism avoiding abelian fourth powers JD Currie, A Aberkane Theoretical Computer Science 410 (1), 44-52, 2009	25	2009
Circular words avoiding patterns JD Currie, DS Fitzpatrick Developments in Language Theory: 6th International Conference, DLT 2002 …, 2003	24	2003
Avoiding patterns in the abelian sense J Currie, V Linek Canadian Journal of Mathematics 53 (4), 696-714, 2001	24	2001
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 11 F Blanchet-Sadri, JD Currie, N Rampersad, N Fox INTEGERS 14, A11, 2014	22	2014
The number of binary words avoiding abelian fourth powers grows exponentially JD Currie Theoretical computer science 319 (1-3), 441-446, 2004	22	2004
Fixed points avoiding Abelian k-powers JD Currie, N Rampersad Journal of Combinatorial Theory, Series A 119 (5), 942-948, 2012	21	2012
Long binary patterns are Abelian 2-avoidable JD Currie, TI Visentin Theoretical Computer Science 409 (3), 432-437, 2008	21	2008
Words strongly avoiding fractional powers J Cassaigne, JD Currie European Journal of Combinatorics 20 (8), 725-737, 1999	21	1999

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用