PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Métivier, Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Mobile Agent Algorithms Versus Message Passing Algorithms.

, , , and . OPODIS, volume 4305 of Lecture Notes in Computer Science, page 187-201. Springer, (2006)

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 Klett

 

Other publications of authors with the same name

Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings., , , and . Inf. Comput., (2013)On the Recognition of Families of Graphs with Local Computations, , and . Inf. Comput., 118 (1): 110-119 (April 1995)Coverings and Minors: Application to Local Computations in Graphs., and . Eur. J. Comb., 15 (2): 127-138 (1994)Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre.. Theor. Comput. Sci., (1985)Analysis of fully distributed splitting and naming probabilistic procedures and applications., , and . Theor. Comput. Sci., (2015)A uniform randomized election in trees., , and . SIROCCO, volume 17 of Proceedings in Informatics, page 259-274. Carleton Scientific, (2003)Randomised distributed MIS and colouring algorithms for rings with oriented edges in bit rounds., , and . Inf. Comput., (2016)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)The Power of Local Computations in Graphs with Initial Knowledge., , and . TAGT, volume 1764 of Lecture Notes in Computer Science, page 71-84. Springer, (1998)An optimal bit complexity randomized distributed MIS algorithm., , , and . Distributed Computing, 23 (5-6): 331-340 (2011)