> Publications > An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience
An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience
Ittai Abraham, Danny Dolev, and Joseph Y. Halpern
2008
In: PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Publisher: ACM
Details
| Type: | Inproceedings |
| Pages: | 405–414 |
| ISBN: | 978-1-59593-989-0 |
| Address: | New York, NY, USA |
Related People
©2009 Microsoft Corporation. All rights reserved.