Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Driscoll, J., Gabow, H., Shrairman, R., Tarjan, R.: Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Commun. ACM 31, 1343–1354 (1988)
2. Elmasry, A.: The violation heap: a relaxed Fibonacci-like heap. Discrete Math., Alg. and Appl. 2, 493–504 (2010)
3. Elmasry, A.: Pairing heaps with O(loglogn) decrease cost. In: Proc. 20th ACM–SIAM Sympos. Discrete Algorithms, pp. 471–476 (2009)
4. Fredman, M., Sedgewick, R., Sleator, D., Tarjan, R.: The pairing heap: a new form of self-adjusting heap. Algorithmica 1, 111–129 (1986)
5. Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Selectable Sloppy Heap;Algorithms;2019-03-06
2. Hollow Heaps;ACM Transactions on Algorithms;2017-07-31
3. Replacing Mark Bits with Randomness in Fibonacci Heaps;Automata, Languages, and Programming;2015
4. Hollow Heaps;Automata, Languages, and Programming;2015