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

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

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

On the round complexity of Byzantine agreement without initial set-up

Information and Computation

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

Information and Computation

Optimum simultaneous consensus for general omissions is equivalent to an NP oracle

DISC'09 Proceedings of the 23rd international conference on Distributed computing

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

Journal of the ACM (JACM)