Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. R. K. Ahuja, K. Mehlhorn, J. B. Orlin and R. E. Tarjan. Faster algorithms for the shortest path problem. J. ACM, 37 (1990), pp. 213–223.
2. M. Ajtai, M. Fredman and J. Komlós. Hash functions for priority queues. Inform. and Control, 63 (1984), pp. 217–225.
3. A. Andersson. Sublogarithmic searching without multiplications. In Proc. 36th IEEE FOCS, 1995.
4. A. Andersson. Faster sorting and searching in linear space. To be presented at 37th IEEE FOCS, 1996.
5. A. Andersson, T. Hagerup, S. Nilsson and R. Raman. Sorting in linear time? In Proc. 27th ACM STOC, pp. 427–436, 1995.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献