A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Efficient synchronization of multiprocessors with shared memory
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The distributed firing squad problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight bounds for shared memory symmetric mutual exclusion problems
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Bounds on the time to reach agreement in the presence of timing uncertainty
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Mathematical Structures in Computer Science
Atomic snapshots using lattice agreement
Distributed Computing
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |