A generalization of binomial queues

DOI10.1016/0020-0190(95)00194-8MaRDI QIDQ672741zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Data structuresMeldable priority queues

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1003284 (Why is no real title available?)
• scientific article; zbMATH DE number 4062572 (Why is no real title available?)
• scientific article; zbMATH DE number 177565 (Why is no real title available?)
• A data structure for manipulating priority queues
• Fast meldable priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• The pairing heap: A new form of self-adjusting heap
• Three priority queue applications revisited

Cited in

(7)

• Reflected min-Max heaps
• An application of Gegenbauer polynomials in queueing theory
• scientific article; zbMATH DE number 842889 (Why is no real title available?)
• Distribution-sensitive binomial queues.
• scientific article; zbMATH DE number 3856384 (Why is no real title available?)
• scientific article; zbMATH DE number 3283846 (Why is no real title available?)
• A survey on priority queues

Describes a project that uses

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)