Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
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.
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996