Research on the red-black trees based on the large-scale algorithms

被引：0
|
作者：
Shuang, Wang [1 ]
机构：
[1] Network Management Center of Xi'an Physical Education University, China
来源：
Advances in Information Sciences and Service Sciences | 2012年 / 4卷 / 02期
关键词：
D O I：
10.4156/AISS.vol4.issue2.22
中图分类号：
学科分类号：
摘要：
27
引用
收藏
页码：175 / 181
相关论文
共 50 条
  • [1] Parallel algorithms for red-black trees
    Park, H
    Park, K
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 415 - 435
  • [2] RED-BLACK TREES
    SCHNEIER, B
    [J]. DR DOBBS JOURNAL, 1992, 17 (04): : 42 - &
  • [3] Relativistic red-black trees
    Howard, Philip W.
    Walpole, Jonathan
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2014, 26 (16): : 2684 - 2712
  • [4] Red-black trees with types
    Kahrs, S
    [J]. JOURNAL OF FUNCTIONAL PROGRAMMING, 2001, 11 : 425 - 432
  • [5] Relaxed balanced red-black trees
    Hanke, S
    Ottmann, T
    Soisalon-Soininen, E
    [J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 193 - 204
  • [6] Group updates for red-black trees
    Hanke, S
    Soisalon-Soininen, E
    [J]. ALGORITHMS AND COMPLEXITY, 2000, 1767 : 253 - 262
  • [7] STL's red-black trees
    Shankel, J
    [J]. DR DOBBS JOURNAL, 1998, 23 (04): : 54 - +
  • [8] Permission-Based Verification of Red-Black Trees and Their Merging
    Armborst, Lukas
    Huisman, Marieke
    [J]. 2021 IEEE/ACM 9TH INTERNATIONAL CONFERENCE ON FORMAL METHODS IN SOFTWARE ENGINEERING (FORMALISE 2021), 2021, : 111 - 123
  • [9] Relaxed red-black trees with group updates
    Larsen, KS
    [J]. ACTA INFORMATICA, 2002, 38 (08) : 565 - 586
  • [10] HOW COSTLY CAN RED-BLACK TREES BE
    CAMERON, H
    WOOD, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 497 : 117 - 126
12345