On Dejean’s conjecture over large alphabets

Algebraic Combinatorics on Words

M. Lothaire · Cambridge University Press eBooks · 2002 · 1.8K citations

Natural Sciences, Computer Science, Mathematics +8

Encyclopedia of Mathematics

Choice Reviews Online · 2012 · 405 citations

Humanities, Mathematics, Religious Studies +6

Uniformly growing k-th power-free homomorphisms

Franz–Josef Brandenburg · Theoretical Computer Science · 1988 · 152 citations

Natural Sciences, High-performance Computing, Combinatorics +3

Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters

Jean Moulin Ollagnier · Theoretical Computer Science · 1992 · 76 citations

Natural Sciences, Mathematics, Combinatorics +1

Polynomial versus exponential growth in repetition-free binary words

Juhani Karhumäki, Jeffrey Shallit · Journal of Combinatorial Theory Series A · 2004 · 73 citations

Computing, Computer Science, Mathematics +8