Parallel Search Trees
Parallel Search Trees is a computational framework that extends traditional search tree structures by enabling concurrent exploration of multiple branches across parallel processing units to accelerate search operations in large-scale data environments.
35
Publications
985
Citations
107
Authors
56
Institutions
Publications per year
2017–2026
5
Parents
35
A non-blocking internal binary search tree
Shane Valentine Howley, Jeremy Jones · 2012 · 95 citations
Dynamic Load Balancing of Unbalanced Computations Using Message Passing
James Dinan, Stephen L. Olivier, Gerald Sabin et al. · 2007 · 67 citations
The parallel complexity of simple chain queries
Foto Afrati, Costas Papadimitriou · 1987 · 61 citations · Full text
1–5 of 35
107
2
h-index
2
h-index
University at Buffalo, State University of New York, United States
2 publications · 25 citations
2
h-index
2
h-index
1
h-index
1–5 of 107
56
University at Buffalo, State University of New York
Buffalo, United States
3 h-index
7 publications
95 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
97 citations
University of Maryland, College Park
College Park, United States
2 h-index
2 publications
82 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
6 publications
69 citations

Carleton University
Ottawa, Canada
2 h-index
7 publications
83 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
2 publications
44 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
35 citations
University of California, Irvine
Irvine, United States
1 h-index
1 publications
26 citations
1–8 of 56
TPDS · 2 publications · 37 citations
2
h-index
PASA · 1 publications · 39 citations
1
h-index
1 publications · 19 citations
1
h-index
TKDD · 1 publications · 11 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5