A generalization of binomial queues

DOI10.1016/0020-0190(95)00194-8zbMATH Open0875.68306OpenAlexW2151272762MaRDI QIDQ672741FDOQ672741

Authors: 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

Recommendations

• Fast meldable priority queues
• Distribution-sensitive binomial queues.
• scientific article; zbMATH DE number 871899
• Melding priority queues
• Algorithm Theory - SWAT 2004

zbMATH Keywords

Data structuresMeldable priority queues

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A data structure for manipulating priority queues
• The pairing heap: A new form of self-adjusting heap
• Three priority queue applications revisited
• Title not available (Why is that?)
• Implementation and Analysis of Binomial Queue Algorithms
• Fast meldable priority queues

Cited In (7)

• Reflected min-Max heaps
• Title not available (Why is that?)
• An application of Gegenbauer polynomials in queueing theory
• Distribution-sensitive binomial queues.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on priority queues

Uses Software

• heapsort

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

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