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

DOI10.1016/S0020-0190(99)00014-9zbMath0925.68052OpenAlexW1989972921MaRDI QIDQ1285766

C. Pandu Rangan, A. Arvind

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 structurespriority queueheap

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (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 ⋮ Multidimensional heaps and complementary range searching ⋮ A fast algorithm for quadratic resource allocation problems with nested constraints ⋮ Reflected min-Max heaps ⋮ A Survey on Priority Queues

Cites Work

• Diamond deque: A simple data structure for priority deques
• Min-max heaps and generalized priority queues
• Unnamed Item

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