Parallel complexity of sorting problems

DOI10.1016/0196-6774(82)90010-4zbMath0547.68061OpenAlexW2039223422MaRDI QIDQ3339300

Martin Aigner

Publication date: 1982

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(82)90010-4

zbMATH Keywords

selection problemsortingparallel complexitymerging problembounds for the cost functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (4)

A neural sorting network with O(1) time complexity ⋮ A parallel sorting scheme whose basic operation sortsN elements ⋮ Producing posets ⋮ A new parallel sorting algorithm based upon min-mid-max operations

This page was built for publication: Parallel complexity of sorting problems