Finding the median requires 2n comparisons

Authors:
S W Bent;J W John
Affiliations:
Computer Science Department, University of Wisconsin-Madison, 1210 West Dayton St., Madsion, Wisconsin;Computer Science Department, University of Wisconsin-Madison, 1210 West Dayton St., Madsion, Wisconsin
Venue:
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Year:
1985

Average case selection

Journal of the ACM (JACM)
The information theory bound is tight for selection in a heap

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The complexity of heaps

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finding the ith largest of n for small i,n

ACM SIGACT News
Selecting the median

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Range Medians

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Comparison-based time-space lower bounds for selection

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Comparison-based time-space lower bounds for selection

ACM Transactions on Algorithms (TALG)
Finding the minimum number of elements with sum above a threshold

Information Sciences: an International Journal

Hi-index	0.01