2924 search results - page 103 / 585 » Lower Bounds in Distributed Computing |
139
click to vote
PDCAT
2005
Springer
15 years 6 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
114
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
116
click to vote
ECCC
2011
14 years 7 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
97
Voted
EOR
2007
15 years 17 days ago
2007
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
89
Voted
STOC
2004
ACM
16 years 27 days ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...