On the Average Number of Registers Required for Evaluating Arithmetic Expressions - Philippe Flajolet; Jean-Claude Raoult; Jean Vuillemin (FOCS, 1977)

The Number of Registers Required for Evaluating Arithmetic Expressions. - Philippe Flajolet; Jean-Claude Raoult; Jean Vuillemin (Theor. Comput. Sci., 1979)

Optimal Unbounded Search Strategies. - Jean-Claude Raoult; Jean Vuillemin (ICALP, 1980)

Completions of ordered magmas. - Bruno Courcelle; Jean-Claude Raoult (Fundam. Informaticae, 1980)

Operational and Semantic Equivalence Between Recursive Programs. - Jean-Claude Raoult; Jean Vuillemin (J. ACM, 1980)

Finiteness Results on Rewriting Systems. - Jean-Claude Raoult (RAIRO Theor. Informatics Appl., 1981)

Properties of a Notation for Combining Functions - Jean-Claude Raoult; Ravi Sethi (J. ACM, 1983)

The Global Storage Needs of a Subcomputation. - Jean-Claude Raoult; Ravi Sethi (POPL, 1984)

On Graph Rewritings. - Jean-Claude Raoult (Theor. Comput. Sci., 1984)

Proving Open Properties by Induction. - Jean-Claude Raoult (Inf. Process. Lett., 1988)

A survey of tree transductions. - Jean-Claude Raoult (Tree Automata and Languages, 1992)

Set-Theoretic Graph Rewriting. - Jean-Claude Raoult; Frédéric Voisin (Dagstuhl Seminar on Graph Transformations in Computer Science, 1993)

Recursively Defined Tree Transductions. - Jean-Claude Raoult (RTA, 1993)

Context-Free Event Domains are Recognizable. - Éric Badouel; Philippe Darondeau; Jean-Claude Raoult (Inf. Comput., 1999)