Publisher
Springer International Publishing
Reference13 articles.
1. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? J. Comput. Syst. Sci. 57, 74–93 (1998)
2. Andersson, A.: Faster deterministic sorting and searching in linear space. In: Proceedings of 1996 IEEE Symposium of Foundations of Computer Science FOCS 1996, pp. 135–141 (1996)
3. Lecture Notes in Computer Science;D Belazzougui,2014
4. Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1972)
5. Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25, 19–51 (1997)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献