Jean-Claude Raoult

Publication Activity (10 Years)

Years Active: 1977-1999
Publications (10 Years): 0

Publications

Éric Badouel, Philippe Darondeau, Jean-Claude Raoult
Context-Free Event Domains are Recognizable. Inf. Comput. 149 (2) (1999)
Éric Badouel, Philippe Darondeau, Jean-Claude Raoult
Context-Free Event Domains are Recognizable. AMAST (1995)
Jean-Claude Raoult
Recursively Defined Tree Transductions. RTA (1993)
Jean-Claude Raoult, Frédéric Voisin
Set-Theoretic Graph Rewriting. Dagstuhl Seminar on Graph Transformations in Computer Science (1993)
Jean-Claude Raoult
Proving Open Properties by Induction. Inf. Process. Lett. 29 (1) (1988)
Jean-Claude Raoult
On Graph Rewritings. CAAP (1984)
Jean-Claude Raoult
On Graph Rewritings. Theor. Comput. Sci. 32 (1984)
Jean-Claude Raoult, Ravi Sethi
The Global Storage Needs of a Subcomputation. POPL (1984)
Jean-Claude Raoult, Ravi Sethi
Properties of a Notation for Combining Functions J. ACM 30 (3) (1983)
Jean-Claude Raoult
On graph rewritings. Bull. EATCS 21 (1983)
Jean-Claude Raoult, Ravi Sethi
Properties of a Notation for Combining Functions. ICALP (1982)
Jean-Claude Raoult
Finiteness Results on Rewriting Systems. RAIRO Theor. Informatics Appl. 15 (4) (1981)
Bruno Courcelle, Jean-Claude Raoult
Completions of ordered magmas. Fundam. Informaticae 3 (1) (1980)
Jean-Claude Raoult, Jean Vuillemin
Optimal Unbounded Search Strategies. ICALP (1980)
Jean-Claude Raoult, Jean Vuillemin
Operational and Semantic Equivalence Between Recursive Programs. J. ACM 27 (4) (1980)
Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
The Number of Registers Required for Evaluating Arithmetic Expressions. Theor. Comput. Sci. 9 (1979)
Jean-Claude Raoult, Jean Vuillemin
Operational and Semantic Equivalence between Recursive Programs STOC (1978)
Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
On the Average Number of Registers Required for Evaluating Arithmetic Expressions FOCS (1977)