An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

Optimal algorithms for Byzantine agreement

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

The best of both worlds: guaranteeing termination in fast randomized Byzantine agreement protocols

Information Processing Letters

Early stopping in Byzantine agreement

Journal of the ACM (JACM)

Message-optimal protocols for byzantine agreement (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing

Modular construction of a Byzantine agreement protocol with optimal message bit complexity

Information and Computation

Shifting gears: changing algorithms on the fly to expedite Byzantine agreement

Information and Computation

Fully polynomial Byzantine agreement in t + 1 rounds

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Fast asynchronous Byzantine agreement with optimal resilience

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time

Journal of Algorithms

Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)

Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract)

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms

Optimal Early Stopping in Distributed Consensus (Extended Abstract)

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms

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

Optimal time Byzantine agreement for t n/8 with linear-messages

Distributed Computing