The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Claude Raoult: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eric Badouel, Philippe Darondeau, Jean-Claude Raoult
    Context-Free Event Domains are Recognizable. [Citation Graph (0, 0)][DBLP]
    AMAST, 1995, pp:214-229 [Conf]
  2. Jean-Claude Raoult
    On Graph Rewritings. [Citation Graph (0, 0)][DBLP]
    CAAP, 1984, pp:243-256 [Conf]
  3. Jean-Claude Raoult, Frédéric Voisin
    Set-Theoretic Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:312-325 [Conf]
  4. Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
    On the Average Number of Registers Required for Evaluating Arithmetic Expressions [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:196-205 [Conf]
  5. Jean-Claude Raoult, Ravi Sethi
    Properties of a Notation for Combining Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:429-441 [Conf]
  6. Jean-Claude Raoult, Jean Vuillemin
    Optimal Unbounded Search Strategies. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:512-530 [Conf]
  7. Jean-Claude Raoult, Ravi Sethi
    The Global Storage Needs of a Subcomputation. [Citation Graph (0, 0)][DBLP]
    POPL, 1984, pp:148-157 [Conf]
  8. Jean-Claude Raoult
    Recursively Defined Tree Transductions. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:343-357 [Conf]
  9. Jean-Claude Raoult, Jean Vuillemin
    Operational and Semantic Equivalence between Recursive Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:75-85 [Conf]
  10. Jean-Claude Raoult
    On graph rewritings. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1983, v:21, n:, pp:39-48 [Journal]
  11. Bruno Courcelle, Jean-Claude Raoult
    Completions of ordered magmas. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:1, pp:105-0 [Journal]
  12. Eric Badouel, Philippe Darondeau, Jean-Claude Raoult
    Context-Free Event Domains are Recognizable. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:149, n:2, pp:134-172 [Journal]
  13. Jean-Claude Raoult
    Proving Open Properties by Induction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:1, pp:19-23 [Journal]
  14. Jean-Claude Raoult
    Finiteness Results on Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1981, v:15, n:4, pp:373-391 [Journal]
  15. Jean-Claude Raoult, Ravi Sethi
    Properties of a Notation for Combining Functions [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:595-611 [Journal]
  16. Jean-Claude Raoult, Jean Vuillemin
    Operational and Semantic Equivalence Between Recursive Programs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:772-796 [Journal]
  17. Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
    The Number of Registers Required for Evaluating Arithmetic Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:99-125 [Journal]
  18. Jean-Claude Raoult
    On Graph Rewritings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:1-24 [Journal]

Search in 0.005secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002