Non-blocking k-ary search trees

被引:0
|
作者
Theory Group, Dept. of Computer Science, University of Toronto, Canada [1 ]
不详 [2 ]
机构
来源
关键词
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 条
  • [21] The rotation graph of k-ary trees is Hamiltonian
    Huemer, Clemens
    Hurtado, Ferran
    Pfeifle, Julian
    INFORMATION PROCESSING LETTERS, 2008, 109 (02) : 124 - 129
  • [22] Generating regular k-ary trees efficiently
    Xiang, LM
    Ushijima, K
    Akl, SG
    COMPUTER JOURNAL, 2000, 43 (04): : 290 - 300
  • [23] Loop free generation of k-ary trees
    Roelants Van Baronaigien, Dominique
    American Journal of Mathematical and Management Sciences, 2000, 20 (1-2) : 183 - 200
  • [24] THE REPRESENTATION AND ENUMERATION OF ORDERED K-ARY TREES
    MARTIN, HW
    KILTINEN, JO
    MCNEILL, RB
    COMPUTING AND INFORMATION, 1989, : 105 - 109
  • [25] BRANCHES IN RANDOM RECURSIVE k-ARY TREES
    Javanian, M.
    Vahidi-Asl, M. Q.
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2012, 38 (02) : 323 - 331
  • [26] On generating k-ary trees in computer representation
    Xiang, LM
    Ushijima, K
    Tang, CJ
    INFORMATION PROCESSING LETTERS, 2001, 77 (5-6) : 231 - 238
  • [27] Antimagic orientations for the complete k-ary trees
    Chen Song
    Rong-Xia Hao
    Journal of Combinatorial Optimization, 2019, 38 : 1077 - 1085
  • [28] Scaling limits of k-ary growing trees
    Haas, Benedicte
    Stephenson, Robin
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2015, 51 (04): : 1314 - 1341
  • [29] Complete k-ary trees and Hamming graphs
    Choudum, S. A.
    Lavanya, S.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 45 : 15 - 24
  • [30] Note on the Exponential Recursive k-Ary Trees
    Ghasemi, Mina
    Javanian, Mehri
    Nabiyyi, Ramin Imany
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2023, 57 : 16 - 32