Non-blocking k-ary search trees

被引：0
|
作者：
Theory Group, Dept. of Computer Science, University of Toronto, Canada [1 ]
不详 [2 ]
机构：
来源：
Lect. Notes Comput. Sci. | / 207-221期
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
15th International Conference on Principles of Distributed Systems, OPODIS 2011
中图分类号：
学科分类号：
摘要：
Distributed computer systems - Binary trees - Java programming language
引用
收藏
相关论文
共 50 条
  • [31] k-Ary spanning trees contained in tournaments
    Ai, Jiangdong
    Lei, Hui
    Shi, Yongtang
    Yao, Shunyu
    Zhang, Zan-Bo
    DISCRETE APPLIED MATHEMATICS, 2020, 285 : 141 - 146
  • [32] GENERATING k-ARY TREES IN LEXICOGRAPHIC ORDER
    朱永津
    王建方
    ScienceinChina,SerA., 1980, Ser.A.1980 (10) : 1219 - 1225
  • [33] Restricted rotation distance between k-ary trees
    Cleary S.
    Journal of Graph Algorithms and Applications, 2023, 27 (01) : 19 - 33
  • [34] EFFICIENT GENERATION OF K-ARY TREES IN NATURAL ORDER
    ER, MC
    COMPUTER JOURNAL, 1992, 35 (03): : 306 - 308
  • [35] Optimal parallel algorithm for generating k-ary trees
    Vajnovszki, V
    Phillips, C
    COMPUTERS AND THEIR APPLICATIONS: PROCEEDINGS OF THE ISCA 12TH INTERNATIONAL CONFERENCE, 1997, : 201 - 204
  • [36] Loopless generation of Gray codes for k-ary trees
    Korsh, JE
    LaFollette, P
    INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 7 - 11
  • [37] Depth of nodes in random recursive k-ary trees
    Javanian, M
    Vahidi-Asl, MQ
    INFORMATION PROCESSING LETTERS, 2006, 98 (03) : 115 - 118
  • [38] An improved succinct representation for dynamic k-ary trees
    Arroyuelo, Diego
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 277 - 289
  • [39] Line-broadcasting in complete k-ary trees
    Shabtai, Revital Hollander
    Roditty, Yehuda
    NETWORKS, 2016, 67 (02) : 139 - 147
  • [40] A general technique for non-blocking trees
    Brown, Trevor
    Ellen, Faith
    Ruppert, Eric
    arXiv, 2017,
12345