Parallel Selection with High Probability

Given a set of n elements in some unknown order, parallel comparison algorithms to select the tth highest with probability $1- o(1)$ as $n \to \infty $ are considered, where each order is assumed to be equally likely. Such an algorithm is given using four rounds and $cn$ comparisons per round, and it is shown that no such algorithm exists using three rounds and $cn$ comparisons per round.