Author:
Bhattacharya Binay,Shi Qiaosheng
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lecture Notes in Computer Science;B. Ben-Moshe,2006
2. Blum, M., Floyd, R.W., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Sys. Sci. 7, 448–461 (1972)
3. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200–208 (1987)
4. Lecture Notes in Computer Science;G.N. Frederickson,1991
5. Halman, N.: Discrete and lexicographic Helly theorems and their relations to LP-type problems. Ph.D. Thesis, Tel. Aviv. Univ. (2004)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献