Diamond deque: A simple data structure for priority deques

DOI10.1016/0020-0190(93)90101-EMaRDI QIDQ685528zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heapspriority deques

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Min-max heaps and generalized priority queues
• A pointer-free data structure for merging heaps and min-max heaps
• Mergeable double-ended priority queues
• scientific article; zbMATH DE number 1857505
• scientific article; zbMATH DE number 2111732

Cites work

• scientific article; zbMATH DE number 4088895 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Min-max heaps and generalized priority queues

Cited in

(6)

• scientific article; zbMATH DE number 2111732 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1857505 (Why is no real title available?)

Describes a project that uses

Uses Software

• heapsort

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)