Deterministic Consensus Algorithm with Linear Per-Bit Complexity
Published in arXiv (Cornell University) • Aug 26, 2010
Authors:,
Guanfeng Liang
Nitin H. Vaidya
Abstract
In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic multi-valued all-to-all Byzantine agreement algorithm (consensus), with linear complexity per bit agreed upon. The discuss...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!