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

Authors

15

  1. LA
    Laurent Amsaleg

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    1 publications · 10 citations

    1

    h-index

  2. TH
    Thompson

    University of California, Berkeley, United States

    1 publications · 25 citations

    1

    h-index

  3. HV
    Heribert Vollmer

    University of Würzburg, Germany

    1 publications · 29 citations

    1

    h-index

  4. AÓ
    Arnar Ólafsson

    Centre National de la Recherche Scientifique, France

    1 publications · 10 citations

    1

    h-index

  5. AM
    Abha Moitra

    GE Global Research (United States), United States

    1 publications · 14 citations

    1

    h-index

1–5 of 15

Venues

  1. IEEE Transactions on Computers

    2 publications · 39 citations

    2

    h-index

  2. Multimedia Systems

    1 publications · 10 citations

    1

    h-index

  3. International Journal of Parallel Programming

    1 publications · 10 citations

    1

    h-index

  4. Theory of Computing Systems

    1 publications · 29 citations

    1

    h-index

1–4