Diamond deque: A simple data structure for priority deques
From MaRDI portal
Publication:685528
DOI10.1016/0020-0190(93)90101-EzbMath0778.68028OpenAlexW2053885947MaRDI QIDQ685528
Publication date: 13 January 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90101-e
Related Items
Two new methods for constructing double-ended priority queues from priority queues ⋮ Multidimensional heaps and complementary range searching ⋮ Symmetric min-max heap: a simpler data structure for double-ended priority queue ⋮ A Survey on Priority Queues
Uses Software
Cites Work
This page was built for publication: Diamond deque: A simple data structure for priority deques
