activity
19992023
most citedTrading off -Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast

29 citations · 100 across the 39 of their papers we have counts for

collaborators
Showing 2016Show all

5 papers · 1 filter

cs.DC2016

Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks

Hicham Lakhlef, Michel Raynal, François Taïani

The vertex coloring problem has received a lot of attention in the context of synchronous round-based systems where, at each round, a process can send a message to all its neighbor…

cs.DC2016

Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems

Achour Mosteafoui, Matoula Petrolia, Michel Raynal +1

This article presents a signature-free distributed algorithm which builds an atomic read/write shared memory on top of an -process asynchronous message-passing system in which u…

cs.DC2016

Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems

Achour Mostéfaoui, Michel Raynal

Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of at…

cs.DC2016

Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems

Achour Mostefaoui, Michel Raynal

The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of att…

cs.DC2016

Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous Broadcast/Receive Tree Networks

Davide Frey, Hicham Lakhlef, Michel Raynal

This article is on message-passing systems where communication is (a) synchronous and (b) based on the "broadcast/receive" pair of communication operations. "Synchronous" means tha…