Weighted Binary Trees for Concurrent Searching

被引：0
|
作者：
Cohen, David [1 ]
Fredman, Michael L. [1 ]
机构：
[1] Rutgers University, New Brunswick, NJ, United States
来源：
Journal of Algorithms | 1996年 / 20卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：87 / 112
相关论文
共 50 条
  • [1] Weighted binary trees for concurrent searching
    Cohen, D
    Fredman, ML
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 20 (01): : 87 - 112
  • [2] Connected searching of weighted trees
    Dereniowski, Dariusz
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (41) : 5700 - 5713
  • [3] Connected Searching of Weighted Trees
    Dereniowski, Dariusz
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 330 - 341
  • [4] On optimal weighted binary trees
    Pradhan, J
    Sastry, CV
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1995, 7 (03): : 445 - 464
  • [5] Weighted minimal binary trees
    Ivanov, AO
    Tuzhilin, AA
    RUSSIAN MATHEMATICAL SURVEYS, 1995, 50 (03) : 623 - 624
  • [6] An Approximation Algorithm for Binary Searching in Trees
    Laber, Eduardo
    Molinaro, Marco
    ALGORITHMICA, 2011, 59 (04) : 601 - 620
  • [7] An approximation algorithm for binary searching in trees
    Laber, Eduardo
    Molinaro, Marco
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 459 - 471
  • [8] Searching for faulty leaves in binary trees
    Damaschke, P
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 265 - 274
  • [9] An Approximation Algorithm for Binary Searching in Trees
    Eduardo Laber
    Marco Molinaro
    Algorithmica, 2011, 59 : 601 - 620
  • [10] The binary identification problem for weighted trees
    Cicalese, Ferdinando
    Jacobs, Tobias
    Laber, Eduardo
    Valentim, Caio
    THEORETICAL COMPUTER SCIENCE, 2012, 459 : 100 - 112
12345