Black box for constant-time insertion in priority queues (note)

Authors:
Stephen Alstrup;Thore Husfeldt;Theis Rauhe;Mikkel Thorup
Affiliations:
IT University of Copenhagen, Denmark;Lund University, Lund, Sweden;IT University of Copenhagen, Denmark;AT&T Labs--Research, Florham Park, NJ
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2005

Citing 5
Cited 4

Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Buckets, Heaps, Lists, and Monotone Priority Queues

SIAM Journal on Computing
Worst-case efficient priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Equivalence between Priority Queues and Sorting

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Marked Ancestor Problems

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Melding priority queues

ACM Transactions on Algorithms (TALG)
Equivalence between priority queues and sorting

Journal of the ACM (JACM)
The magic of a number system

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Weak heaps engineered

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple black box that takes a priority queue Q which supports find-min, insert, and delete in x-time at most t. Here x-time may be worst-case, expected, or amortized. The black-box transforms Q into a priority queue Q* that supports find-min in constant time, insert in constant x-time, and delete in x-time O(t). Moreover, if Q supports dec-key in constant time, then so does Q*.