The deap—a double-ended heap to implement double-ended priority queues
References (7)
A variant of Heapsort with almost optimal number of comparisons
Inform. Process. Lett.
(1987)- et al.
Min-Max heaps and generalized priority queues
Comm. ACM
(1986) Deap—a double-ended heap to implement double-ended priority queues
Tech. Rept. CODEN: LUNFD6⧸(NFCS-3011)⧸(1–7)
(1986)
There are more references available in the full text version of this article.
Cited by (34)
Multidimensional heaps and complementary range searching
2007, Information Processing LettersThe d-deap*: A fast and simple cache-aligned d-ary deap
2005, Information Processing LettersReflected min-max heaps
2003, Information Processing LettersSymmetric Min-Max heap: A simpler data structure for double-ended priority queue
1999, Information Processing LettersA Survey of VLSI Implementations of Tree Search Algorithms for MIMO Detection
2016, Circuits, Systems, and Signal ProcessingA survey on priority queues
2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1987 Published by Elsevier B.V.