Bounds for min-max heaps

DOI10.1007/BF01933726zbMath0642.68056WikidataQ62037532 ScholiaQ62037532MaRDI QIDQ1101212

Jörg-Rüdiger Sack, Alnoor Hasham

Publication date: 1987

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

double-ended priority queuemin-max heaps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Related Items (9)

Finding maximum likelihood estimators for the three-parameter Weibull distribution ⋮ Multidimensional heaps and complementary range searching ⋮ The K-D heap: An efficient multi-dimensional priority queue ⋮ Recurrence relations on heaps ⋮ A note on constructing min-max heaps ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison ⋮ A note on the construction of the data structure ``deap ⋮ The relaxed min-max heap: A mergeable double-ended priority queue

Uses Software

• heapsort

Cites Work

• Min-max heaps and generalized priority queues
• A Counting Approach to Lower Bounds for Selection Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for min-max heaps