A note on the construction of the data structure “deap”

Information Processing Letters

Volume 31, Issue 6, 19 June 1989, Pages 315-317

Click to open first page preview

S. Carlsson
The deap—A double-ended heap to implement double-ended priority queues
Inform. Process. Lett.
(1987)
M.D. Atkinson et al.
Min-Max heaps and generalized priority queues
Comm. ACM
(1986)
S. Carlsson et al.
Deap Construction Algorithms
L. Draws et al.
Two new algorithms for constructing min-max heaps

There are more references available in the full text version of this article.

Multidimensional heaps and complementary range searching
2007, Information Processing Letters
We discuss multidimensional heaps, that is, heaps in which each element has a d-tuple of keys and we can find and delete the minimum element for each coordinate. These structures are a reasonable generalization of double-ended heaps, and can be realized with $O (1)$ insert, merge, findmin and $O (\log n)$ deletemin, or with $O (\log n)$ insert, and $O (1)$ findmin, deletemin, all these times being worst-case. We also apply these structures to the problem of complementary range searching, improving on the performance of d-dimensional interval heaps introduced by van Leeuwen and West.
A 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 Structures
Recurrence Relations on Heaps
1996, Algorithmica (New York)
An optimal parallel algorithm to construct a deap
1992, International Journal of Computer Mathematics
Parallel 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