On a sublinear time parallel construction of optimal binary search trees

被引：0
|
作者：
Karpinski, Marek [1 ]
Rytter, Wojciech [1 ]
机构：
[1] Univ of Bonn, Bonn, Germany
来源：
Parallel Processing Letters | 1998年 / 8卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：387 / 397
相关论文
共 50 条
  • [41] Randomized binary search trees
    Martinez, C
    Roura, S
    JOURNAL OF THE ACM, 1998, 45 (02) : 288 - 323
  • [42] Reductions in binary search trees
    Sánchez-Couso, JR
    Fernández-Camacho, MI
    THEORETICAL COMPUTER SCIENCE, 2006, 355 (03) : 327 - 353
  • [43] The algebra of binary search trees
    Hivert, F
    Novelli, JC
    Thibon, JY
    THEORETICAL COMPUTER SCIENCE, 2005, 339 (01) : 129 - 165
  • [44] The Geometry of Binary Search Trees
    Demaine, Erik D.
    Harmon, Dion
    Iacono, John
    Kane, Daniel
    Patrascu, Mihai
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 496 - +
  • [45] ON THE SILHOUETTE OF BINARY SEARCH TREES
    Gruebel, Rudolf
    ANNALS OF APPLIED PROBABILITY, 2009, 19 (05): : 1781 - 1802
  • [46] ON BINARY SEARCH-TREES
    DEPRISCO, R
    DESANTIS, A
    INFORMATION PROCESSING LETTERS, 1993, 45 (05) : 249 - 253
  • [47] The profile of binary search trees
    Chauvin, B
    Drmota, M
    Jabbour-Hattab, J
    ANNALS OF APPLIED PROBABILITY, 2001, 11 (04): : 1042 - 1062
  • [48] Combining Binary Search Trees
    Demaine, Erik D.
    Iacono, John
    Langerman, Stefan
    Oezkan, Oezguer
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 388 - 399
  • [49] Designing Optimal Binary Search Tree Using Parallel Genetic Algorithms
    Zamanifar, K.
    Koorangi, M.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (01): : 138 - 146
  • [50] Optimal parallel verification of minimum spanning trees in logarithmic time
    B. Dixon
    R. E. Tarjan
    Algorithmica, 1997, 17 : 11 - 18
12345