1. Producing posets;Aigner;Discrete Math.,1981
2. Selecting the t-th largest using binary errorless comparisons;Hadian;Coll. Math. Soc. János Bolyai,1969
3. Bounds for selection;Hyafil;SIAM J. Comput.,1976
4. On the selection of the k-th element of an ordered set by pairwise comparisons;Kislitsyn;Sibirsk Math. Zk.,1964
5. The Art of Computer Programming;Knuth,1973