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 条
  • [31] Smoothed analysis of binary search trees
    Manthey, Bodo
    Reischuk, Ruediger
    THEORETICAL COMPUTER SCIENCE, 2007, 378 (03) : 292 - 315
  • [32] Smoothed analysis of binary search trees
    Manthey, B
    Reischuk, R
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 483 - 492
  • [33] Restructuring binary search trees revisited
    Gagie, T
    INFORMATION PROCESSING LETTERS, 2005, 95 (03) : 418 - 421
  • [34] PATH LENGTH OF BINARY SEARCH TREES
    HU, TC
    TAN, KC
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1972, 22 (02) : 225 - +
  • [35] On the concentration of the height of binary search trees
    Robson, JM
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 441 - 448
  • [36] Efficient reorganization of binary search trees
    Hofri, M
    Shachnai, H
    ALGORITHMICA, 2001, 31 (03) : 378 - 402
  • [37] Optimal alphabetic trees for binary search
    Hu, TC
    Tucker, PA
    INFORMATION PROCESSING LETTERS, 1998, 67 (03) : 137 - 140
  • [38] Martingales and profile of binary search trees
    Chauvin, B
    Klein, T
    Marckert, JF
    Rouault, A
    ELECTRONIC JOURNAL OF PROBABILITY, 2005, 10 : 420 - 435
  • [39] PARALLEL BALANCING OF BINARY SEARCH TREES
    CHANG, S
    IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (04) : 441 - 444
  • [40] Binary search trees of permuton samples
    Corsini, Benoit
    Dubach, Victor
    Feray, Valentin
    ADVANCES IN APPLIED MATHEMATICS, 2025, 162
12345