A generalization of binomial queues

DOI10.1016/0020-0190(95)00194-8zbMath0875.68306OpenAlexW2151272762MaRDI QIDQ672741

Rolf Fagerberg

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00194-8

zbMATH Keywords

Data structuresMeldable priority queues

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Reflected min-Max heaps ⋮ A Survey on Priority Queues

Uses Software

• heapsort

Cites Work

• The pairing heap: A new form of self-adjusting heap
• Three priority queue applications revisited
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• Fast meldable priority queues
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of binomial queues