Author:
Babenko Maxim,Kolesnichenko Ignat,Smirnov Ivan
Publisher
Springer International Publishing
Reference8 articles.
1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
2. Williams, J.W.J.: Heapsort. Commun. ACM 7, 347–348 (1964)
3. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)
4. Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), pp. 52–58, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics (1996)
5. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science (SFCS 1975), pp. 75–84, Washington, DC, USA. IEEE Computer Society (1975)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Analysis of Comparison-Based Sorting Algorithms;2021 International Conference on Innovative Computing (ICIC);2021-11-09
2. Cascade Heap: Towards Time-Optimal Extractions;Theory of Computing Systems;2018-05-18