Optimal parallel selection has complexity O(Log Log N)Miklós AjtaiJános Komlóset al.1989Journal of Computer and System Sciences