( en | de | ru )

 

Disambiguation of "Mostéfaoui, Achour"

Author of the publication

copydeleteadd this publication to your clipboard
Modular randomized byzantine k-set agreement in asynchronous message-passing systems.

, , and . ICDCN, page 5:1-5:10. ACM, (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.

Sami Achour

Khaled Ben-Achour

 

Other publications of authors with the same name

Does the Operational Model Capture Partition Tolerance in Distributed Systems?, , and . PaCT, volume 11657 of Lecture Notes in Computer Science, page 400-407. Springer, (2019)Consensus in One Communication Step., , , and . PaCT, volume 2127 of Lecture Notes in Computer Science, page 42-50. Springer, (2001)Looking for Efficient Implementations of Concurrent Objects., and . PaCT, volume 6873 of Lecture Notes in Computer Science, page 74-87. Springer, (2011)Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus., and . FSTTCS, volume 1738 of Lecture Notes in Computer Science, page 329-340. Springer, (1999)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)Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems., and . NETYS, volume 9944 of Lecture Notes in Computer Science, page 250-265. Springer, (2016)What Agreement Problems Owe Michel.. DISC, volume 5805 of Lecture Notes in Computer Science, page 5. Springer, (2009)Topic 8: Distributed Systems and Algorithms - (Introduction)., , , , and . Euro-Par, volume 8097 of Lecture Notes in Computer Science, page 367-368. Springer, (2013)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)