## DC-Top-k: A Novel Top-k Selecting Algorithm and Its Parallelization

- Zhengyuan Xue, Ruixuan Li, Heng Zhang, Xiwu Gu, Zhiyong Xu
- 2016 45th International Conference on Parallel…
- 2016

2 Excerpts

- Published 1989 in Algorithmica

LetW itk(n) be the minimax complexity of selecting thek largest elements ofn numbersx 1,x 2,...,x n by pairwise comparisonsx i :x j . It is well known thatW 2(n) =n−2+ [lgn], andW k (n) = n + (k−1)lg n +O(1) for all fixed k ≥ 3. In this paper we studyW′ k (n), the minimax complexity of selecting thek largest, when tests of the form “Isx i the median of {x i ,x j ,x t }?” are also allowed. It is proved thatW′2(n) =n−2+ [lgn], andW′ k (n) =n + (k−1)lg2 n +O(1) for all fixedk≥3.

@article{Yao1989OnST,
title={On selecting thek largest with median tests},
author={Andrew Chi-Chih Yao},
journal={Algorithmica},
year={1989},
volume={4},
pages={293-300}
}