From post

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.

 

Другие публикации лиц с тем же именем

Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits., и . PODC, стр. 84-91. ACM, (2013)A hierarchy of conditions for consensus solvability., , , и . PODC, стр. 151-160. ACM, (2001)Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems., и . NETYS, том 9944 из Lecture Notes in Computer Science, стр. 250-265. Springer, (2016)What Agreement Problems Owe Michel.. DISC, том 5805 из Lecture Notes in Computer Science, стр. 5. Springer, (2009)Building and Using Quorums Despite any Number of Process of Crashes., , и . EDCC, том 3463 из Lecture Notes in Computer Science, стр. 2-19. Springer, (2005)Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus., и . FSTTCS, том 1738 из Lecture Notes in Computer Science, стр. 329-340. Springer, (1999)Consensus in One Communication Step., , , и . PaCT, том 2127 из Lecture Notes in Computer Science, стр. 42-50. Springer, (2001)Looking for Efficient Implementations of Concurrent Objects., и . PaCT, том 6873 из Lecture Notes in Computer Science, стр. 74-87. Springer, (2011)Does the Operational Model Capture Partition Tolerance in Distributed Systems?, , и . PaCT, том 11657 из Lecture Notes in Computer Science, стр. 400-407. Springer, (2019)Topic 8: Distributed Systems and Algorithms - (Introduction)., , , , и . Euro-Par, том 8097 из Lecture Notes in Computer Science, стр. 367-368. Springer, (2013)