The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Catherine Dufourd: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Are Timed Automata Updatable? [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:464-479 [Conf]
  2. Catherine Dufourd, Alain Finkel
    Polynomial-Time Manz-One Reductions for Petri Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:312-326 [Conf]
  3. Catherine Dufourd, Alain Finkel, Ph. Schnoebelen
    Reset Nets Between Decidability and Undecidability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:103-115 [Conf]
  4. Catherine Dufourd, Petr Jancar, Ph. Schnoebelen
    Boundedness of Reset P/T Nets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:301-310 [Conf]
  5. Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo
    An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:220-224 [Conf]
  6. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Expressiveness of Updatable Timed Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:232-242 [Conf]
  7. Béatrice Bérard, Catherine Dufourd
    Timed automata and additive clock constraints. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:1-2, pp:1-7 [Journal]
  8. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Updatable timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:291-345 [Journal]
  9. Catherine Dufourd, Alain Finkel
    A Polynomial-Bisimilar Normalization for Reset Petri Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:222, n:1-2, pp:187-194 [Journal]

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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002