Self-Stabilizing Distributed Algorithms is a class of distributed algorithms that, regardless of the initial system state, converge to a correct and consistent global state in finite time without external intervention, thereby ensuring fault tolerance in unreliable distributed environments.
110
Publications
3.3K
Citations
180
Authors
108
Institutions
Publications per year
2017–2026
7
Parents
Publications
110
Self-stabilizing population protocols
Dana Angluin, James Aspnes, Michael J. Fischer et al. · ACM Transactions on Autonomous and Adaptive Systems · 2008 · 105 citations
On the feasibility of distributed constraint satisfaction
Zeev Collin, Rina Dechter, Shmuel Katz · 1991 · 76 citations
1–5 of 110
Authors
180
- PK
11
h-index
- ST
8
h-index
- SD
8
h-index
- AK
7
h-index
- HK
6
h-index
1–5 of 180
Institutions
108
University of Nevada, Las Vegas
Las Vegas, United States
10 h-index
17 publications
338 citations
Clemson University
Clemson, United States
9 h-index
29 publications
858 citations
Centre National de la Recherche Scientifique
Paris, France
8 h-index
20 publications
564 citations
Laboratoire de Recherche en Informatique
Gif-sur-Yvette, France
7 h-index
17 publications
398 citations
Université Paris-Sud
Orsay, France
6 h-index
16 publications
384 citations
Paderborn University
Paderborn, Germany
6 h-index
9 publications
233 citations
Colorado State University
Fort Collins, United States
6 h-index
12 publications
206 citations
Ben-Gurion University of the Negev
Beersheba, Israel
6 h-index
9 publications
283 citations
1–8 of 108
Venues
- Parallel Processing Letters
7 publications · 175 citations
7
h-index
- Computers & Mathematics with Applications
5 publications · 76 citations
5
h-index
- Theoretical Computer Science
4 publications · 126 citations
4
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 4 publications · 77 citations
4
h-index
- Journal of Parallel and Distributed Computing
3 publications · 134 citations
3
h-index
1–5