DYNAMIC WEIGHTED BINARY SEARCH TREES

被引：5
|
作者：
UNTERAUER, K
机构：
来源：
ACTA INFORMATICA | 1979年 / 11卷 / 04期
关键词：
D O I：
10.1007/BF00289093
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：341 / 362
页数：22
相关论文
共 50 条
  • [41] Efficient Reorganization of Binary Search Trees
    M. Hofri
    H. Shachnai
    Algorithmica, 2001, 31 : 378 - 402
  • [42] The Variance of the height of binary search trees
    Drmota, M
    THEORETICAL COMPUTER SCIENCE, 2002, 270 (1-2) : 913 - 919
  • [43] On the node structure of binary search trees
    Dekking, FM
    De Graaf, S
    Meester, LE
    MATHEMATICS AND COMPUTER SCIENCE: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2000, : 31 - 40
  • [44] Binary search trees for generalized measurements
    Andersson, Erika
    Oi, Daniel K. L.
    PHYSICAL REVIEW A, 2008, 77 (05):
  • [45] DYNAMIC BINARY SEARCH
    MEHLHORN, K
    SIAM JOURNAL ON COMPUTING, 1979, 8 (02) : 175 - 198
  • [46] Distances and finger search in random binary search trees
    Devroye, L
    Neininger, R
    SIAM JOURNAL ON COMPUTING, 2004, 33 (03) : 647 - 658
  • [47] NUMERICAL INVESTIGATIONS OF BINARY SEARCH TREES
    ALBRECHT, W
    ANGEWANDTE INFORMATIK, 1973, (08): : 333 - 344
  • [48] OPTIMAL BINARY SEARCH-TREES
    DOBOSIEWICZ, W
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (02) : 135 - 151
  • [49] Simple Balanced Binary Search Trees
    Ragde, Prabhakar
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (170): : 78 - 87
  • [50] Random Binary Search Trees for Approximate Nearest Neighbour Search in Binary Space
    Komorowski, Michal
    Trzcinski, Tomasz
    PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PREMI 2017, 2017, 10597 : 473 - 479
12345