Distributed Tree Algorithms

Distributed Tree Algorithms is a class of distributed algorithms that operate on network topologies structured as trees, leveraging the acyclic and hierarchical properties of trees to solve problems such as traversal, aggregation, or synchronization in a decentralized manner.

88

Publications

4.4K

Citations

217

Authors

120

Institutions

Publications per year

2017–2026

9

Authors

217

  1. AK
    Ajoy K. Datta

    University of Nevada, Las Vegas, United States

    3 publications · 55 citations

    3

    h-index

  2. RP
    Radia Perlman

    Digital Wave (United States), United States

    2 publications · 336 citations

    2

    h-index

  3. RP
    Robert Powers

    University of Nebraska–Lincoln, United States

    2 publications · 50 citations

    2

    h-index

  4. PH
    P.A. Humblet

    Massachusetts Institute of Technology, United States

    2 publications · 1.2K citations

    2

    h-index

  5. FM
    F.R. McMorris

    University of Louisville, United States

    2 publications · 50 citations

    2

    h-index

1–5 of 217

Venues

  1. SIAM Journal on Computing

    3 publications · 250 citations

    3

    h-index

  2. 2

    h-index

  3. IEEE Transactions on Software Engineering

    TSE · 2 publications · 239 citations

    2

    h-index

  4. Journal of Parallel and Distributed Computing

    2 publications · 22 citations

    2

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 148 citations

    2

    h-index

1–5