Three priority queue applications revisited

DOI10.1007/BF01758771zbMath0748.68010MaRDI QIDQ1185291

Anrew M. Liao

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

sortingpriority queuesheaps

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

A generalization of binomial queues

Cites Work

• The pairing heap: A new form of self-adjusting heap
• Self-adjusting binary search trees
• Finding Minimum Spanning Trees
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• Self-Adjusting Heaps
• Unnamed Item
• Unnamed Item
• Unnamed Item

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