Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. V. Aho, J. E. Hopocroft, and J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.
2. M. D. Atkinson, J.-R. Sack, N. Santoro, and Th. Strothotte: Min-max heaps and generalized priority queues. CACM 29 (10) (1986), 996–1000.
3. S. Carlsson: A variant of heapsort with almost optimal number of comparisons. Information Processing Letters 24 (4) (1987), 247–250.
4. S. Carlsson: Average-case results on heapsort. BIT 27 (1) (1987), 2–17.
5. S. Carlsson: The deap — A double-ended heap to implement double-ended priority queues. Information Processing Letters 26 (1) (1987), 33–36.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献