( en | de | ru )

 

Disambiguation of "Métivier, Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre.

. Theor. Comput. Sci., (1985)

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.

Yves Robert

Yves Burkhardt

Yves Steinmetz

Yves Matthess

Yves Hoffmann

 

Other publications of authors with the same name

A Characterization of Families of Graphs in Which Election Is Possible., and . FoSSaCS, volume 2303 of Lecture Notes in Computer Science, page 159-172. Springer, (2002)Termination Detection of Local Computations, , and . CoRR, (2010)Definitions and Comparisons of Local Computations on Graphs., , and . MFCS, volume 629 of Lecture Notes in Computer Science, page 364-373. Springer, (1992)A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs., and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 212-223. Springer, (2005)Computing trees with graph rewriting systems with priorities., and . Tree Automata and Languages, North-Holland, (1992)Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre.. Theor. Comput. Sci., (1985)Coverings and Minors: Application to Local Computations in Graphs., and . Eur. J. Comb., 15 (2): 127-138 (1994)On the Recognition of Families of Graphs with Local Computations, , and . Inf. Comput., 118 (1): 110-119 (April 1995)Synchronizers for Local Computations., , , and . ICGT, volume 3256 of Lecture Notes in Computer Science, page 271-286. Springer, (2004)Probabilistic Analysis of an Election Algorithm in a Tree., and . CAAP, volume 787 of Lecture Notes in Computer Science, page 234-245. Springer, (1994)