I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
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.
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Imran Nasim, Melanie Weber
SCML 2024
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering