In the paper "Fast Fibonacci heaps with worst case extensions"  we have described heaps with both Meld, DecreaseKey and DecreaseKey interfaces, allowing operations with guaranted worst case assymptotically optimal times. The paper was intended to concentrate on  DecreaseKey interface, but it could be hard to separate the two described data structures without carefull reading. Current paper's goal is not to invent a novel data structure, but to describe the rather easy DecreaseKey version in  hopefully readable form. The paper is intended not to require references to other papers.
In the paper "Fast Fibonacci heaps with worst case extensions" , we have described heaps with both Meld-DecreaseKey and DecreaseKey interfaces, allowing operations with guaranteed worst-case asymptotically optimal times. The paper was intended to concentrate on the DecreaseKey interface, but it could be hard to separate the two described data structures without careful reading. The current paper's goal is not to invent a novel data structure, but to describe a rather easy DecreaseKey version in a hopefully readable form. The paper is intended not to require reference to other papers.
A
,
R
Meld, DecreaseKey
Meld-DecreaseKey
R
guaranted worst case assymptotically
guaranteed worst-case asymptotically
A
the
R
carefull reading. Current
careful reading. The current
R
the
a
A
a
R
references
reference