Multidimensional heaps and complementary range searching
From MaRDI portal
Publication:845992
Recommendations
Cites work
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
- A balanced search tree O(1) worst-case update time
- A note on constructing min-max heaps
- A note on the construction of the data structure ``deap
- Bounds for min-max heaps
- Correspondence-based data structures for double-ended priority queues
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Diamond deque: A simple data structure for priority deques
- Fast meldable priority queues
- Interval Heaps
- Mergeable double-ended priority queues
- Min-max heaps and generalized priority queues
- On the complexity of building an interval heap
- Reflected 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
This page was built for publication: Multidimensional heaps and complementary range searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845992)