Finding the αn-TH largest element

Combinatorica

Volumn 16, Issue 1, 1996, Pages 41-58

  Dor, Dorit ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004449328     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01300126     Document Type: Article

References (17)

1. M. BLUM, R.W. FLOYD. V. PRATT, R.L. RIVEST, and R.E. TARJAN: Time bounds for selection, Journal of Computer and System Sciences, 7 (1973), 448-461.
2. S.W. BENT and J.W. JOHN: Finding the median requires 2n comparisons, In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, Rhode Island, 1985, 213-216.
3. L. CARROLL: Lawn tennis tournaments, St. James's Gazette, pages 5-6, August 1883, Reprinited in "The complete stories of Lewis Carroll", Magpie Books Ltd., London, 1993, 775-782.
4. L. CARROLL: Lawn tennis tournaments, St. James's Gazette, pages 5-6, August 1883, Reprinited in "The complete stories of Lewis Carroll", Magpie Books Ltd., London, 1993, 775-782.
5. W. CUNTO and J.I. MUNRO: Average case selection, Journal of the ACM, 36 (2) (1989), 270-279.
6. D. DOR and U. ZWICK: Selecting the median, In Proceedings of the 6rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, 28-37.
7. R.W. FLOYD and R.L. RIVEST: Expected time bounds for selection, Communication of the ACM, 18 (1975), 165-173.
8. A. HADIAN and M. SOBEL: Selecting the t-th largest using binary errorless comparisons, Colloquia Mathematica Societatis János Bolyai, 4 (1969), 585-599.
9. J.W. JOHN: A new lower bound for the set-partition problem, SIAM Journal on Computing, 17 (4) (1988), 640-647.
10. S.S. KISLITSYN: On the selection of the k-th element of an ordered set by pairwise comparisons, Sibirsk. Mat. Zh., 5 (1964), 557-564.
11. DONALD E. KNUTH: Sorting and searching, Volume 3 of The art of computer programming, Addison-Wesley, 1973.
12. T. MOTOKI: A note on upper bounds for selection problems, Information Processing Letters, 15 (5) (1982), 214-219.
13. P. V. RAMANAN and L. HYAFIL: New algorithms for selection, Journal of Algorithms, 5 (1984), 557-578.
14. J. SCHREIER: On tournament elimination systems, Mathesis Polska, 7 (1932), 154-160. (in Polish).
15. A. SCHÖNHAGE, M. PATERSON, and N. PIPPENGER: Finding the median, Journal of Computer and System Sciences, 13 (1976), 184-199.
16. F. YAO: On lower bounds for selection problems, Technical Report MAC TR-121, Mass. Inst. of Technology, 1974.
17. C.K. YAP: New upper bounds for selection, Communication of the ACM, 19 (9) (1976), 501-508.