A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Modular construction of nearly optimal Byzantine agreement protocols
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Optimal Resiliency Against Mobile Faults
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Uniform consensus is harder than consensus
Journal of Algorithms
Revisiting fault diagnosis agreement in a new territory
ACM SIGOPS Operating Systems Review
Reaching fault diagnosis agreement on an unreliable general network
Information Sciences—Informatics and Computer Science: An International Journal
Optimal time Byzantine agreement for t n/8 with linear-messages
Distributed Computing
Eventually Dual Failure Agreement
Fundamenta Informaticae
Dual agreement virtual subnet protocol for mobile ad-hoc networks
Proceedings of the 2007 ACM symposium on Applied computing
Improving fault-tolerant scheme for a time-sensitive autonomous local wireless sensor network
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Computer Standards & Interfaces
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
A fault-tolerant scheme for an autonomous local wireless sensor network
Computer Standards & Interfaces
Improving robustness in an autonomous local sensor network
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Achieving efficient agreement within a dual-failure cloud-computing environment
Expert Systems with Applications: An International Journal
Authenticated Byzantine generals in dual failure model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Formal verification of consensus algorithms tolerating malicious faults
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Eventually Dual Failure Agreement
Fundamenta Informaticae
Proceedings of the 2013 ACM symposium on Principles of distributed computing
The optimal generalized Byzantine Agreement in Cluster-based Wireless Sensor Networks
Computer Standards & Interfaces
| Hi-index | 0.00 |