Linear sorting with O(log n) processors

DOI10.1007/BF02218438zbMath0509.68052OpenAlexW1581630770MaRDI QIDQ1838307

T. H. Merrett, J. A. Orenstein, Luc P. Devroye

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

parallel algorithmsparallel processors23, 170-180 (1983)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items (1)

A time-space optimal parallel sorting on a hypercube

Uses Software

• Quicksort
• Find

Cites Work

• Exponential bounds for the running time of a selection algorithm
• The identification of the parameters of time-invariant stochastic systems by a method derived from the continuous-time Kalman filter
• Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
• Finding the median
• Sorting by distributive partitioning
• Time bounds for selection
• Expected time bounds for selection
• New Parallel-Sorting Schemes
• Algorithm and Hardware for a Merge Sort Using Multiple Processors
• Fast parallel sorting algorithms
• Quicksort
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear sorting with O(log n) processors