Thin heaps, thick heaps-Reference-Cited by-同舟云学术

Thin heaps, thick heaps

Published:2008-03 Issue:1 Volume:4 Page:1-14
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Kaplan Haim¹,Tarjan Robert Endre²

Affiliation:

1. Tel Aviv University, Israel

2. Princeton University, Princeton, NJ and Hewlett Packard Laboratories, Palo Alto, CA

Abstract

The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in practice as other heap implementations. Expanding on ideas of Høyer [1995], we describe three heap implementations (two versions of thin heaps and one of thick heaps ) that have the same amortized efficiency as Fibonacci heaps, but need less space and promise better practical performance. As part of our development, we fill in a gap in Høyer's analysis.

Funder

Israel Science Foundation

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1328911.1328914

Reference35 articles.

1. An algorithm for organization of information;Adel'son-Vel'skii G. M.;Dokl. Akad. Nauk SSSR,1962

2. Aho A. V. Hopcroft J. E. and Ullman J. D. 1982. Data Structures and Algorithms. Addison-Wesley. Aho A. V. Hopcroft J. E. and Ullman J. D. 1982. Data Structures and Algorithms. Addison-Wesley.

3. Cache-oblivious priority queue and graph algorithm applications

4. Symmetric binary B-Trees: Data structure and maintenance algorithms

5. What is a “pointer machine”?

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Smooth Heaps and a Dual View of Self-Adjusting Data Structures;SIAM Journal on Computing;2019-11-05

2. Smooth heaps and a dual view of self-adjusting data structures;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20

3. Hollow Heaps;ACM Transactions on Algorithms;2017-07-31

4. Replacing Mark Bits with Randomness in Fibonacci Heaps;Automata, Languages, and Programming;2015

5. Hollow Heaps;Automata, Languages, and Programming;2015