A note on constructing min-max heaps

DOI10.1007/BF01952680MaRDI QIDQ1123594zbMATH OpenOpenAlexFDO

Authors Thomas Strothotte, Patrik Eriksson, Sören Vallner

Publication date 1989

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01952680

zbMATH Keywords

min-max heapspriority queue

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Bounds for min-max heaps
• scientific article; zbMATH DE number 4047086
• Min-max heaps and generalized priority queues
• scientific article; zbMATH DE number 2065978
• Interval Heaps

Cites work

• Average-case results on heapsort
• Bounds for min-max heaps
• Heaps on Heaps
• scientific article; zbMATH DE number 4047086 (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
• On the random construction of heaps

Cited in

(10)

• Reflected min-Max heaps
• Bounds for min-max heaps
• The bounds of min-max pair heap construction
• A note on the construction of the data structure ``deap
• A note on constructing binary heaps with periodic networks.
• Min-max heaps and generalized priority queues
• scientific article; zbMATH DE number 4047086 (Why is no real title available?)
• Interval Heaps
• Multidimensional heaps and complementary range searching
• On sorting, heaps, and minimum spanning trees

This page was built for publication: A note on constructing min-max heaps

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