An optimally efficient selection algorithm

Research output: Contribution to journalArticle

Abstract

We give an optimally efficient parallel algorithm for selection on the EREW PRAM. It requires a linear number of operations and O(log n log*n) time. A modification of the algorithm runs on the CRCW PRAM. It requires a linear number of operations and O(log n log*/log log n) time.

Original languageEnglish (US)
Pages (from-to)295-299
Number of pages5
JournalInformation Processing Letters
Volume26
Issue number6
DOIs
StatePublished - Jan 25 1988

Fingerprint

Parallel algorithms
EREW PRAM
Parallel Algorithms
Efficient Algorithms

Keywords

  • optimal algorithm
  • parallel algorithm
  • Selection

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

An optimally efficient selection algorithm. / Cole, Richard John.

In: Information Processing Letters, Vol. 26, No. 6, 25.01.1988, p. 295-299.

Research output: Contribution to journalArticle

@article{515722c06f254cdeb8b94bf15d09e76d,
title = "An optimally efficient selection algorithm",
abstract = "We give an optimally efficient parallel algorithm for selection on the EREW PRAM. It requires a linear number of operations and O(log n log*n) time. A modification of the algorithm runs on the CRCW PRAM. It requires a linear number of operations and O(log n log*/log log n) time.",
keywords = "optimal algorithm, parallel algorithm, Selection",
author = "Cole, {Richard John}",
year = "1988",
month = "1",
day = "25",
doi = "10.1016/0020-0190(88)90186-X",
language = "English (US)",
volume = "26",
pages = "295--299",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - An optimally efficient selection algorithm

AU - Cole, Richard John

PY - 1988/1/25

Y1 - 1988/1/25

N2 - We give an optimally efficient parallel algorithm for selection on the EREW PRAM. It requires a linear number of operations and O(log n log*n) time. A modification of the algorithm runs on the CRCW PRAM. It requires a linear number of operations and O(log n log*/log log n) time.

AB - We give an optimally efficient parallel algorithm for selection on the EREW PRAM. It requires a linear number of operations and O(log n log*n) time. A modification of the algorithm runs on the CRCW PRAM. It requires a linear number of operations and O(log n log*/log log n) time.

KW - optimal algorithm

KW - parallel algorithm

KW - Selection

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

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

U2 - 10.1016/0020-0190(88)90186-X

DO - 10.1016/0020-0190(88)90186-X

M3 - Article

VL - 26

SP - 295

EP - 299

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 6

ER -