Author of the publication

Characterization of Consistent Global Checkpoints in Large-Scale Distributed Systems.

, , , , and . FTDCS, page 314-323. IEEE Computer Society, (1995)

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

Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems., , , and . Theory Comput. Syst., 60 (4): 677-694 (2017)Logical Clocks for Unreliable Process Groups., , and . PDPTA, page 2272-2278. CSREA Press, (1999)Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits., and . PODC, page 84-91. ACM, (2013)A hierarchy of conditions for consensus solvability., , , and . PODC, page 151-160. ACM, (2001)Topic 8: Distributed Systems and Algorithms - (Introduction)., , , , and . Euro-Par, volume 8097 of Lecture Notes in Computer Science, page 367-368. Springer, (2013)Extending the Wait-free Hierarchy to Multi-Threaded Systems., , and . PODC, page 21-30. ACM, (2020)Randomized k-set agreement in crash-prone and Byzantine asynchronous systems., , and . Theor. Comput. Sci., (2018)What Agreement Problems Owe Michel.. DISC, volume 5805 of Lecture Notes in Computer Science, page 5. Springer, (2009)Building and Using Quorums Despite any Number of Process of Crashes., , and . EDCC, volume 3463 of Lecture Notes in Computer Science, page 2-19. Springer, (2005)Consensus in One Communication Step., , , and . PaCT, volume 2127 of Lecture Notes in Computer Science, page 42-50. Springer, (2001)