The bit complexity of distributed sorting

DOI10.1007/PL00009163zbMATH Open0879.68027MaRDI QIDQ1361409FDOQ1361409

Shmuel Zaks, Ornan Gerstel

Publication date: 23 July 1997

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• The complexity of sorting on distributed systems
• Optimal Distributed Algorithms for Sorting and Ranking
• Bit complexity of order statistics on a distributed star network
• The round complexity of distributed sorting, extended abstract
• Distributed Sorting

zbMATH Keywords

asynchronous distributed systemssorting problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (6)

• Bit complexity of order statistics on a distributed star network
• Distributed Sorting
• Optimal Distributed Algorithms for Sorting and Ranking
• A time-optimal distributed sorting algorithm on a line network.
• The complexity of sorting on distributed systems
• On the bit complexity of distributed computations in a ring with a leader

This page was built for publication: The bit complexity of distributed sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361409)