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

A time-optimal distributed sorting algorithm on a line network.

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

DOI10.1016/S0020-0190(01)00307-6zbMath1043.68026MaRDI QIDQ1853029

Atsushi Sasaki

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

AlgorithmsComputational complexityDistributed computingDistributed sortingLine network


Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed systems (68M14) Distributed algorithms (68W15)


Related Items (1)

On the impact of the migration topology on the island model




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Distributed sorting
  • Distributed sorting algorithms for multi-channel broadcast networks
  • The bit complexity of distributed sorting
  • Distributed Sorting
  • Optimal Distributed Algorithms for Sorting and Ranking
  • The complexity of sorting on distributed systems




This page was built for publication: A time-optimal distributed sorting algorithm on a line network.

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