Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Asymptotically optimal algorithms for approximate agreement
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
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Early stopping protocols for fault-tolerant distributed agreement
Early stopping protocols for fault-tolerant distributed agreement
Asymptotically optimal algorithms for approximate agreement
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A categorical approach to distributed systems expressibility and knowledge
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Modular construction of nearly optimal Byzantine agreement protocols
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A characterization of eventual Byzantine agreement
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Simplifying fault-tolerance: providing the abstraction of crash failures
Journal of the ACM (JACM)
Using knowledge to optimally achieve coordination in distributed systems: extended abstract
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
Common knowledge and consistent simultaneous coordination
Distributed Computing
Efficient agreement using fault diagnosis
Distributed Computing
Continuous consensus via common knowledge
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
A self-adjusting algorithm for byzantine agreement
Distributed Computing
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Distributed Computing
Single-bit messages are insufficient for data link over duplicating channels
Information Processing Letters
Single-Bit messages are insufficient in the presence of duplication
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |