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.

[1]  János Komlós,et al.  Deterministic selection in O(loglog N) parallel time , 1986, STOC '86.

[2]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[3]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Richard Cole,et al.  A Parallel Median Algorithm , 1985, Inf. Process. Lett..

[5]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[6]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.