Affiliation:
1. Aarhus University, Aarhus N., Denmark
2. Tel Aviv University, Tel Aviv, Israel
3. Princeton University and Intertrust Technologies, Sunnyvale, CA, USA
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 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.
Funder
Danmarks Grundforskningsfond
German-Israeli Foundation for Scientific Research and Development
United States - Israel Binational Science Foundation
National Natural Science Foundation of China
Israeli Centers of Research Excellence
Natur og Univers, Det Frie Forskningsråd
Israel Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献