Proceedings of 37th Conference on Foundations of Computer Science (1996)
Oct. 14, 1996 to Oct. 16, 1996
Improving a long standing result of Bent and John, we obtain a (2+e)n lower bound (for some fixed .e > 0) on the number of comparisons required, in the worst case, for selecting the median of n elements. The new lower bound is obtained using a weightfunction that allows us to combine leaf counting and adversary arguments. I
D. Dor and U. Zwick, "Median Selection Requires Comparisons," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 125.