Diamond deque: A simple data structure for priority deques
From MaRDI portal
Publication:685528
DOI10.1016/0020-0190(93)90101-EzbMATH Open0778.68028OpenAlexW2053885947MaRDI QIDQ685528FDOQ685528
Authors: Juan-Miguel Gracia
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
Recommendations
Cites Work
Cited In (6)
- Two new methods for constructing double-ended priority queues from priority queues
- Symmetric min-max heap: a simpler data structure for double-ended priority queue
- Multidimensional heaps and complementary range searching
- A survey on priority queues
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Diamond deque: A simple data structure for priority deques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685528)