Tight bounds for distributed selection

@inproceedings{Kuhn2007TightBF,
  title={Tight bounds for distributed selection},
  author={Fabian Kuhn and Thomas Locher and Roger Wattenhofer},
  booktitle={SPAA},
  year={2007}
}
We revisit the problem of distributed <i>k</i>-selection where, given a general connected graph of diameter <i>D</i> consisting of <i>n</i> nodes in which each node holds a numeric element, the goal is to determine the <i>k<sup>th</sup></i> smallest of these elements. In our model, there is no imposed relation between the magnitude of the stored elements and the number of nodes in the graph. We propose a randomized algorithm whose time complexity is <i>O</i>(<i>D</i>log<sub><i>D</i></sub> <i>n… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS
32 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

Similar Papers

Loading similar papers…