A parallel median algorithm

Research output: Contribution to journalArticle

Abstract

We give a deterministic algorithm for finding the kth 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.

Original languageEnglish (US)
Pages (from-to)137-139
Number of pages3
JournalInformation Processing Letters
Volume20
Issue number3
DOIs
StatePublished - Apr 8 1985

Fingerprint

Model Comparison
Deterministic Algorithm

Keywords

  • comparison model
  • median
  • Parallel algorithm
  • selection

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

A parallel median algorithm. / Cole, Richard; Yap, Chee.

In: Information Processing Letters, Vol. 20, No. 3, 08.04.1985, p. 137-139.

Research output: Contribution to journalArticle

@article{2d9b3074b35440a28490d096ff960c06,
title = "A parallel median algorithm",
abstract = "We give a deterministic algorithm for finding the kth 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.",
keywords = "comparison model, median, Parallel algorithm, selection",
author = "Richard Cole and Chee Yap",
year = "1985",
month = "4",
day = "8",
doi = "10.1016/0020-0190(85)90080-8",
language = "English (US)",
volume = "20",
pages = "137--139",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - A parallel median algorithm

AU - Cole, Richard

AU - Yap, Chee

PY - 1985/4/8

Y1 - 1985/4/8

N2 - We give a deterministic algorithm for finding the kth 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.

AB - We give a deterministic algorithm for finding the kth 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.

KW - comparison model

KW - median

KW - Parallel algorithm

KW - selection

UR - http://www.scopus.com/inward/record.url?scp=0022421085&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022421085&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(85)90080-8

DO - 10.1016/0020-0190(85)90080-8

M3 - Article

AN - SCOPUS:0022421085

VL - 20

SP - 137

EP - 139

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 3

ER -