Author:
de Graaf Jeannette M.,Kosters Walter A.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference4 articles.
1. G. N. Frederickson,The information theory bound is tight for selection in a heap, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, p. 26–33, 1990.
2. D. E. Knuth,The Art of Computer Programming, Volume 3, Sorting and Searching, Addison-Wesley, 1973.
3. P. Poblete, Private communication.
4. M. A. Weiss and J. K. Navlakha,The distribution of keys in a binary heap, p. 510–516 in LNCS 382, Springer, 1989.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献