The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Priority Queues with Multiple Time Fingers
[article]
2010
arXiv
pre-print
A priority queue is presented that supports the operations insert and find-min in worst-case constant time, and delete and delete-min on element x in worst-case O(lg(minw_x, q_x+2)) time, where w_x (respectively q_x) is the number of elements inserted after x (respectively before x) and are still present at the time of the deletion of x. Our priority queue then has both the working-set and the queueish properties, and more strongly it satisfies these properties in the worst-case sense. We also
arXiv:1009.5538v1
fatcat:t3pm2ukohvbspdjslxusyy53dm