The information theory bound is tight for selection in a heap

Authors:
G. N. Frederickson
Affiliations:
Department of Computer Science, Purdue University, West Lafayette, Indiana
Venue:
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Year:
1990

Finding the median requires 2n comparisons

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An optimal-time algorithm for slope selection

SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The Distribution of Keys in a Binary Heap

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures

The complexity of heaps

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An Efficient Algorithm for the Approximate Median Selection Problem

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity

Hi-index	0.00