Black box for constant-time insertion in priority queues
Research output: Contribution to journal › Article
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*.
|Research areas and keywords||
Subject classification (UKÄ) – MANDATORY
|Journal||ACM Transactions on Algorithms|
|Publication status||Published - 2005|