TIME-OPTIMAL AND SPACE-OPTIMAL HEIGHT-BALANCED 2-3 BROTHER TREES

被引:0
|
作者
MURTHY, YD [1 ]
BHATTACHARJEE, GP [1 ]
SEETARAMANATH, MN [1 ]
机构
[1] INDIAN INST TECHNOL,CTR COMP,KHARAGPUR 721302,W BENGAL,INDIA
关键词
D O I
10.1080/00207168308803362
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:171 / 188
页数:18
相关论文
共 50 条
  • [1] TIME-OPTIMAL AND SPACE-OPTIMAL CONTOUR COMPUTATION FOR A SET OF RECTANGLES
    WIDMAYER, P
    WOOD, D
    [J]. INFORMATION PROCESSING LETTERS, 1987, 24 (05) : 335 - 338
  • [2] OPTIMAL METHOD FOR DELETION IN ONE-SIDED HEIGHT-BALANCED TREES
    ZWEBEN, SH
    MCDONALD, MA
    [J]. COMMUNICATIONS OF THE ACM, 1978, 21 (06) : 441 - 445
  • [3] HEIGHT BALANCED 2-3 TREES
    VAISHNAVI, VK
    KRIEGEL, HP
    WOOD, D
    [J]. COMPUTING, 1979, 21 (03) : 195 - 211
  • [4] A TIME-OPTIMAL AND SPACE-OPTIMAL ALGORITHM FOR BOOLEAN MASK OPERATIONS FOR ORTHOGONAL POLYGONS
    WIDMAYER, P
    WOOD, D
    [J]. COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 41 (01): : 14 - 27
  • [5] Space-Optimal Packet Routing on Trees
    Patt-Shamir, Boaz
    Rosenbaum, Will
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019), 2019, : 1036 - 1044
  • [6] OPTIMAL INSERTION ALGORITHM FOR ONE-SIDED HEIGHT-BALANCED BINARY SEARCH TREES
    RAIHA, KJ
    ZWEBEN, SH
    [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (09) : 508 - 512
  • [7] Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees
    Baba, Daisuke
    Izumi, Tomoko
    Ooshita, Fukuhito
    Kakugawa, Hirotsugu
    Masuzawa, Toshimitsu
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2010, 6058 : 86 - +
  • [8] Almost Optimal Dynamic 2-3 Trees
    李万学
    [J]. Journal of Computer Science & Technology, 1986, (02) : 60 - 71
  • [9] NEAR HEIGHT-OPTIMAL 2-3 TREE
    LI, WX
    [J]. KEXUE TONGBAO, 1986, 31 (05): : 292 - 297
  • [10] Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees
    Blin, Lelia
    Fraigniaud, Pierre
    [J]. 2015 IEEE 35th International Conference on Distributed Computing Systems, 2015, : 589 - 598