Fault-tolerant Distributed Algorithms

Fault-Tolerant Distributed Algorithms is a class of distributed algorithms designed to maintain correct operation and convergence despite the presence of faulty or failing components, distinguished by their ability to tolerate process crashes, network partitions, or message losses while ensuring system reliability and consistency.

438

Publications

27K

Citations

802

Authors

334

Institutions

Publications per year

2017–2026

51

Authors

802

  1. ST
    Sam Toueg

    Cornell University, United States

    14 publications · 4.4K citations

    14

    h-index

  2. RG
    Rachid Guerraoui

    École Polytechnique Fédérale de Lausanne, Switzerland

    13 publications · 1.5K citations

    13

    h-index

  3. AS
    André Schiper

    École Polytechnique Fédérale de Lausanne, Switzerland

    10 publications · 506 citations

    10

    h-index

  4. NH
    Nitin H. Vaidya

    University of Illinois Urbana-Champaign, United States

    11 publications · 410 citations

    10

    h-index

  5. DD
    Danny Dolev

    Hebrew University of Jerusalem, Israel

    9 publications · 1.3K citations

    9

    h-index

1–5 of 802

Venues

  1. IEEE Transactions on Computers

    18 publications · 771 citations

    16

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 12 publications · 510 citations

    11

    h-index

  3. arXiv (Cornell University)

    Repository · 13 publications · 850 citations

    11

    h-index

  4. Computer

    7 publications · 449 citations

    7

    h-index

  5. Infoscience (Ecole Polytechnique Fédérale de Lausanne)

    Repository · 6 publications · 205 citations

    6

    h-index

1–5