Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
Hi-index | 0.00 |
Thanks to computer scientists like Barbara Liskov, researchers are making major progress with cost-efficient fault tolerance for Web-based systems.