On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Using process groups to implement failure detection in asynchronous environments
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The weakest failure detector for solving consensus
PODC '92 Proceedings of the eleventh 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
On the space complexity of randomized synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
The group membership problem in asynchronous systems
The group membership problem in asynchronous systems
Wait-Free Consensus Using Asynchronous Hardware
SIAM Journal on Computing
Delimiting the power of bounded size synchronization objects (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Uniform actions in asynchronous distributed systems
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A gap theorem for consensus types extended abstract
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Consensus power makes (some) sense! (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Some Results on the Impossibility, Universality, and Decidability of Consensus
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Membership Algorithms for Multicast Communication Groups
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Primary Partition "Virtually-Synchronous Communication" harder than Consensus
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
On the use of registers in achieving wait-free consensus
Distributed Computing
Distributed Computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Failure Detection Lower Bounds on Registers and Consensus
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Irreducibility and additivity of set agreement-oriented failure detector classes
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Evaluation of the QoS of crash-recovery failure detection
Proceedings of the 2007 ACM symposium on Applied computing
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Failure detectors are schedulers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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 multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Relations linking failure detectors associated with k-set agreement in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
In search of the holy grail: looking for the weakest failure detector for wait-free set agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DISC'06 Proceedings of the 20th international conference on Distributed Computing
(Almost) all objects are universal in message passing systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
The renaming problem in shared memory systems: An introduction
Computer Science Review
| Hi-index | 0.00 |