A note on the construction of the data structure “deap”
References (8)
The deap—A double-ended heap to implement double-ended priority queues
Inform. Process. Lett.
(1987)- et al.
Min-Max heaps and generalized priority queues
Comm. ACM
(1986) - et al.
Deap Construction Algorithms
- et al.
Two new algorithms for constructing min-max heaps
There are more references available in the full text version of this article.
Cited by (7)
Multidimensional heaps and complementary range searching
2007, Information Processing LettersA survey on priority queues
2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Advanced data structures
2008, Advanced Data StructuresRecurrence Relations on Heaps
1996, Algorithmica (New York)An optimal parallel algorithm to construct a deap
1992, International Journal of Computer MathematicsParallel complexity of heaps and min-max heaps
1992, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ∗
These authors were supported financially by NFR Grant F-FU 8992-100 (Sweden).
- ∗∗
This work was done in part while the author was on leave at Institutionen för Teknisk Databehandling, Uppsala Universitet, Sweden
Copyright © 1989 Published by Elsevier B.V.