2084 search results - page 179 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
121
Voted
APAL
2004
15 years 5 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
157
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
119
click to vote
HICSS
1994
IEEE
15 years 9 months ago
1994
IEEE
We present a new distributed algorithm that detects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are ...
143
click to vote
PODC
2009
ACM
15 years 9 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
148
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...