Conference paper
Reasoning about RoboCup soccer narratives
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
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.
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
George Markowsky
J. Math. Anal. Appl.