STL's red-black trees

被引：0
|
作者：
Shankel, J
机构：
来源：
DR DOBBS JOURNAL | 1998年 / 23卷 / 04期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：54 / +
页数：4
相关论文
共 50 条
  • [1] RED-BLACK TREES
    SCHNEIER, B
    [J]. DR DOBBS JOURNAL, 1992, 17 (04): : 42 - &
  • [2] Relativistic red-black trees
    Howard, Philip W.
    Walpole, Jonathan
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2014, 26 (16): : 2684 - 2712
  • [3] Red-black trees with types
    Kahrs, S
    [J]. JOURNAL OF FUNCTIONAL PROGRAMMING, 2001, 11 : 425 - 432
  • [4] Relaxed balanced red-black trees
    Hanke, S
    Ottmann, T
    Soisalon-Soininen, E
    [J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 193 - 204
  • [5] Group updates for red-black trees
    Hanke, S
    Soisalon-Soininen, E
    [J]. ALGORITHMS AND COMPLEXITY, 2000, 1767 : 253 - 262
  • [6] Parallel algorithms for red-black trees
    Park, H
    Park, K
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 415 - 435
  • [7] Relaxed red-black trees with group updates
    Larsen, KS
    [J]. ACTA INFORMATICA, 2002, 38 (08) : 565 - 586
  • [8] HOW COSTLY CAN RED-BLACK TREES BE
    CAMERON, H
    WOOD, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 497 : 117 - 126
  • [9] Red-black trees with relative node keys
    Holenderski, Mike
    Bril, Reinder J.
    Lukkien, Johan J.
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (11) : 591 - 596
  • [10] Red-black trees with constant update time
    Elmasry, Amr
    Kahla, Mostafa
    Ahdy, Fady
    Hashem, Mahmoud
    [J]. ACTA INFORMATICA, 2019, 56 (05) : 391 - 404
12345