Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Expanders obtained from affine transformations
Combinatorica - Theory of Computing
An optimally efficient selection algorithm
Information Processing Letters
Optimal parallel selection had complexity O(log log N)
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Matching partition a linked list and its optimization
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Discrete Applied Mathematics - Computational combinatiorics
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Optimal parallel multiselection on EREW PRAM
Parallel Computing
Small-rank selection in parallel, with applications to heap construction
Journal of Algorithms
Selecting small ranks in EREW PRAM
Information Processing Letters
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate and Exact Deterministic Parallel Selection
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
We present an optimal parallel selection algorithm on the EREW PRAM. This algorithm runs in O(log n) time with n/log n processors. This complexity matches the known lower bound for parallel selection on the EREW PRAM model. We therefore close this problem which has been open for more than a decade.