Self-stabilizing Data Structures
Self-Stabilizing Data Structures is a class of distributed data structures designed to autonomously recover from arbitrary transient faults and eventually converge to a legitimate state without external intervention, ensuring correctness in the presence of disruptions.
5
Publications
99
Citations
13
Authors
9
Institutions
Publications per year
2017–2026
0
Parents
5
A stabilizing search tree with availability properties
Ted Herman, Toshimitsu Masuzawa · 2002 · 15 citations
Static optimality theorem for external memory string access
Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio et al. · 2003 · 13 citations
1–5 of 5
13
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 13
9
The University of Osaka
Osaka, Japan
1 h-index
1 publications
15 citations
Université Paris-Saclay
Gif-sur-Yvette, France
1 h-index
1 publications
27 citations

University of Pisa
Pisa, Italy
1 h-index
3 publications
39 citations

University of Bologna
Bologna, Italy
1 h-index
1 publications
23 citations
Yuan Ze University
Taoyuan District, Taiwan
1 h-index
4 publications
84 citations

University of Turin
Turin, Italy
1 h-index
1 publications
23 citations
AT&T (United States)
Bedminster, United States
1 h-index
1 publications
13 citations
Université Paris Cité
Paris, France
1 h-index
1 publications
27 citations
1–8 of 9
LMCS · 1 publications · 23 citations
1
h-index
1 publications · 21 citations
1
h-index
1–2