Parallel Tree Decomposition
Parallel Tree Decomposition is a computational framework that partitions a tree-structured problem into concurrently solvable subproblems to enable efficient parallel processing while preserving the hierarchical dependencies inherent in the original structure.
72
Publications
4.4K
Citations
170
Authors
93
Institutions
Publications per year
2017–2026
8
Parents
72
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 72
170
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 170
93
Carnegie Mellon University
Pittsburgh, United States
5 h-index
10 publications
409 citations
The University of Tokyo
Tokyo, Japan
4 h-index
9 publications
362 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
177 citations

University of Minnesota
Minneapolis, United States
2 h-index
4 publications
63 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
150 citations
University of Sfax
Sfax, Tunisia
2 h-index
2 publications
47 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
3 publications
44 citations
Stanford University
Stanford, United States
2 h-index
4 publications
72 citations
1–8 of 93
3 publications · 67 citations
3
h-index
2 publications · 51 citations
2
h-index
2 publications · 127 citations
2
h-index
TPAMI · 2 publications · 119 citations
2
h-index
2 publications · 84 citations
2
h-index
1–5