Symmetric min-max heap: a simpler data structure for double-ended priority queue

DOI10.1016/S0020-0190(99)00014-9MaRDI QIDQ1285766zbMATH OpenOpenAlexFDO

Authors A. Arvind, C. Pandu Rangan

Publication date 28 April 1999

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(99)00014-9

zbMATH Keywords

data structuresheappriority queue

Mathematics Subject Classification ID

Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Diamond deque: A simple data structure for priority deques
• Min-max heaps and generalized priority queues

Cited in

(6)

• The d-deap\(^*\): a fast and simple cache-aligned d-ary deap
• Two new methods for constructing double-ended priority queues from priority queues
• Reflected min-Max heaps
• Multidimensional heaps and complementary range searching
• A fast algorithm for quadratic resource allocation problems with nested constraints
• A survey on priority queues

This page was built for publication: Symmetric min-max heap: a simpler data structure for double-ended priority queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285766)