@article{27454e35b09a4835927c0e6ac875d189,
title = "Hollow heaps",
abstract = "We introduce the hollow heap, a very simple data structure with the same amortized efficiency as the classical Fibonacci heap. All heap operations except delete and delete-min take O(1) time, worst case as well as amortized; delete and delete-min take O(logn) amortized time on a heap of n items. Hollow heaps are the simplest structure to achieve these bounds. Hollow heaps combine two novel ideas: the use of lazy deletion and re-insertion to do decrease-key operations and the use of a dag (directed acyclic graph) instead of a tree or set of trees to represent a heap. Lazy deletion produces hollow nodes (nodes without items), giving the data structure its name.",
keywords = "Amortized analysis, Data structures, Heaps, Priority queues",
author = "Hansen, {Thomas Dueholm} and Haim Kaplan and Tarjan, {Robert E.} and Uri Zwick",
note = "Publisher Copyright: {\textcopyright} 2017 ACM.",
year = "2017",
month = jul,
doi = "10.1145/3093240",
language = "אנגלית",
volume = "13",
journal = "ACM Transactions on Algorithms",
issn = "1549-6325",
publisher = "Association for Computing Machinery (ACM)",
number = "3",
}