An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. - Christophe Cérin; Catherine Dufourd; Jean Frédéric Myoupo (ICCI, 1993)

Polynomial-Time Manz-One Reductions for Petri Nets. - Catherine Dufourd; Alain Finkel (FSTTCS, 1997)

Reset Nets Between Decidability and Undecidability. - Catherine Dufourd; Alain Finkel; Philippe Schnoebelen (ICALP, 1998)

Boundedness of Reset P/T Nets. - Catherine Dufourd; Petr Jancar; Philippe Schnoebelen (ICALP, 1999)

A Polynomial-Bisimilar Normalization for Reset Petri Nets. - Catherine Dufourd; Alain Finkel (Theor. Comput. Sci., 1999)

Are Timed Automata Updatable? - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (CAV, 2000)

Expressiveness of Updatable Timed Automata. - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (MFCS, 2000)

Timed automata and additive clock constraints. - Béatrice Bérard; Catherine Dufourd (Inf. Process. Lett., 2000)

Updatable timed automata. - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (Theor. Comput. Sci., 2004)