5 search results - page 1 / 1 » Connectivity oracles for failure prone graphs |
STOC
2010
ACM
13 years 9 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
PODC
2009
ACM
13 years 11 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
SPAA
2009
ACM
13 years 11 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
PODC
2005
ACM
13 years 10 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...