A Fibonnaci Heap supports the following operations:
insert(key, data): adds a new element to the data structure
find-min(): returns a pointer to the element with minimum key
delete-min(): removes the element with minimum key
delete(node): deletes the element pointed to by
decrease-key(node): decreases the key of the element pointed to by
All non-delete operations are $O(1)$ (amortized) time, and the delete operations are $O(\log n)$ amortized time.
Are there any implementations of a priority queue which also support
increase-key(node) in $O(1)$ (amortized) time?