An improved algorithm for finding the median distributively
From MaRDI portal
Recommendations
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Complexity of network synchronization
- Finding the median
- scientific article; zbMATH DE number 3876583 (Why is no real title available?)
- Selection and sorting with limited storage
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
- Time bounds for selection
Cited in
(5)- A distributed selection algorithm and its expected communication complexity
- On ``An improved algorithm for finding the median distributively
- On finding medians of weighted discrete points
- Simplified implementation of the recursive median sieve
- scientific article; zbMATH DE number 7765400 (Why is no real title available?)
This page was built for publication: An improved algorithm for finding the median distributively
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101218)