Sorting-based selection algorithms for hypercubic networks

This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based on the selection algorithm of Cole and Yap (1985), as well as on various sorting algorithms for hypercubic networks. The authors fastest algorithm runs in O(lg n lg*n) time, very nearly matching the trivial Omega (lg n) lower bound. Previously, the best upper bound known for selection was O(lg n lg lg n).<>