On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Wait-Free Consensus Using Asynchronous Hardware
SIAM Journal on Computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Failure detectors and the wait-free hierarchy (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
On the Borowsky-Gafni simulation algorithm
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
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
Simulating Crash Failures with Many Faulty Processors (Extended Abstract)
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
Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract)
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
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
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Time and message-efficient S-based consensus (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
ACM SIGACT News
An Efficient Solution to the k-Set Agreement Problem
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Consensus Based on Strong Failure Detectors: A Time and Message-Efficient Protocol
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Condition for k-Set Agreement in Asynchronous Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Revising the Weakest Failure Detector for Uniform Reliable Broadcast
Proceedings of the 13th International Symposium on Distributed Computing
An Efficient Universal Construction for Message-Passing Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A necessary and sufficient condition for transforming limited accuracy failure detectors
Journal of Computer and System Sciences
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
IEEE Transactions on Computers
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of 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
Tight bounds for k-set agreement with limited-scope failure detectors
Distributed Computing - Special issue: DISC 03
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Failure detectors in loosely named systems
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The complexity of obstruction-free implementations
Journal of the ACM (JACM)
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Information Processing Letters
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The truth system: can a system of lying processes stabilize?
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Turning adversaries into friends: simplified, made constructive, and extended
OPODIS'10 Proceedings of the 14th international conference on Principles 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
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Weakening failure detectors for k-set agreement via the partition approach
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.01 |