Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
We show that in the deterministic comparison model for parallel computation, p = n processors can select the kth smallest item from a set of n numbers in O(log log n) parallel time. With this result all comparison tasks (selection, merging, sorting) now have upper and lower bounds of the same order in both random and deterministic models. This optimal time bound holds even if p = o(n). © 1989.
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Leo Liberti, James Ostrowski
Journal of Global Optimization