Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference10 articles.
1. S. Carlsson,A variant of HEAPSORT with almost optimal number of comparisons, to appear in Information Processing Letters.
2. E. E. Doberkat,An average case analysis of Floyd's algorithm to construct heaps, Information and Control, 61: 114–131 (1984).
3. E. E. Doberkat,Deleting the root of a heap, Acta Informatica, 17: 245–265 (1982).
4. E. E. Doberkat,Inserting a new element into a heap, BIT 21 (1981), 255–269.
5. R. W. Floyd,Algorithm 245, Treesort; CACM, 7 (12): 701, (dec. 1964).
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Subspace Dimension Reduction for Faster Multiple Signal Classification in Blade Tip Timing;IEEE Transactions on Instrumentation and Measurement;2021
2. High-speed high-security signatures;Journal of Cryptographic Engineering;2012-08-14
3. Bibliography;Sorting;2011-10-26
4. High-Speed High-Security Signatures;Cryptographic Hardware and Embedded Systems – CHES 2011;2011
5. Worst-case analysis of generalized heapsort algorithm revisited;International Journal of Computer Mathematics;2006-01