Diamond deque: A simple data structure for priority deques

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

• 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

zbMATH Keywords

heapspriority deques

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Min-max heaps and generalized priority queues

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

• 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)