Self-stabilizing Algorithms
Self-Stabilizing Algorithms is a class of distributed algorithms that, regardless of the initial system state, guarantee convergence to a correct system state in finite time and remain in correct states thereafter under normal operation.
220
Publications
7.9K
Citations
316
Authors
166
Institutions
Publications per year
2017–2026
11
220
Distributed Channel Assignment in Multi-Radio 802.11 Mesh Networks
Bongjun Ko, Vishal Misra, Jitendra Padhye et al. · 2007 · 247 citations
Uniform self-stabilizing rings
J. Burns, Jan Pachl · ACM Transactions on Programming Languages and Systems · 1989 · 172 citations · Full text
1–5 of 220
316
15
h-index
12
h-index
11
h-index
11
h-index
11
h-index
1–5 of 316
166
University of Nevada, Las Vegas
Las Vegas, United States
13 h-index
27 publications
730 citations
Ben-Gurion University of the Negev
Beersheba, Israel
13 h-index
23 publications
795 citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
32 publications
846 citations

Université de Picardie Jules Verne
Amiens, France
11 h-index
29 publications
1K citations

Sorbonne Université
Paris, France
11 h-index
14 publications
324 citations
Laboratoire de Recherche en Informatique
Gif-sur-Yvette, France
11 h-index
25 publications
576 citations
Clemson University
Clemson, United States
11 h-index
35 publications
1.3K citations
Université Paris-Sud
Orsay, France
10 h-index
24 publications
582 citations
1–8 of 166
13 publications · 546 citations
12
h-index
10 publications · 363 citations
10
h-index
9 publications · 254 citations
9
h-index
7 publications · 188 citations
7
h-index
7 publications · 479 citations
7
h-index
1–5