Selecting the median

SIAM Journal on Computing

Volumn 28, Issue 5, 1999, Pages 1722-1758

  Dor, Dorit ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; NUMERICAL METHODS; RANDOM ACCESS STORAGE;

GREEN FACTORY; MEDIAN SELECTION; SELECTION ALGORITHMS;

COMPUTATION THEORY;

EID: 0032614072     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795288611     Document Type: Article

References (27)

1. M. AIGNER, Selecting the top three elements, Discrete Appl. Math., 4 (1982), pp. 247-267.
2. M. BLUM, R. W. FLOYD, V. PRATT, R. L. RIVEST, AND R. E. TARJAN, Time, bounds for selection, J. Comput. System Sci., 7 (1973), pp. 448-461.
3. 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, RI, 1985, pp. 213-216.
4. W. CUNTO AND J. I. MUNRO, Average case selection, J. ACM, 36 (1989), pp. 270-279.
5. D. DOR, J. HÅSTAD, S. ULPBERG, AND U. ZWICK, On lower bounds for selecting the median, submitted.
6. D. DOR, Selection Algorithms, Ph.D. thesis, Department of Computer Science, Tel Aviv University, Tel Aviv, Israel, 1995.
7. D. DOR AND U. ZWICK, Selecting the median, in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 22-24, 1995, SIAM, Philadelphia, 1995, pp. 28-37.
8. D. DOR AND U. ZWICK, Finding the αn-th largest element, Combinatorica, 16 (1996), pp. 41-58.
9. D. DOR AND U. ZWICK, Median selection requires (2+∈)n comparisons, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, 1996, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 125-134.
10. J. EUSTERBROCK, Errata to selecting the top three elements by M. Aigner: A result of a computer-assisted proof search, Discrete Appl. Math., 41 (1993), pp. 131-137.
11. F. FUSSENEGGER AND H. N. GABOW, A counting approach to lower bounds for selection problems, J. ACM, 26 (1978), pp. 227-238.
12. L. R. FORD AND S. M. JOHNSON, A tournament problem, Amer. Math. Monthly, 66 (1959), pp. 387-389.
13. R. W. FLOYD AND R. L. RIVEST, Expected time bounds for selection, Comm. ACM, 18 (1975), pp. 165-173.
14. A. HADIAN AND M. SOBEL, Selecting the t-th largest using binary errorless comparisons, in Combinatorial Theory and Its Applications, II, Proc. Colloq., Balatonfüred, 1969, North-Holland, Amsterdam, 1970, pp. 585-599.
15. L. HYAFIL, Bounds for selection, SIAM J. Comput., 5 (1976), pp. 109-114.
16. J. W. JOHN, A new lower bound for the set-partitioning problem, SIAM J. Comput., 17 (1988), pp. 640-647.
17. D. G. KIRKPATRICK, A unified, lower bound for selection and set partitioning problems, J. ACM, 28 (1981), pp. 150-165.
18. S. S. KISLITSYN, On the selection of the k-th element of an ordered set by pairwise comparisons, Sibirsk. Mat. Zh., 5 (1964), pp. 557-564.
19. I. MUNRO AND P. V. POBLETE, A Lower Bound for Determining the Median, Technical report CS-82-21, University of Waterloo, Waterloo, Ontario, 1982.
20. M. S. PATERSON, Progress in selection, in Proceedings of the 5th Scandinavian Workshop on Algorithm Theory. Reykjavík, Iceland, 1996, Lecture Notes in Comput. Sci. 1097, Springer, Berlin, 1996, pp. 368-379.
21. I. POHL, A sorting problem and its complexity, Comm. ACM, 15 (1972), pp. 462-464.
22. P. V. RAMANAN AND L. HYAFIL, New algorithms for selection, J. Algorithms, 5 (1984), pp. 557-578.
23. J. SCHREIER, On tournament elimination systems, Math Polska, 7 (1932), pp. 154-160 (in Polish).
24. A. SCHÖNHAGE, M. PATERSON. AND N. PIPPENGER, Finding the median, J. Comput. System Sci., 13 (1976), pp. 184-199.
25. P. K. R. STOCKMEYER AND F. F. YAO, On the optimality of linear merge, SIAM J. Comput., 9 (1980), pp. 85-90.
26. F. YAO, On Lower Bounds for Selection Problems, Technical report MAC TR-121, Massachusetts Institute of Technology, Cambridge, MA, 1974.
27. C. K. YAP, New upper bounds for selection, Comm. ACM, 19 (1976), pp. 501-508.