2 citations · 4 across the 11 of their papers we have counts for
1 paper · 1 filter
Amr Elmasry
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amor…