Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The bit complexity of distributed sorting

From MaRDI portal
Publication:1361409
Jump to:navigation, search

DOI10.1007/PL00009163zbMath0879.68027MaRDI QIDQ1361409

Shmuel Zaks, Ornan Gerstel

Publication date: 23 July 1997

Published in: Algorithmica (Search for Journal in Brave)


zbMATH Keywords

asynchronous distributed systemssorting problem


Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items (2)

Bit complexity of order statistics on a distributed star network ⋮ A time-optimal distributed sorting algorithm on a line network.







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1361409&oldid=13499241"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 14:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki