Reflected min-Max heaps

DOI10.1016/S0020-0190(02)00501-XzbMath1173.68456OpenAlexW2058183193MaRDI QIDQ1007603

Kostas Tsichlas, Christos Makris, Athanasios K. Tsakalidis

Publication date: 23 March 2009

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00501-x

zbMATH Keywords

algorithmsdata structuresworst-case complexitypriority queues

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (3)

Two new methods for constructing double-ended priority queues from priority queues ⋮ Multidimensional heaps and complementary range searching ⋮ Some Results for Elementary Operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of binomial queues
• Symmetric min-max heap: a simpler data structure for double-ended priority queue
• The relaxed min-max heap: A mergeable double-ended priority queue
• Min-max heaps and generalized priority queues
• Interval Heaps
• A data structure for manipulating priority queues
• Fast meldable priority queues
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Reflected min-Max heaps