Electing a leader in a synchronous ring
Journal of the ACM (JACM)
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The existence of refinement mappings
Theoretical Computer Science
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Resource bounds and combinations of consensus objects
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
On the robustness of Herlihy's hierarchy
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
A completeness theorem for a class of synchronization objects
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-free k-set agreement is impossible: the topology of public knowledge
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Some Results on the Impossibility, Universality, and Decidability of Consensus
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Failure detectors and the wait-free hierarchy (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
All of us are smarter than any of us: wait-free hierarchies are not robust
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The consensus hierarchy is not robust
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
On the use of registers in achieving wait-free consensus
Distributed Computing
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences
N-consensus is the second strongest object for N + 1 processes
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
The anonymous consensus hierarchy and naming problems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 0.00 |