default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Claude Raoult
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
[j9]Éric Badouel, Philippe Darondeau, Jean-Claude Raoult:
Context-Free Event Domains are Recognizable. Inf. Comput. 149(2): 134-172 (1999)- 1995
- [c9]Éric Badouel, Philippe Darondeau, Jean-Claude Raoult:
Context-Free Event Domains are Recognizable. AMAST 1995: 214-229 - 1993
- [c8]Jean-Claude Raoult, Frédéric Voisin:
Set-Theoretic Graph Rewriting. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 312-325 - [c7]Jean-Claude Raoult:
Recursively Defined Tree Transductions. RTA 1993: 343-357 - 1992
- [p1]Jean-Claude Raoult:
A survey of tree transductions. Tree Automata and Languages 1992: 311-326 - [e1]Jean-Claude Raoult:
CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings. Lecture Notes in Computer Science 581, Springer 1992, ISBN 3-540-55251-0 [contents]
1980 – 1989
- 1988
- [j8]Jean-Claude Raoult:
Proving Open Properties by Induction. Inf. Process. Lett. 29(1): 19-23 (1988) - 1984
- [j7]Jean-Claude Raoult:
On Graph Rewritings. Theor. Comput. Sci. 32: 1-24 (1984) - [c6]Jean-Claude Raoult:
On Graph Rewritings. CAAP 1984: 243-256 - [c5]Jean-Claude Raoult, Ravi Sethi:
The Global Storage Needs of a Subcomputation. POPL 1984: 148-157 - 1983
- [j6]Jean-Claude Raoult:
On graph rewritings. Bull. EATCS 21: 39-48 (1983) - [j5]Jean-Claude Raoult, Ravi Sethi:
Properties of a Notation for Combining Functions. J. ACM 30(3): 595-611 (1983) - 1982
- [c4]Jean-Claude Raoult, Ravi Sethi:
Properties of a Notation for Combining Functions. ICALP 1982: 429-441 - 1981
- [j4]Jean-Claude Raoult:
Finiteness Results on Rewriting Systems. RAIRO Theor. Informatics Appl. 15(4): 373-391 (1981) - 1980
- [j3]Bruno Courcelle, Jean-Claude Raoult:
Completions of ordered magmas. Fundam. Informaticae 3(1): 105- (1980) - [j2]Jean-Claude Raoult, Jean Vuillemin:
Operational and Semantic Equivalence Between Recursive Programs. J. ACM 27(4): 772-796 (1980) - [c3]Jean-Claude Raoult, Jean Vuillemin:
Optimal Unbounded Search Strategies. ICALP 1980: 512-530
1970 – 1979
- 1979
- [j1]Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin:
The Number of Registers Required for Evaluating Arithmetic Expressions. Theor. Comput. Sci. 9: 99-125 (1979) - 1978
- [c2]Jean-Claude Raoult, Jean Vuillemin:
Operational and Semantic Equivalence between Recursive Programs. STOC 1978: 75-85 - 1977
- [c1]Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin:
On the Average Number of Registers Required for Evaluating Arithmetic Expressions. FOCS 1977: 196-205
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 2025-01-09 12:45 CET 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:
