Parallel Tree Search
Parallel Tree Search is a parallel algorithmic method that systematically explores the nodes of a tree structure concurrently across multiple processing units to accelerate the search process while maintaining correctness and consistency.
77
Publications
4.1K
Citations
164
Authors
84
Institutions
Publications per year
2017–2026
14
77
Gasoline: a flexible, parallel implementation of TreeSPH
James Wadsley, Joachim Stadel, Thomas Quinn · New Astronomy · 2003 · 698 citations · Full text
John Dubinski · New Astronomy · 1996 · 155 citations · Full text
1–5 of 77
164
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 164
84

University of Minnesota
Minneapolis, United States
6 h-index
9 publications
263 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
104 citations

University of Alberta
Edmonton, Canada
3 h-index
6 publications
238 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
4 publications
103 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
1.2K citations

University of Surrey
Guildford, United Kingdom
3 h-index
12 publications
346 citations

Chinese Academy of Sciences
Beijing, China
2 h-index
5 publications
660 citations
University of Washington
Seattle, United States
2 h-index
2 publications
769 citations
1–8 of 84
TPAMI · 5 publications · 262 citations
5
h-index
4 publications · 61 citations
4
h-index
4 publications · 73 citations
4
h-index
3 publications · 79 citations
3
h-index
TPDS · 3 publications · 102 citations
3
h-index
1–5