75 search results - page 1 / 15 » Lower Bounds for Asynchronous Consensus |
106
Voted
AC
2003
Springer
15 years 10 months ago
2003
Springer
183
Voted
SIAMCOMP
2010
14 years 11 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
132
click to vote
STOC
1997
ACM
15 years 9 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
170
click to vote
TC
2002
15 years 4 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
133
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...