Fixed-bucket binary storage trees

Journal of Algorithms - Tập 3 - Trang 276-287 - 1982
Gary D Knott1
1Division of Computer Research and Technology, National Institutes of Health, Bethesda, Maryland 20014 USA

Tài liệu tham khảo

Berners-Lee, 1960, Comput. J., 3, 174, 10.1093/comjnl/3.3.174 Berners-Lee, 1960, Comput. J., 3, 184 Booth, 1960, On the efficiency of a new method of dictionary construction, Inform. Contr., 3, 327, 10.1016/S0019-9958(60)90901-3 Douglas, 1959, Techniques for the recording of and reference to data in a computer, Comput. J., 2, 1, 10.1093/comjnl/2.1.1 Hibbard, 1962, Some combinatorial properties of certain trees, Commun. ACM, 9, 13 Windley, 1960, Trees, forests and rearranging, Comput. J., 3, 84, 10.1093/comjnl/3.2.84 Arora, 1969, Randomized binary search technique, Commun. ACM, 12, 77, 10.1145/362848.362856 Burge, 1958, Sorting, trees, and measures of order, Inform. Contr., 1, 181, 10.1016/S0019-9958(58)80001-7 Clampett, 1964, Randomized binary searching with tree structures, Commun. ACM, 7, 163, 10.1145/363958.363987 Knott, 1975, Deletion in Binary Storage Trees Knuth, 1973 Lynch, 1965, More combinatorial properties of certain trees, Comput. J., 7, 299, 10.1093/comjnl/7.4.299 Guibas, 1975, A principle of independence for binary tree searching, Acta Inform., 4, 293, 10.1007/BF00289612 Coffman, 1970, File structures using hashing functions, Commun. ACM, 13, 427, 10.1145/362686.362693 Rivest, 1976, Partial-match retrieval algorithms, SIAM J. Comput., 5, 19, 10.1137/0205003 Burkhard, 1976, Associative retrieval trie hash coding, 211 Burkhard, 1977, J. Comput. Syst. Sci., 15, 280, 10.1016/S0022-0000(77)80031-7 Bentley, 1975, A Survey of Techniques for Fixed Radius Near Neighbor Searching Friedman, 1977, An algorithm for finding best matches in logarithmic time, Trans. Math. Softw., 3, 209, 10.1145/355744.355745 Friedman, 1975 Bentley, 1975, Multidimensional binary search trees used for associative searching, Commun. ACM, 18, 509, 10.1145/361002.361007 Knuth, 1977, Deletions that preserve randomness, IEEE Trans. Softw. Eng., 351, 10.1109/TSE.1977.231160 Knuth, 1977 Jonassen, 1975, Analysis of an algorithm for priority queue administration, BIT, 15, 409, 10.1007/BF01931680 Knuth, 1969 Konheim, 1973, A note on growing binary trees, Discrete Math., 4, 57, 10.1016/0012-365X(73)90114-3