Ittai Abraham, Danny Dolev, Joseph Y. Halpern. An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience. In Rida A. Bazzi, Boaz Patt-Shamir, editors, Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008. pages 405-414, ACM, 2008. [doi]
@inproceedings{AbrahamDH08,
title = {An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience},
author = {Ittai Abraham and Danny Dolev and Joseph Y. Halpern},
year = {2008},
doi = {10.1145/1400751.1400804},
url = {http://doi.acm.org/10.1145/1400751.1400804},
tags = {protocol},
researchr = {https://researchr.org/publication/AbrahamDH08},
cites = {0},
citedby = {0},
pages = {405-414},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008},
editor = {Rida A. Bazzi and Boaz Patt-Shamir},
publisher = {ACM},
isbn = {978-1-59593-989-0},
}