Radix Sorting with No Extra Space
暂无分享,去创建一个
[1] Michael L. Fredman,et al. Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[2] Jyrki Katajainen,et al. Stable minimum space partitioning in linear time , 1992, BIT.
[3] Yijie Han,et al. Integer sorting in O(n/spl radic/(log log n)) expected time and linear space , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[4] Rajeev Raman,et al. Sorting in linear time? , 1995, STOC '95.
[5] J. IAN MUNRO,et al. An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time , 1986, J. Comput. Syst. Sci..
[6] Jeffrey S. Salowe,et al. Simplified Stable Merging Tasks , 1987, J. Algorithms.
[7] Michael L. Fredman,et al. Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..
[8] Jyrki Katajainen,et al. Sorting multisets stably in minimum space , 1992, Acta Informatica.