Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary
暂无分享,去创建一个
[1] Giorgio Gambosi,et al. A partially persistent data structure for the set-union problem , 1990, RAIRO Theor. Informatics Appl..
[2] Robert E. Tarjan,et al. Reference machines require non-linear time to maintain disjoint sets , 1977, STOC '77.
[3] Leonidas J. Guibas,et al. A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[4] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[5] Robert E. Tarjan,et al. A Fast Merging Algorithm , 1979, JACM.
[6] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[7] Irene Gargantini,et al. An effective way to represent quadtrees , 1982, CACM.