8 search results - page 2 / 2 » A Near-Tight Lower Bound on the Time Complexity of Distribut... |
DCOSS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
SOFSEM
1997
Springer
13 years 9 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...