Mark Allen Weiss;Jainendra K. Navlakha
-;-
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