Parallel Tree Balancing
Parallel Tree Balancing is a computational framework within parallel algorithms that specifically addresses the dynamic redistribution of tree nodes across processing units to maintain structural balance and optimize workload distribution during concurrent tree operations.
6
Publications
98
Citations
15
Authors
11
Institutions
Publications per year
2017–2026
0
Parents
6
A no-busy-wait balanced tree parallel algorithmic paradigm
Uzi Vishkin · 2000 · 10 citations · Full text
1–5 of 6
15
Institut de Recherche en Informatique et Systèmes Aléatoires, France
1 publications · 10 citations
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
11
The University of Texas at Dallas
Richardson, United States
1 h-index
2 publications
20 citations

Cornell University
Ithaca, United States
1 h-index
1 publications
14 citations
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
1 h-index
1 publications
10 citations
Louisiana State University
Baton Rouge, United States
1 h-index
1 publications
14 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
25 citations
University of Maryland, College Park
College Park, United States
1 h-index
1 publications
10 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
10 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
1 publications
25 citations
1–8 of 11
2 publications · 39 citations
2
h-index
1 publications · 10 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 29 citations
1
h-index
1–4