Author of the publication

Near-Optimal Self-stabilising Counting and Firing Squads.

, and . SSS, volume 10083 of Lecture Notes in Computer Science, page 263-280. (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. 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

A lower bound for the distributed Lovász local lemma., , , , , , , and . STOC, page 479-488. ACM, (2016)Near-optimal self-stabilising counting and firing squads., and . Distributed Comput., 32 (4): 339-360 (2019)Fast Graphical Population Protocols., , and . OPODIS, volume 217 of LIPIcs, page 14:1-14:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Synchronous Counting and Computational Algorithm Design., , , , and . SSS, volume 8255 of Lecture Notes in Computer Science, page 237-250. Springer, (2013)A Local 2-Approximation Algorithm for the Vertex Cover Problem., , , , , and . DISC, volume 5805 of Lecture Notes in Computer Science, page 191-205. Springer, (2009)Large Cuts with Local Algorithms on Triangle-Free Graphs., , , and . CoRR, (2014)Brief Announcement: Does Preprocessing Help under Congestion?, , , and . CoRR, (2019)Does Preprocessing Help under Congestion?, , , and . PODC, page 259-261. ACM, (2019)Efficient Counting with Optimal Resilience., and . DISC, volume 9363 of Lecture Notes in Computer Science, page 16-30. Springer, (2015)Near-Optimal Self-stabilising Counting and Firing Squads., and . SSS, volume 10083 of Lecture Notes in Computer Science, page 263-280. (2016)