The deap—a double-ended heap to implement double-ended priority queues
- 15 September 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (1) , 33-36
- https://doi.org/10.1016/0020-0190(87)90033-0
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A variant of heapsort with almost optimal number of comparisonsInformation Processing Letters, 1987
- Min-max heaps and generalized priority queuesCommunications of the ACM, 1986
- Algorithm 245: TreesortCommunications of the ACM, 1964
- AlgorithmsCommunications of the ACM, 1964