Optimal Parallel Selection has Complexity O(Log Log n).

Sun, 01 Jan 1989 00:00:00 +0100

Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
Optimal Parallel Selection has Complexity O(Log Log n). J. Comput. Syst. Sci. 38(1): 125-133 (1989)