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 条

[31] Compressed Binary Bit Trees: A New Data Structure For Accelerating Database Searching
Smellie, Andrew
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2009, 49 (02) : 257 - 262
[32] NEAREST NEIGHBOR SEARCHING IN BINARY SEARCH-TREES - SIMULATION OF A MULTIPROCESSOR SYSTEM
STEWART, M
WILLETT, P
JOURNAL OF DOCUMENTATION, 1987, 43 (02) : 93 - 111
[33] Parallel construction of binary trees with near optimal weighted path length
Kirkpatrick, DG
Przytycka, T
ALGORITHMICA, 1996, 15 (02) : 172 - 192
[34] Improving Efficacy of Concurrent Internal Binary Search Trees using Local Recovery
Ramachandran, Arunmoezhi
Mittal, Neeraj
ICDCN '19: PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, 2019, : 61 - 70
[35] Searching decision trees
Stephens, R
DR DOBBS JOURNAL, 1997, 22 (12): : 127 - &
[36] Extension of bivariate means to weighted means of several arguments by using binary trees
Beliakov, Gleb
Dujmovic, Jozo
INFORMATION SCIENCES, 2016, 331 : 137 - 147
[37] Searching Trees: An Essay
Fernau, Henning
Raible, Daniel
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 59 - 70
[38] CONCURRENT ALGORITHMS FOR ROOT SEARCHING
ERIKSEN, O
STAUNSTRUP, J
ACTA INFORMATICA, 1983, 18 (04) : 361 - 376
[39] Concurrent weighted logic
Larsen, Kim G.
Mardare, Radu
Xue, Bingtian
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2015, 84 (06) : 884 - 897
[40] On the cost of searching signature trees
Chen, YJ
INFORMATION PROCESSING LETTERS, 2006, 99 (01) : 19 - 26

← 1 2 3 4 5 →