( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A hierarchy of conditions for consensus solvability.

, , , и . PODC, стр. 151-160. ACM, (2001)

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.

Sami Achour

Khaled Ben-Achour

 

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

Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems., , , и . Theory Comput. Syst., 60 (4): 677-694 (2017)Logical Clocks for Unreliable Process Groups., , и . PDPTA, стр. 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., и . PODC, стр. 84-91. ACM, (2013)A hierarchy of conditions for consensus solvability., , , и . PODC, стр. 151-160. ACM, (2001)Randomized k-set agreement in crash-prone and Byzantine asynchronous systems., , и . Theor. Comput. Sci., (2018)Extending the Wait-free Hierarchy to Multi-Threaded Systems., , и . PODC, стр. 21-30. ACM, (2020)What Agreement Problems Owe Michel.. DISC, том 5805 из Lecture Notes in Computer Science, стр. 5. Springer, (2009)Does the Operational Model Capture Partition Tolerance in Distributed Systems?, , и . PaCT, том 11657 из Lecture Notes in Computer Science, стр. 400-407. Springer, (2019)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)