Affiliation:
1. IT University of Copenhagen, Denmark
2. Lund University, Lund, Sweden
3. AT&T Labs--Research, Florham Park, NJ
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
*.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimizing Binary Heaps;Theory of Computing Systems;2017-04-21
2. Equivalence Between Priority Queues and Sorting;Encyclopedia of Algorithms;2016
3. Equivalence Between Priority Queues and Sorting;Encyclopedia of Algorithms;2015
4. Weak heaps engineered;Journal of Discrete Algorithms;2013-11
5. A Survey on Priority Queues;Lecture Notes in Computer Science;2013