A time-optimal distributed sorting algorithm on a line network.
type: Item
instance of: scholarly article
title: A time-optimal distributed sorting algorithm on a line network.
zbMATH Open document ID: 1043.68026
DOI: 10.1016/S0020-0190(01)00307-6
author: Atsushi Sasaki
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 1856376
zbMATH Keywords: Distributed sorting
zbMATH Keywords: Algorithms
zbMATH Keywords: Computational complexity
zbMATH Keywords: Distributed computing
zbMATH Keywords: Line network
MaRDI profile type: Publication
cites work: The bit complexity of distributed sorting
cites work: Distributed sorting
cites work: Q4002466
cites work: The complexity of sorting on distributed systems
cites work: Q3126969
cites work: Distributed sorting algorithms for multi-channel broadcast networks
cites work: Distributed Sorting
cites work: Optimal Distributed Algorithms for Sorting and Ranking
description: scientific article; zbMATH DE number 1856376