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

Beyond One Third Byzantine Failures., , , , and . CoRR, (2015)The Weakest Failure Detector for Message Passing Set-Agreement., , , and . DISC, volume 5218 of Lecture Notes in Computer Science, page 109-120. Springer, (2008)Some New Results With k-set agreement., , and . CoRR, (2023)An Anonymous Wait-Free Weak-Set Object Implementation., , , and . NETYS, volume 11028 of Lecture Notes in Computer Science, page 141-156. Springer, (2018)t-Resilient Immediate Snapshot Is Impossible., , , and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 177-191. (2016)The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers., , , , and . PODC, page 310-320. ACM, (2024)Latency Measures and Lower Bounds for Consensus with Failure Detectors., and . SIROCCO, volume 13 of Proceedings in Informatics, page 87-100. Carleton Scientific, (2002)Revisiting Failure Detection and Consensus in Omission Failure Environments., , and . ICTAC, volume 3722 of Lecture Notes in Computer Science, page 394-408. Springer, (2005)Making Local Algorithms Wait-Free: The Case of Ring Coloring., , , , and . SSS, volume 10083 of Lecture Notes in Computer Science, page 109-125. (2016)A Characterization of t-Resilient Colorless Task Anonymous Solvability., , , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 178-192. Springer, (2018)