Selecting small ranks in EREW PRAM

DOI10.1016/S0020-0190(99)00113-1zbMath0999.68049OpenAlexW1985478601WikidataQ126849106 ScholiaQ126849106MaRDI QIDQ1606990

Sarnath Ramnath, Venkatesh Raman

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00113-1

zbMATH Keywords

EREW PRAM

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• An optimally efficient selection algorithm
• Time bounds for selection
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Parallel Merge Sort
• Small-Rank Selection in Parallel, with Applications to Heap Construction

This page was built for publication: Selecting small ranks in EREW PRAM