( en | de | ru )

 

Disambiguation of "Durand, Irène"

Author of the publication

copydeleteadd this publication to your clipboard
A unified algorithm for colouring graphs of bounded clique-width.

, , and . (2020)http://arxiv.org/abs/2008.07468.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jacques Durand

Yves Durand

Jacques Durand

Guillaume Durand

Sylvain Durand

 

Other publications of authors with the same name

A unified algorithm for colouring graphs of bounded clique-width., , and . (2020)http://arxiv.org/abs/2008.07468.Call by need computations in orthogonal term rewriting systems.. (2005)Fly-automata, model-checking and recognizability., and . CoRR, (2014)Autowrite: A Tool for Checking Properties of Term Rewriting Systems.. RTA, volume 2378 of Lecture Notes in Computer Science, page 371-375. Springer, (2002)Model-Checking by Infinite Fly-Automata., and . CAI, volume 8080 of Lecture Notes in Computer Science, page 211-222. Springer, (2013)A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation., and . J. Univers. Comput. Sci., 14 (20): 3282-3306 (2008)Verifying Monadic Second Order Graph Properties with Tree Automata., and . ELS, page 7-21. ELSAA, (2010)Termination of linear bounded term rewriting systems., , and . RTA, volume 6 of LIPIcs, page 341-356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Decidable call-by-need computations in term rewriting., and . Inf. Comput., 196 (2): 95-126 (2005)Decidable Call by Need Computations in term Rewriting (Extended Abstract)., and . CADE, volume 1249 of Lecture Notes in Computer Science, page 4-18. Springer, (1997)