Author of the publication

The minimum information about failures for solving non-local tasks in message-passing systems.

, , and . Distributed Comput., 24 (5): 255-269 (2011)

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 Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds., and . Inf. Process. Lett., 71 (3-4): 155-158 (1999)On Quiescent Reliable Communication., , and . SIAM J. Comput., 29 (6): 2040-2073 (2000)On the Impossibility of Group Membership., , , and . PODC, page 322-330. ACM, (1996)Every problem has a weakest failure detector., and . PODC, page 75-84. ACM, (2008)Timeliness-based wait-freedom: a gracefully degrading progress condition., and . PODC, page 305-314. ACM, (2008)Fast fault-tolerant agreement algorithms., , , and . PODC, page 169-178. ACM, (2005)Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems., , and . DISC, volume 5805 of Lecture Notes in Computer Science, page 358-359. Springer, (2009)Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version)., and . WDAG, volume 392 of Lecture Notes in Computer Science, page 110-123. Springer, (1989)Stable Leader Election., , , and . DISC, volume 2180 of Lecture Notes in Computer Science, page 108-122. Springer, (2001)On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems., , and . DISC, volume 2508 of Lecture Notes in Computer Science, page 354-370. Springer, (2002)