The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Irène Durand: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Irène Durand, Aart Middeldorp
    Decidable Call by Need Computations in term Rewriting (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1997, pp:4-18 [Conf]
  2. Irène Durand, Aart Middeldorp
    On the Modularity of Deciding Call-by-Need. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:199-213 [Conf]
  3. Christian Percebois, Irène Durand, C. Simon
    COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog. [Citation Graph (0, 0)][DBLP]
    SPLT, 1985, pp:- [Conf]
  4. Christian Percebois, Ivan Futó, Irène Durand, C. Simon, B. Bonhoure
    Résolution parallèle de sous-buts indépendants dans le graphe de connexion de R. Kowalski. [Citation Graph (0, 0)][DBLP]
    SPLT, 1986, pp:553-570 [Conf]
  5. David Sherman, Robert Strandh, Irène Durand
    Optimization of Equational Programs Using Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    PEPM, 1991, pp:72-82 [Conf]
  6. Irène Durand
    Autowrite: A Tool for Checking Properties of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:371-375 [Conf]
  7. Irène Durand, David Sherman, Robert Strandh
    Partial Evaluation of an Intermediate Language for Equational Programs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:98-106 [Conf]
  8. Christian Percebois, Ivan Futó, Irène Durand, C. Simon, B. Bonhoure
    Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.2, 1987, pp:126-139 [Conf]
  9. Irène Durand
    A Tool for Term Rewrite Systems and Tree Automata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:124, n:2, pp:29-49 [Journal]
  10. Irène Durand, Aart Middeldorp
    Decidable call-by-need computations in term rewriting. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:196, n:2, pp:95-126 [Journal]
  11. Irène Durand, Bruno Salinier
    Constructor Equivalent Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:3, pp:131-137 [Journal]
  12. Irène Durand, Bruno Salinier
    Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:3, pp:137-145 [Journal]
  13. Irène Durand
    Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:18, n:4, pp:319-352 [Journal]
  14. Irène Durand, Géraud Sénizergues
    Bottom-Up Rewriting Is Inverse Recognizability Preserving. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:107-121 [Conf]

  15. Termination of linear bounded term rewriting systems. [Citation Graph (, )][DBLP]


  16. On the Complexity of Deciding Call-by-Need [Citation Graph (, )][DBLP]


  17. Bottom-up rewriting for words and terms [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002