The bit complexity of distributed sorting

DOI10.1007/PL00009163MaRDI QIDQ1361409zbMATH OpenFDO

Authors Ornan Gerstel, Shmuel Zaks

Publication date 23 July 1997

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00009163

zbMATH Keywords

asynchronous distributed systemssorting problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

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

Cited in

(7)

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

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)