Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. M. D. Atkinson, J.-R. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Communications of the ACM, 29(10):996–1000, 1986.
2. Svante Carlsson, Patricio V. Poblete, and J. Ian Munro. An implicit binomial queue with constant insertion time. In Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT), volume 318 of Lecture Notes in Computer Science, pages 1–13. Springer Verlag, Berlin, 1988.
3. volume 468 of Lecture Notes in Computer Science;P. F. Dietz,1990
4. Yuzheng Ding and Mark Allen Weiss. The relaxed min-max heap. ACTA Informatica, 30:215–231, 1993.
5. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343–1354, 1988.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Advanced Priority Queues in the OPTICS Clustering Algorithm;2023 International Conference on Information and Digital Technologies (IDT);2023-06-22
2. Regular numeral systems for data structures;Acta Informatica;2021-07-25
3. Bipartite binomial heaps;RAIRO - Theoretical Informatics and Applications;2017-07
4. Soft Heaps Simplified;SIAM Journal on Computing;2013-01
5. A Survey on Priority Queues;Lecture Notes in Computer Science;2013