Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A data structure for manipulating priority queues
Communications of the ACM
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A programming and problem-solving seminar
A programming and problem-solving seminar
ACM Transactions on Algorithms (TALG)
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Strictly-Regular number system and data structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We introduce a variant of fat heaps that does not rely on regular counters, and still achieves the optimal worst-case bounds: O(1) for find-min, insert and decrease, and $O(\lg n)$ for delete and delete-min. Our variant is simpler to explain, more efficient, and easier to implement. Experimental results suggest that our implementation is superior to structures, like run-relaxed heaps, that achieve the same worst-case bounds, and competitive to structures, like Fibonacci heaps, that achieve the same bounds in the amortized sense.