Multidimensional heaps and complementary range searching
From MaRDI portal
Publication:845992
DOI10.1016/j.ipl.2006.12.008zbMath1184.68199OpenAlexW2035971684MaRDI QIDQ845992
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.008
Uses Software
Cites Work
- Unnamed Item
- Diamond deque: A simple data structure for priority deques
- Reflected min-Max heaps
- Bounds for min-max heaps
- A balanced search tree O(1) worst-case update time
- A note on constructing min-max heaps
- Symmetric min-max heap: a simpler data structure for double-ended priority queue
- The relaxed min-max heap: A mergeable double-ended priority queue
- On the complexity of building an interval heap
- A note on the construction of the data structure ``deap
- Min-max heaps and generalized priority queues
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Interval Heaps
- A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
- Fast meldable priority queues
- MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
- Correspondence-based data structures for double-ended priority queues
