A parallel median algorithm
type: Item
instance of: scholarly article
title: A parallel median algorithm
zbMATH Open document ID: 0573.68032
DOI: 10.1016/0020-0190(85)90080-8
published in: Information Processing Letters
publication date: 1985-01-01T00:00:00Z
review text: We give a deterministic algorithm for finding the k th smallest item in a set of n items, running in O((log log n)\({}^ 2)\) parallel time on O(n) processors in Valiant's comparison model.
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3915639
zbMATH Keywords: parallel algorithm
zbMATH Keywords: selection
zbMATH Keywords: comparison model
author: Richard Cole
author: Chee K. Yap
MaRDI profile type: Publication
full work available at URL: 0020-0190(85)90080-8
OpenAlex ID: W2053422185
cites work: Parallelism in Comparison Problems
Recommended article: Parallel algorithms for vector median filtering
Recommended article: Q4706753
Recommended article: Finding an approximate median with high probability in constant parallel time
Recommended article: Parallel algorithms for least median of squares regression
Recommended article: Parallel Algorithms
Recommended article: Q3221759
description: scientific article; zbMATH DE number 3915639