An Optimally Efficient Selection Algorithm

Download PDF
Open Webpage

Richard J. Cole

Published: 1988, Last Modified: 12 May 2025Inf. Process. Lett. 1988EveryoneRevisionsBibTeXCC BY-SA 4.0
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.