A general technique for implementation of efficient priority queues

Authors:
Affiliations:
Venue:
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Year:
1995

Citing 0
Cited 7

A Parallel Priority Data Structure with Applications

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Reflected min-max heaps

Information Processing Letters
Multidimensional heaps and complementary range searching

Information Processing Letters
Thin heaps, thick heaps

ACM Transactions on Algorithms (TALG)
The violation heap: a relaxed Fibonacci-like heap

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Strict fibonacci heaps

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Rank-Pairing Heaps

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: This paper presents a very general technique for the implementation of mergeable priority queues. The amortized running time is O(log n) for DELETEMIN and DELETE, and /spl Theta/(1) for all other standard operations. In particular, the operation DECREASEKEY runs in amortized constant time. The worst-case running time is O(log n) or better for all operations. Several examples of mergeable priority queues are given. The examples include priority queues that are particular well suited for external storage. The space requirement is only two pointers and one information field per item. The technique is also used to implement mergeable, double-ended priority queues. For these queues, the worst-case time bound for insertion is /spl Theta/(1), which improves the best previously known bound. For the other operations, the time bounds are the same as the best previously known bounds, worst-case as well as amortized.