The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anne-Cécile Caron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anne-Cécile Caron
    Decidability of Reachability and Disjoint Union of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:86-101 [Conf]
  2. Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos
    Indexes and Path Constraints in Semistructured Data. [Citation Graph (0, 0)][DBLP]
    DEXA Workshops, 2005, pp:837-841 [Conf]
  3. Yves Andre, Francis Bossut, Anne-Cécile Caron
    On decidability of boundedness property for regular path queries. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:245-256 [Conf]
  4. Anne-Cécile Caron, Denis Debarbieux, Yves Roos
    Modèles de données semi-structurées et contraintes d'inclusion. [Citation Graph (0, 0)][DBLP]
    EGC, 2003, pp:461-472 [Conf]
  5. Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
    Pumping, Cleaning and Symbolic Constraints Solving. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:436-449 [Conf]
  6. Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
    Extraction and Implication of Path Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:863-875 [Conf]
  7. Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet
    Encompassment Properties and Automata with Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:328-342 [Conf]
  8. Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi
    Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:103-117 [Conf]
  9. Anne-Cécile Caron
    Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:74-89 [Conf]
  10. Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé
    Automata for Reduction Properties Solving. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:2, pp:215-233 [Journal]
  11. Anne-Cécile Caron, Jean-Luc Coquidé
    Decidability of Reachability for Disjoint Union of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:126, n:1, pp:31-52 [Journal]
  12. Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
    Path constraints in semistructured data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:11-33 [Journal]

  13. XML Security Views Revisited. [Citation Graph (, )][DBLP]


  14. Complexity of Earliest Query Answering with Streaming Tree Automata. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
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