Author:
Carlsson Svante,Sundström Mikael
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. S. W. Bent, J. W. John, Finding the median requires 2n comparisons, In Proceedings of the 17th Annual Symposium on Theory of Computing, pp. 213–216, 1985.
2. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection, Journal of Computer and System Sciences, 7:448–461, 1973.
3. S. Carlsson and M. Sundström, Linear-time In-place Selection in Less than 3n Comparisons, extended version available at 〈URL:http://www. sm. luth. se/∼msm/reports/in-place.ps〉
4. S. Carlsson, The Deap — A double-ended heap to implement double-ended priority queues, Information processing Letters 26 (1):33–36, 1987.
5. D. Dor and U. Zwick, Selecting the median, In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (SODA'95), San Francisco, California, January 1995.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献