11 search results - page 1 / 3 » Complexity of Multi-Value Byzantine Agreement |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
PODC
2009
ACM
14 years 5 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
OPODIS
2004
13 years 6 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
INFORMATICALT
2006
13 years 4 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
ICDCN
2009
Springer
13 years 11 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...