( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Termination Detection of Distributed Algorithms by Graph Relabelling Systems.

, , , и . ICGT, том 2505 из Lecture Notes in Computer Science, стр. 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.

Godard Ilsemann

Claudia Godard

Emmanuel Rehfeld

Emmanuel Biris

Emmanuel Stamou

 

Другие публикации лиц с тем же именем

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