( en | de | ru )

 

Disambiguation of "Delporte, Carole"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Marc Delporte

Julien Delporte

Carole Bourquin

Carole Urvoy

Carole Knibbe

 

Other publications of authors with the same name

t-Resilient Immediate Snapshot Is Impossible., , , and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 177-191. (2016)Making Local Algorithms Wait-Free: The Case of Ring Coloring., , , , and . SSS, volume 10083 of Lecture Notes in Computer Science, page 109-125. (2016)k-Immediate Snapshot and x-Set Agreement: How Are They Related?, , , and . SSS, volume 12514 of Lecture Notes in Computer Science, page 97-112. Springer, (2020)An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract)., and . ICALP, volume 154 of Lecture Notes in Computer Science, page 15-27. Springer, (1983)An Exercise in Concurrency: From Non-blocking Objects to Fair Objects., , and . NBiS, page 1-7. IEEE Computer Society, (2014)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)An Anonymous Wait-Free Weak-Set Object Implementation., , , and . NETYS, volume 11028 of Lecture Notes in Computer Science, page 141-156. Springer, (2018)The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers., , , , and . PODC, page 310-320. ACM, (2024)Making Local Algorithms Wait-Free: the Case of Ring Coloring., , , , and . Theory Comput. Syst., 63 (2): 344-365 (2019)