Linear sorting with O(log n) processors

DOI10.1007/BF02218438MaRDI QIDQ1838307zbMATH OpenOpenAlexFDO

Authors J. A. Orenstein, T. H. Merrett, Luc 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)

Cites work

• scientific article; zbMATH DE number 3176214 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Algorithm and Hardware for a Merge Sort Using Multiple Processors
• Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
• Expected time bounds for selection
• Exponential bounds for the running time of a selection algorithm
• Fast parallel sorting algorithms
• Finding the median
• New Parallel-Sorting Schemes
• Quicksort
• Sorting by distributive partitioning
• The identification of the parameters of time-invariant stochastic systems by a method derived from the continuous-time Kalman filter
• Time bounds for selection

Cited in

(1)

• A time-space optimal parallel sorting on a hypercube

Describes a project that uses

Uses Software

• Find
• Quicksort

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838307)