Add to ORKGWe 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) amortized time, and delete-min requires $O(\log n)$ amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our construction is to propagate rank updates instead of performing cascaded cuts following a decrease-key operation, allowing for a relaxed structure
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing h...
Abstract. We give a priority queue which guarantees the worst-case cost of Θ(1) per minimum finding,...
We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap mode...
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-mi...
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-mi...
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-m...
A Fibonacci heap is a deterministic data structure implementing a priority queue with op-timal amort...
AbstractAs an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, w...
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjo...
A lower bound is presented which shows that a class of heap algorithms in the pointer model with onl...
AbstractThe weak heap is a priority queue that was introduced as a competitive structure for sorting...
Abstract. A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This ne...
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, ...
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time...
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing h...
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing h...
Abstract. We give a priority queue which guarantees the worst-case cost of Θ(1) per minimum finding,...
We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap mode...
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-mi...
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-mi...
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-m...
A Fibonacci heap is a deterministic data structure implementing a priority queue with op-timal amort...
AbstractAs an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, w...
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjo...
A lower bound is presented which shows that a class of heap algorithms in the pointer model with onl...
AbstractThe weak heap is a priority queue that was introduced as a competitive structure for sorting...
Abstract. A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This ne...
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, ...
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time...
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing h...
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing h...
Abstract. We give a priority queue which guarantees the worst-case cost of Θ(1) per minimum finding,...
We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap mode...