Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Aho, Hopcroft, and Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. Ajtai, M., K'omlos, J., Steiger, W.L., and Szemeredi, E., ‘Deterministic Selection in O(log log n) Parallel Time,’ Proc. ACM Symposium on the Theory of Computing, 1986, pp. 188–195.
3. Cole, R., ‘An Optimally Efficient Selection Algorithm,’ Information Processing Letters 26, Jan. 1988, pp. 295–299.
4. Cole, R., and Yap, C., ‘A Parallel Median Algorithm,’ Information Processing Letters 20(3), 1985, pp. 137–139.
5. Floyd, R.W., and Rivest, R.L., ‘Expected Time Bounds for Selection,’ Communications of the ACM, vol. 18, no.3, 1975, pp. 165–172.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献