1. Abraham, I., Dolev, D.: Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity. In: Proceedings of the 47th Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14–17, 2015, pp. 605–614 (2015)
2. Augustine, J., King, V., Molla, A.R., Pandurangan, G., Saia, J.: Scalable and secure computation among strangers: message-competitive byzantine protocols. In: 34th International Symposium on Distributed Computing, DISC 2020, October 12–16, 2020, Virtual Conference, pp. 1–19 (2020)
3. Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824–840 (1985)
4. Chuzhoy, J., Parter, M., Tan, Z.: On packing low-diameter spanning trees. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8–11, 2020, Saarbrücken, Germany (Virtual Conference), pp. 1–18 (2020)
5. Dinitz, M., Krauthgamer, R.: Fault-tolerant spanners: better and simpler. In: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp. 169–178. ACM (2011)