1. I. Abraham , T.-H. Hubert Chan , D. Dolev , K. Nayak , R. Pass , L. Ren , and E. Shi . 2019. Communication Complexity of Byzantine Agreement , Revisited. In Proc.of the ACM Symposium on Principles of Distributed Computing (PODC). 317--326 . I. Abraham, T.-H. Hubert Chan, D. Dolev, K. Nayak, R. Pass, L. Ren, and E. Shi. 2019. Communication Complexity of Byzantine Agreement, Revisited. In Proc.of the ACM Symposium on Principles of Distributed Computing (PODC). 317--326.
2. Communication-efficient randomized consensus;Alistarh D.;Distributed Computing,2018
3. On the message complexity of binary agreement under crash failures;Amdur S.;Distributed Computing,1992
4. Lower Bounds for Distributed Coin-Flipping and Randomized Consensus;Aspnes J.;J. ACM,1998
5. Tight bounds for asynchronous randomized consensus;Attiya Hagit;Journal of the ACM (JACM),2008