1. Time bounds for selection;Blum;J. CSS,1973
2. The complexity of selection and ranking in X + Y and matrices with sorted columns;Frederickson;J. CSS,1982
3. Generalized selection and ranking: Sorted matrices;Frederickson;SIAM J. Comput.,1984
4. Two applications of probabilistic search technique: Sorting X + Y and building balanced search trees;Fredman,1975
5. Sorting X + Y;Harper;Comm. ACM,1975