Tree Splitting
Tree Splitting is a parallel algorithmic technique in computational tree processing that partitions a tree structure into disjoint subtrees to enable concurrent computation across distributed or multi-threaded systems.
129
Publications
5.9K
Citations
310
Authors
180
Institutions
Publications per year
2017–2026
19
Parents
129
Real-time KD-tree construction on graphics hardware
Kun Zhou, Qiming Hou, Rui Wang et al. · ACM Transactions on Graphics · 2008 · 490 citations
Recursive Partitioning and Regression Trees
Terry M. Therneau, Beth Atkinson, B. D. Ripley · 2015 · 474 citations
Zooko Wilcox-O’Hearn, Brian Warner · 2008 · 169 citations
1–5 of 129
310
4
h-index
3
h-index
2
h-index
IBM Research - Thomas J. Watson Research Center, United States
2 publications · 42 citations
2
h-index
2
h-index
1–5 of 310
180

Centre National de la Recherche Scientifique
Paris, France
4 h-index
7 publications
201 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
9 publications
186 citations
Max Planck Society
Munich, Germany
3 h-index
3 publications
98 citations
Laboratoire de Probabilités et Modèles Aléatoires
Paris, France
3 h-index
3 publications
123 citations

Zhejiang University
Hangzhou, China
3 h-index
5 publications
1.2K citations
University of Chicago
Chicago, United States
3 h-index
8 publications
167 citations
IBM (United States)
Armonk, United States
3 h-index
2 publications
44 citations
University of Maryland, College Park
College Park, United States
3 h-index
3 publications
566 citations
1–8 of 180
3 publications · 73 citations
3
h-index
3 publications · 55 citations
3
h-index
3 publications · 73 citations
3
h-index
2 publications · 101 citations
2
h-index
TPAMI · 2 publications · 128 citations
2
h-index
1–5