Performance analysis of BSTs in system software
暂无分享,去创建一个
[1] Samuel J. Leffler,et al. The design and implementation of the 4.3 BSD Unix operating system , 1991, Addison-Wesley series in computer science.
[2] Leonidas J. Guibas,et al. A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[3] William E. Wright. An empirical evaluation of algorithms for dynamically maintaining binary search trees , 1980, ACM '80.
[4] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .
[5] Keith Bostic,et al. The design and implementa-tion of the 4.4BSD operating system , 1996 .
[6] Samuel H. Fuller,et al. Performance of height-balanced trees , 1976, CACM.
[7] George Eckel. Inside Windows NT , 1993 .
[8] Donald E. Knuth,et al. fundamental algorithms , 1969 .
[9] Helen Custer,et al. Inside Windows NT , 1992 .
[10] Jean-Loup Baer,et al. A comparison of tree-balancing algorithms , 1977, CACM.
[11] James Michael Cannady. Balancing methods for binary search trees , 1978, ACM-SE 16.
[12] Timothy J. Purcell. Sorting and searching , 2005, SIGGRAPH Courses.
[13] Robert Sedgewick,et al. Algorithms in C , 1990 .
[14] Donald E. Knuth,et al. The Art of Computer Programming, Volumes 1-3 Boxed Set , 1998 .
[15] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[16] Robert E. Tarjan,et al. Sequential access in splay trees takes linear time , 1985, Comb..