Easy impossibility proofs for distributed consensus problems
Distributed Computing
Computing on an anonymous ring
Journal of the ACM (JACM)
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Better computing on the anonymous ring
Journal of Algorithms
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time
Journal of Algorithms
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to algorithms
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Encapsulating Failure Detection: From Crash to Byzantine Failures
Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
Secure Communication in an Unknown Network Using Certificates
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Reliable broadcast in unknown fixed-identity networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient Algorithms for Anonymous Byzantine Agreement
Theory of Computing Systems
Agreement among unacquainted byzantine generals
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the power of impersonation attacks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
It is well known that in order to (deterministically) achieve Byzantine agreement (consensus) among n processors in a fully connected network in which f processors may be faulty, where f satisfies f