Growth properties of power-free languages

Depth-First Search and Linear Graph Algorithms

Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations

Computing, Computer Science, Algorithms +16

Algebraic Combinatorics on Words

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

Natural Sciences, Computer Science, Mathematics +8

The mathematical theory of context-free languages

H. P. Edmundson · Information Storage and Retrieval · 1967 · 738 citations

Computing, Computer Science, Mathematics +11

Uniformly growing k-th power-free homomorphisms

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

Natural Sciences, High-performance Computing, Combinatorics +3

Nonrepetitive colorings of graphs

Noga Alon, Jarosław Grytczuk, Mariusz Hałuszczak et al. · Random Structures and Algorithms · 2002 · 140 citations

Natural Sciences, Computer Science, Mathematics +12