Distributed Sorting
From MaRDI portal
Publication:3219775
DOI10.1109/TC.1985.5009389zbMath0556.68025MaRDI QIDQ3219775
Jeffrey B. Sidney, Doron Rotem, Nicola Santoro
Publication date: 1985
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
sortingselectionminimum spanning treedistributed algorithmscommunication networkcommunication complexitymessage complexity
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)
Related Items
Sloping-and-shaking ⋮ Bit complexity of order statistics on a distributed star network ⋮ SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS ⋮ A distributed selection algorithm and its expected communication complexity ⋮ A time-optimal distributed sorting algorithm on a line network.