Author of the publication

Graph Rewriting Systems with Priorities.

, , , and . WG, volume 411 of Lecture Notes in Computer Science, page 94-106. Springer, (1989)

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.

 

Other publications of authors with the same name

An optimal bit complexity randomized distributed MIS algorithm., , , and . Distributed Computing, 23 (5-6): 331-340 (2011)Randomised distributed MIS and colouring algorithms for rings with oriented edges in bit rounds., , and . Inf. Comput., (2016)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)Definitions and Comparisons of Local Computations on Graphs., , and . MFCS, volume 629 of Lecture Notes in Computer Science, page 364-373. Springer, (1992)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)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)Synchronizers for Local Computations., , , and . ICGT, volume 3256 of Lecture Notes in Computer Science, page 271-286. Springer, (2004)Termination Detection of Local Computations, , and . CoRR, (2010)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)