default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Néraud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Jean Néraud
:
Topologies for error-detecting variable-length codes. Inf. Comput. 295(Part B): 105092 (2023)- [j21]Jean Néraud:
Loopless algorithms to generate maximum length gray cycles wrt. k-character substitutions. Theor. Comput. Sci. 977: 114175 (2023) - [i9]Jean Néraud:
Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution. CoRR abs/2309.01556 (2023) - [i8]Jean Néraud:
Topologies for Error-Detecting Variable-Length Codes. CoRR abs/2309.01997 (2023) - 2022
- [j20]Jean Néraud:
Variable-length codes independent or closed with respect to edit relations. Inf. Comput. 288: 104747 (2022) - [c11]Jean Néraud:
When Variable-Length Codes Meet the Field of Error Detection. CAI 2022: 203-222 - [i7]Jean Néraud:
When Variable-Length Codes Meet the Field of Error Detection. CoRR abs/2208.14681 (2022) - 2021
- [c10]Jean Néraud:
Gray Cycles of Maximum Length Related to k-Character Substitutions. DCFS 2021: 137-149 - [i6]Jean Néraud:
Variable-Length Codes Independent or Closed with respect to Edit Relations. CoRR abs/2104.14185 (2021) - [i5]Jean Néraud:
Gray Cycles of Maximum Length Related to k-Character Substitutions. CoRR abs/2108.13659 (2021) - 2020
- [j19]Jean Néraud, Carla Selmi:
Embedding a θ-invariant code into a complete one. Theor. Comput. Sci. 806: 28-41 (2020) - [c9]Jean Néraud:
Complete Variable-Length Codes: An Excursion into Word Edit Operations. LATA 2020: 437-448
2010 – 2019
- 2019
- [i4]Jean Néraud:
Complete Variable-Length Codes: An Excursion into Word Edit Operations. CoRR abs/1912.02646 (2019) - 2018
- [j18]Jean Néraud:
Conferences WORDS, years 1997-2017: Open Problems and Conjectures. Bull. EATCS 125 (2018) - [i3]Jean Néraud, Carla Selmi:
Embedding a θ-invariant code into a complete one. CoRR abs/1801.05164 (2018) - 2017
- [c8]Jean Néraud, Carla Selmi:
Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. WORDS 2017: 214-227 - [i2]Jean Néraud:
Ten Conferences WORDS: Open Problems and Conjectures. CoRR abs/1705.04055 (2017) - [i1]Jean Néraud, Carla Selmi:
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. CoRR abs/1705.05564 (2017) - 2016
- [j17]Jean Néraud:
Ten Conferences WORDS and their Contribution to the Field of Combinatorics on WORDS. Bull. EATCS 118 (2016) - 2015
- [j16]Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi:
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Int. J. Found. Comput. Sci. 26(6): 733-750 (2015) - [c7]Jean Néraud:
On the Contribution of WORDS to the Field of Combinatorics on Words. WORDS 2015: 27-34 - 2012
- [c6]Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi:
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Developments in Language Theory 2012: 471-476
2000 – 2009
- 2008
- [j15]Jean Néraud:
Completing circular codes in regular submonoids. Theor. Comput. Sci. 391(1-2): 90-98 (2008) - 2006
- [j14]Jean Néraud:
On the Completion of Codes in Submonoids with Finite Rank. Fundam. Informaticae 74(4): 549-562 (2006) - [j13]Jean Néraud:
Completing prefix codes in submonoids. Theor. Comput. Sci. 356(1-2): 245-254 (2006) - 2004
- [j12]Jean Néraud, Carla Selmi:
A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*. J. Autom. Lang. Comb. 9(1): 103-110 (2004) - [c5]Jean Néraud:
Completing a Code in a Regular Submonoid of the Free Monoid. MCU 2004: 281-291 - 2003
- [j11]Jean Néraud, Carla Selmi:
Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids. Int. J. Algebra Comput. 13(5): 507-516 (2003) - 2002
- [j10]Jean Néraud:
WORDS '99 - Preface. Theor. Comput. Sci. 273(1-2): 1-3 (2002) - [j9]Jean Néraud, Carla Selmi:
Locally complete sets and finite decomposable codes. Theor. Comput. Sci. 273(1-2): 185-196 (2002) - 2001
- [j8]Jean Néraud, Carla Selmi:
On codes with a finite deciphering delay: constructing uncompletable words. Theor. Comput. Sci. 255(1-2): 151-162 (2001)
1990 – 1999
- 1997
- [j7]Jean Néraud:
Detecting the Morphic Images of a Word: Improving the General Algorithm. RAIRO Theor. Informatics Appl. 31(1): 1-14 (1997) - 1995
- [j6]Jean Néraud:
Detecting Morphic Images of a Word on the Rank of a Pattern. Acta Informatica 32(5): 477-489 (1995) - [j5]Jean Néraud:
Algorithms for Detecting Morphic Images of a Word. Inf. Comput. 120(1): 126-148 (1995) - 1993
- [j4]Jean Néraud:
Deciding Whether a Finite Set of Words has Rank at Most Two. Theor. Comput. Sci. 112(2): 311-337 (1993) - [c4]Jean Néraud:
New Algorithms for Detecting Morphic Images of a Word. MFCS 1993: 588-597 - 1992
- [j3]Jean Néraud, Maxime Crochemore:
A String-Matching Interpretation of the Equation xmyn = zp. Theor. Comput. Sci. 92(1): 145-164 (1992) - [j2]Jean Néraud:
On the Rank of the Subsets of a Free Monoid. Theor. Comput. Sci. 99(2): 231-241 (1992) - 1991
- [c3]Jean Néraud:
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). FCT 1991: 360-369 - [c2]Jean Néraud:
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm. IWWERT 1991: 187-196 - 1990
- [j1]Jean Néraud:
Elementariness of a finite set of words is co-NP-complete. RAIRO Theor. Informatics Appl. 24: 459-470 (1990) - [c1]Maxime Crochemore, Jean Néraud:
Unitary Monoid with Two Generators: An Algorithmic Point of View. CAAP 1990: 117-131
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:58 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:
