Author:
Hansen Thomas Dueholm,Kaplan Haim,Tarjan Robert E.,Zwick Uri
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 52–58 (1996)
2. Brodal, G.S., Lagogiannis, G., Tarjan, R.E.: Strict Fibonacci heaps. In: Proc. of the 44th ACM STOC, pp. 1177–1184 (2012)
3. Chan, T.M.: Quake heaps: a simple alternative to fibonacci heaps. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 27–32. Springer, Heidelberg (2013)
4. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
5. Driscoll, J.R., Gabow, H.N., Shrairman, R., Tarjan, R.E.: Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM 31(11), 1343–1354 (1988)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel approximate undirected shortest paths via low hop emulators;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
2. Smooth Heaps and a Dual View of Self-Adjusting Data Structures;SIAM Journal on Computing;2019-11-05
3. 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