Author of the publication

Termination Detection of Distributed Algorithms by Graph Relabelling Systems.

, , , and . ICGT, volume 2505 of Lecture Notes in Computer Science, page 106-119. Springer, (2002)

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

Snap-Stabilizing Tasks in Anonymous Networks.. CoRR, (2022)Mobile Agent Algorithms Versus Message Passing Algorithms., , , and . OPODIS, volume 4305 of Lecture Notes in Computer Science, page 187-201. Springer, (2006)About the Termination Detection in the Asynchronous Message Passing Model., , , and . SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, page 200-211. Springer, (2007)Mutex-based Desanonymization of an Anonymous Read/Write Memory., , , and . CoRR, (2019)Snap-Stabilizing Tasks in Anonymous Networks.. SSS, volume 10083 of Lecture Notes in Computer Science, page 170-184. (2016)From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems., , , and . PODC, page 41-50. ACM, (2020)A characterization of oblivious message adversaries for which Consensus is solvable., , and . Theor. Comput. Sci., (2015)k-Set Agreement in Communication Networks with Omission Faults., and . OPODIS, volume 70 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Equivalence of Structural Knowledges in Distributed Algorithms., and . SIROCCO, volume 13 of Proceedings in Informatics, page 149-164. Carleton Scientific, (2002)Deducible and Equivalent Structural Knowledges in Distributed Algorithms., and . Theory Comput. Syst., 36 (6): 631-654 (2003)