default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Pierre Duval
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j15]Jean-Pierre Duval, Thierry Lecroq
, Arnaud Lefebvre:
Linear computation of unbordered conjugate on unordered alphabet. Theor. Comput. Sci. 522: 77-84 (2014)
2000 – 2009
- 2009
- [j14]Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Efficient validation and construction of border arrays and validation of string matching automata. RAIRO Theor. Informatics Appl. 43(2): 281-297 (2009) - 2008
- [j13]Jean-Pierre Duval, Tero Harju, Dirk Nowotka:
Unbordered factors and Lyndon words. Discret. Math. 308(11): 2261-2264 (2008) - 2005
- [j12]Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Border Array on Bounded Alphabet. J. Autom. Lang. Comb. 10(1): 51-60 (2005) - [j11]Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone:
Parsing with a finite dictionary. Theor. Comput. Sci. 340(1): 432-442 (2005) - 2004
- [j10]Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3): 229-240 (2004) - 2003
- [c2]Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
Linear-Time Computation of Local Periods. MFCS 2003: 388-397 - 2002
- [j9]Jean-Pierre Duval, Arnaud Lefebvre:
Words over an ordered alphabet and suffix permutations. RAIRO Theor. Informatics Appl. 36(3): 249-259 (2002) - [c1]Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Border Array on Bounded Alphabet. Stringology 2002: 28-35 - 2001
- [j8]Jean-Pierre Duval, Filippo Mignosi, Antonio Restivo:
Recurrence and periodicity in infinite words from local periods. Theor. Comput. Sci. 262(1): 269-284 (2001)
1990 – 1999
- 1999
- [j7]Jean-Pierre Duval, Laurent Mouchard:
Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words. J. Autom. Lang. Comb. 4(3): 205-211 (1999) - 1998
- [j6]Jean-Pierre Duval:
Périodes locales et propagation de périodes dans un mot. Theor. Comput. Sci. 204(1-2): 87-98 (1998)
1980 – 1989
- 1988
- [j5]Jean-Pierre Duval:
Génération d'une Section des Classes de Conjugaison et Arbre des Mots de Lyndon de Longueur Bornée. Theor. Comput. Sci. 60: 255-283 (1988) - 1983
- [j4]Jean-Pierre Duval:
Factorizing Words over an Ordered Alphabet. J. Algorithms 4(4): 363-381 (1983) - 1982
- [j3]Jean-Pierre Duval:
Relationship between the period of a finite word and the length of its unbordered segments. Discret. Math. 40(1): 31-44 (1982) - 1980
- [j2]Jean-Pierre Duval:
Mots de Lyndon et Périodicité. RAIRO Theor. Informatics Appl. 14(2): 181-191 (1980)
1970 – 1979
- 1979
- [j1]Jean-Pierre Duval:
Periodes et Repetitions des Mots du Monoide Libre. Theor. Comput. Sci. 9: 17-26 (1979) - 1978
- [b1]Jean-Pierre Duval:
Sur la periodicite des mots. Univ. Rouen, 1978
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
