Two new methods for constructing double-ended priority queues from priority queues
From MaRDI portal
Publication:836938
DOI10.1007/s00607-008-0019-2zbMath1183.68213OpenAlexW2022705471MaRDI QIDQ836938
Jyrki Katajainen, Amr Elmasry, Claus Jensen
Publication date: 9 September 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-008-0019-2
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)
Related Items
Two new methods for constructing double-ended priority queues from priority queues ⋮ Regular numeral systems for data structures ⋮ Optimizing binary heaps ⋮ Two-tier relaxed heaps ⋮ Bipartite binomial heaps ⋮ A Survey on Priority Queues
Cites Work
- Diamond deque: A simple data structure for priority deques
- Two new methods for constructing double-ended priority queues from priority queues
- Two-tier relaxed heaps
- 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
- Time bounds for selection
- Black box for constant-time insertion in priority queues (note)
- Min-max heaps and generalized priority queues
- Interval Heaps
- MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
- Algorithms and Data Structures
- Correspondence-based data structures for double-ended priority queues
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
