Min-max heaps and generalized priority queues
Communications of the ACM
The Deap—A double-ended heap to implement double-ended priority queues
Information Processing Letters
A balanced search tree with O(1) worst case update time
Acta Informatica
A note on the construction of data structure “deap”
Information Processing Letters
A mergeable double-ended priority queue
The Computer Journal - Special issue on data structures
Diamond deque: a simple data structure for priority deques
Information Processing Letters
On the complexity of building an interval heap
Information Processing Letters
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Information Processing Letters
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A general technique for implementation of efficient priority queues
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
| Hi-index | 0.89 |
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(logn) deletemin, or with O(logn) 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.