Efficient and robust sharing of memory in message-passing systems

Conditions on input vectors for consensus solvability in asynchronous distributed systems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Conditions on input vectors for consensus solvability in asynchronous distributed systems

Journal of the ACM (JACM)

Constructing regular variables in message passing systems

Journal of Parallel and Distributed Computing

The collective memory of amnesic processes

ACM Transactions on Algorithms (TALG)

A simple proof of the necessity of the failure detector Σ to implement an atomic register in asynchronous message-passing systems

Information Processing Letters

The weakest failure detector to implement a register in asynchronous systems with hybrid communication

Theoretical Computer Science