@inproceedings{585f36ecf740434ba5a8b8659028839d,
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(log n) amortized time. Hollow heaps are by far the simplest structure to achieve this. 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.",
author = "Thomas Dueholm and Haim Kaplan and Tarjan, {Robert E.} and Uri Zwick",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015 ; Conference date: 06-07-2015 Through 10-07-2015",
year = "2015",
doi = "https://doi.org/10.1007/978-3-662-47672-7_56",
language = "الإنجليزيّة",
isbn = "9783662476710",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "689--700",
editor = "Halldorsson, {Magnus M.} and Naoki Kobayashi and Bettina Speckmann and Kazuo Iwama",
booktitle = "Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings",
}