| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427204 | Information and Computation | 2009 | 18 Pages |
Abstract
It is well known that in order to (deterministically) achieve Byzantine agreement (consensus) among n processors in a fully connected network in which f processors may be faulty, where f satisfies f
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
