A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not
[chapter]
2014
Lecture Notes in Computer Science
A lower bound is presented which shows that a class of heap algorithms in the pointer model with only heap pointers must spend Ω log log n log log log n amortized time on the Decrease-Key operation (given O(log n) amortized-time Extract-Min). Intuitively, this bound shows the key to having O(1)-time Decrease-Key is the ability to sort O(log n) items in O(log n) time; Fibonacci heaps [M. .L. Fredman and R. E. Tarjan. J. ACM 34(3):596-615 (1987)] do this through the use of bucket sort. Our lower
doi:10.1007/978-3-662-43948-7_53
fatcat:x4iqyq4embdwboxck72j3w6xti