( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast consensus under eventually stabilizing message adversaries.

, , и . ICDCN, стр. 7:1-7:10. ACM, (2016)

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.

Kyrill Makoski

Kyrill Wekua

Kyrill Meyer

Kyrill Tzonsaroff

Kyrill Siewert

 

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

Lösbarkeit von Consensus unter Nachrichtengegnern.. Ausgezeichnete Informatikdissertationen, том D-20 из LNI, GI, (2019)Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures., , , , и . PODC, стр. 341-343. ACM, (2014)Valency-Based Consensus Under Message Adversaries Without Limit-Closure., , и . FCT, том 12867 из Lecture Notes in Computer Science, стр. 457-474. Springer, (2021)Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks., , , , и . NETYS, том 9466 из Lecture Notes in Computer Science, стр. 109-124. Springer, (2015)Fast consensus under eventually stabilizing message adversaries., , и . ICDCN, стр. 7:1-7:10. ACM, (2016)The Time Complexity of Consensus Under Oblivious Message Adversaries., , , , и . ITCS, том 251 из LIPIcs, стр. 100:1-100:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Strongest Message Adversary for Consensus in Directed Dynamic Networks., , и . SIROCCO, том 11085 из Lecture Notes in Computer Science, стр. 102-120. Springer, (2018)Topological Characterization of Consensus under General Message Adversaries., , и . PODC, стр. 218-227. ACM, (2019)A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus., , , и . SSS, том 11914 из Lecture Notes in Computer Science, стр. 307-322. Springer, (2019)A Characterization of Consensus Solvability for Closed Message Adversaries., , и . OPODIS, том 153 из LIPIcs, стр. 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)