( en | de | ru )

 

Disambiguation of "Mostéfaoui, Achour"

Author of the publication

copydeleteadd this publication to your clipboard
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits.

, , , and . ICDCN, page 7:1-7:10. ACM, (2018)

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

What Agreement Problems Owe Michel.. DISC, volume 5805 of Lecture Notes in Computer Science, page 5. Springer, (2009)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)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)A hierarchy of conditions for consensus solvability., , , and . PODC, page 151-160. ACM, (2001)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)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)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)