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

Authors

316

  1. SD
    Shlomi Dolev

    Ben-Gurion University of the Negev, Israel

    19 publications · 783 citations

    15

    h-index

  2. FP
    Franck Petit

    Université de Picardie Jules Verne, France

    13 publications · 401 citations

    12

    h-index

  3. PK
    Pradip K. Srimani

    Colorado State University, United States

    12 publications · 337 citations

    11

    h-index

  4. ST
    Sébastien Tixeuil

    Sorbonne Université, France

    12 publications · 330 citations

    11

    h-index

  5. VV
    Vincent Villain

    Université de Picardie Jules Verne, France

    12 publications · 370 citations

    11

    h-index

1–5 of 316

Venues

  1. Information Processing Letters

    13 publications · 546 citations

    12

    h-index

  2. Journal of Parallel and Distributed Computing

    10 publications · 363 citations

    10

    h-index

  3. Theoretical Computer Science

    9 publications · 254 citations

    9

    h-index

  4. Parallel Processing Letters

    7 publications · 188 citations

    7

    h-index

  5. Distributed Computing

    7 publications · 479 citations

    7

    h-index

1–5