Parallel Tree Traversal
Parallel Tree Traversal is a computational method that belongs to the class of tree traversal techniques, distinguished by its simultaneous exploration of multiple branches of a tree structure using concurrent processing units to achieve accelerated computation.
130
Publications
6.6K
Citations
320
Authors
154
Institutions
Publications per year
2017–2026
12
Parents
130
SPRINT: A Scalable Parallel Classifier for Data Mining
John Shafer, Rakesh Agrawal, Manish Mehta · 1996 · 782 citations
Gasoline: a flexible, parallel implementation of TreeSPH
James Wadsley, Joachim Stadel, Thomas Quinn · New Astronomy · 2003 · 698 citations · Full text
A simple parallel tree contraction algorithm
Karl Abrahamson, Norm Dadoun, David Kirkpatrick et al. · Journal of Algorithms · 1989 · 246 citations
1–5 of 130
320
4
h-index
National Center for Biotechnology Information, United States
4 publications · 290 citations
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 320
154

University of Minnesota
Minneapolis, United States
4 h-index
5 publications
166 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
7 publications
716 citations
Courant Institute of Mathematical Sciences
New York, United States
4 h-index
4 publications
415 citations
Queen's University
Kingston, Canada
4 h-index
6 publications
251 citations
Purdue University West Lafayette
West Lafayette, United States
4 h-index
7 publications
548 citations
New York University
New York, United States
3 h-index
3 publications
341 citations
University of California, Berkeley
Berkeley, United States
3 h-index
10 publications
206 citations
The University of Tokyo
Tokyo, Japan
3 h-index
5 publications
130 citations
1–8 of 154
8 publications · 175 citations
8
h-index
7 publications · 416 citations
7
h-index
4 publications · 307 citations
4
h-index
4 publications · 135 citations
4
h-index
Conference · 4 publications · 50 citations
4
h-index
1–5