Three priority queue applications revisited

DOI10.1007/BF01758771MaRDI QIDQ1185291zbMATH OpenFDO

Authors Anrew M. Liao

Publication date 28 June 1992

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

heapspriority queuessorting

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• The pairing heap: A new form of self-adjusting heap
• Self-Adjusting Heaps
• On the efficiency of pairing heaps and related data structures
• Rank-Pairing Heaps
• Distribution-sensitive binomial queues.

Cites work

• A data structure for manipulating priority queues
• Finding Minimum Spanning Trees
• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Implementation and Analysis of Binomial Queue Algorithms
• Self-adjusting binary search trees
• Self-Adjusting Heaps
• The pairing heap: A new form of self-adjusting heap

Cited in

(4)

• A Note on Bottom-Up Skew Heaps
• Twol-amalgamated priority queues
• Correspondence-based data structures for double-ended priority queues
• A generalization of binomial queues

This page was built for publication: Three priority queue applications revisited

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