A parallel median algorithm
We give a deterministic algorithm for finding the k th smallest item in a set of n items, running in O((log log n)\({}^ 2)\) parallel time on O(n) processors in Valiant's comparison model.
scientific article; zbMATH DE number 3915639