Author of the publication

Making Local Algorithms Wait-Free: The Case of Ring Coloring.

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

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract)., , and . DISC, volume 9363 of Lecture Notes in Computer Science, page 420-435. Springer, (2015)A Topological Perspective on Distributed Network Algorithms., , , , , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 3-18. Springer, (2019)Compact routing messages in self-healing trees., , and . ICDCN, page 23:1-23:10. ACM, (2016)Brief announcement: pareto optimal solutions to consensus and set consensus., , and . PODC, page 113-115. ACM, (2013)Long-Lived Tasks., , and . NETYS, volume 10299 of Lecture Notes in Computer Science, page 439-454. (2017)Compact Routing Messages in Self-Healing Trees., , and . CoRR, (2015)Unbeatable Consensus., , and . DISC, volume 8784 of Lecture Notes in Computer Science, page 91-106. Springer, (2014)Communication Pattern Logic: Epistemic and Topological Views., , , and . CoRR, (2022)On the Consensus Number of Non-adaptive Perfect Renaming., and . NETYS, volume 7853 of Lecture Notes in Computer Science, page 1-12. Springer, (2013)Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus., , and . CoRR, (2013)