Sur la periodicite des mots. - Jean-Pierre Duval (1978)

Periodes et Repetitions des Mots du Monoide Libre. - Jean-Pierre Duval (Theor. Comput. Sci., 1979)

Mots de Lyndon et Périodicité. - Jean-Pierre Duval (RAIRO Theor. Informatics Appl., 1980)

Relationship between the period of a finite word and the length of its unbordered segments. - Jean-Pierre Duval (Discret. Math., 1982)

Factorizing Words over an Ordered Alphabet. - Jean-Pierre Duval (J. Algorithms, 1983)

Génération d'une Section des Classes de Conjugaison et Arbre des Mots de Lyndon de Longueur Bornée. - Jean-Pierre Duval (Theor. Comput. Sci., 1988)

Périodes locales et propagation de périodes dans un mot. - Jean-Pierre Duval (Theor. Comput. Sci., 1998)

Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words. - Jean-Pierre Duval; Laurent Mouchard (J. Autom. Lang. Comb., 1999)

Recurrence and periodicity in infinite words from local periods. - Jean-Pierre Duval; Filippo Mignosi; Antonio Restivo (Theor. Comput. Sci., 2001)

Words over an ordered alphabet and suffix permutations. - Jean-Pierre Duval; Arnaud Lefebvre (RAIRO Theor. Informatics Appl., 2002)

Linear-time computation of local periods. - Jean-Pierre Duval; Roman Kolpakov; Gregory Kucherov; Thierry Lecroq; Arnaud Lefebvre (Theor. Comput. Sci., 2004)

Border Array on Bounded Alphabet. - Jean-Pierre Duval; Thierry Lecroq; Arnaud Lefebvre (J. Autom. Lang. Comb., 2005)

Parsing with a finite dictionary. - Julien Clément 001; Jean-Pierre Duval; Giovanna Guaiana; Dominique Perrin; Giuseppina Rindone (Theor. Comput. Sci., 2005)

Unbordered factors and Lyndon words. - Jean-Pierre Duval; Tero Harju; Dirk Nowotka (Discret. Math., 2008)

Efficient validation and construction of border arrays and validation of string matching automata. - Jean-Pierre Duval; Thierry Lecroq; Arnaud Lefebvre (RAIRO Theor. Informatics Appl., 2009)

Linear computation of unbordered conjugate on unordered alphabet. - Jean-Pierre Duval; Thierry Lecroq; Arnaud Lefebvre (Theor. Comput. Sci., 2014)