14 search results - page 1 / 3 » A Near-Tight Lower Bound on the Time Complexity of Distribut... |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
SIAMCOMP
2000
13 years 5 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
MST
2011
13 years 13 days ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
SPAA
1993
ACM
13 years 9 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...