1. I. Abraham and D. Dolev. Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity. In R. A. Servedio and R. Rubinfeld, editors, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14–17, 2015, pages 605–614. ACM, 2015. 44
2. I. Abraham, D. Dolev, and J. Y. Halpern. An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience. In R. A. Bazzi and B. Patt-Shamir, editors, Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18–21, 2008, pages 405–414. ACM, 2008. 47
3. E. A. P. Alchieri, A. N. Bessani, J. da Silva Fraga, and F. Greve. Byzantine consensus with unknown participants. In T. P. Baker, A. Bui, and S. Tixeuil, editors, Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15–18, 2008. Proceedings, volume 5401 of Lecture Notes in Computer Science (LNCS), pages 22–40. Springer, 2008. 38
4. M. Andrychowicz and S. Dziembowski. PoW-based distributed cryptography with no trusted setup. In Advances in Cryptology—CRYPTO 2015—35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16–20, 2015, Proceedings, Part II, pages 379–399, 2015. 49, 50, 51, 52, 58
5. J. Aspnes, C. Jackson, and A. Krishnamurthy. Exposing computationally-challenged Byzantine impostors. Technical Report YALEU/DCS/TR-1332, Yale University Department of Computer Science, July 2005. 48, 49, 50