168 search results - page 7 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
104
click to vote
DC
2007
14 years 11 months ago
2007
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
FS
2006
14 years 11 months ago
2006
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
119
click to vote
PODS
2012
ACM
13 years 2 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
TIT
2008
14 years 11 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
PDCAT
2005
Springer
15 years 5 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...