Catherine Dufourd

According to our database1, Catherine Dufourd authored at least 9 papers between 1993 and 2004.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
Updatable timed automata.
Theor. Comput. Sci., 2004

2000
Timed automata and additive clock constraints.
Inf. Process. Lett., 2000

Expressiveness of Updatable Timed Automata.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Are Timed Automata Updatable?
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
A Polynomial-Bisimilar Normalization for Reset Petri Nets.
Theor. Comput. Sci., 1999

Boundedness of Reset P/T Nets.
Proceedings of the Automata, 1999

1998
Reset Nets Between Decidability and Undecidability.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Polynomial-Time Manz-One Reductions for Petri Nets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

1993
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem.
Proceedings of the Computing and Information, 1993


  Loading...