Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Aggarwal, A., J.S. Vitter, ‘The Input/Output Complexity of Sorting and Related Problems,’ Communications of the ACM, 31(9), pp. 1116–1127, 1988.
2. Blum, M., R.W. Floyd, V.R. Pratt, R.L. Rivest, R.E. Tarjan, ‘Time Bounds for Selection,’ Journal of Computing System Sciences, 7(4), pp. 448–461, 1972.
3. Lect Notes Comput Sci;S. Carlsson,1995
4. Lect Notes Comput Sci;S. Chaudhuri,1993
5. Dor, D., U. Zwick, ‘Selecting the Median,’ Proc. 6th Symposium on Discrete Algorithms, pp. 28–37, ACM-SIAM, 1995.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. External memory algorithms and data structures;ACM Computing Surveys;2001-06
2. Performance engineering case study;ACM Journal of Experimental Algorithmics;2000-12-31