Author of the publication

On the Strongest Message Adversary for Consensus in Directed Dynamic Networks.

, , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 102-120. Springer, (2018)

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

Fast Consensus under Eventually Stabilizing Message Adversaries., , and . CoRR, (2015)On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks., , and . CoRR, (2019)Consensus in Directed Dynamic Networks with Short-Lived Stability., , and . CoRR, (2016)Consensus in rooted dynamic networks with short-lived stability., , and . Distributed Computing, 32 (5): 443-458 (2019)A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus., , , and . SSS, volume 11914 of Lecture Notes in Computer Science, page 307-322. Springer, (2019)Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks., , , , and . NETYS, volume 9466 of Lecture Notes in Computer Science, page 109-124. Springer, (2015)Fast consensus under eventually stabilizing message adversaries., , and . ICDCN, page 7:1-7:10. ACM, (2016)Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures., , , , and . PODC, page 341-343. ACM, (2014)Lösbarkeit von Consensus unter Nachrichtengegnern.. Ausgezeichnete Informatikdissertationen, volume D-20 of LNI, GI, (2019)On the Strongest Message Adversary for Consensus in Directed Dynamic Networks., , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 102-120. Springer, (2018)