An improved algorithm for finding the median distributively

DOI10.1007/BF01840361zbMath0642.68067MaRDI QIDQ1101218

B. George

Publication date: 1987

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

communication complexitydistributed algorithmmedian selection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items (3)

Unnamed Item ⋮ A distributed selection algorithm and its expected communication complexity ⋮ On ``An improved algorithm for finding the median distributively

Cites Work

• Unnamed Item
• Selection and sorting with limited storage
• Finding the median
• Time bounds for selection
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Complexity of network synchronization
• A Distributed Algorithm for Minimum-Weight Spanning Trees

This page was built for publication: An improved algorithm for finding the median distributively