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
Parents
88
1–5 of 88
217
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 217
120
University of Nevada, Las Vegas
Las Vegas, United States
4 h-index
5 publications
100 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
4 h-index
4 publications
169 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
9 publications
148 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
5 publications
2.6K citations

Université de Picardie Jules Verne
Amiens, France
3 h-index
6 publications
90 citations
University of California, Riverside
Riverside, United States
3 h-index
4 publications
86 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
3 publications
320 citations
The Ohio State University
Columbus, United States
2 h-index
2 publications
36 citations
1–8 of 120
3 publications · 250 citations
3
h-index
2 publications · 1.2K citations
2
h-index
TSE · 2 publications · 239 citations
2
h-index
2 publications · 22 citations
2
h-index
TPDS · 2 publications · 148 citations
2
h-index
1–5