Catherine Dufourd

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

Coauthor Index

1	Béatrice Bérard	[6]
2	Patricia Bouyer (Patricia Bouyer-Decitre)	[7] [8] [9]
3	Christophe Cérin	[1]
4	Alain Finkel	[2] [3] [4]
5	Emmanuel Fleury	[7] [8] [9]
6	Petr Jancar	[5]
7	Jean Frédéric Myoupo	[1]
8	Antoine Petit	[7] [8] [9]
9	Ph. Schnoebelen (Philippe Schnoebelen)	[3] [5]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page