Fault Tolerant Algorithms

Fault Tolerant Algorithms is a class of computational methods in Parallel Numerical Linear Algebra designed to maintain correctness and convergence in the presence of hardware or software failures by incorporating redundancy, checkpointing, or algorithmic resilience mechanisms.

706

Publications

38.6K

Citations

1.4K

Authors

541

Institutions

Publications per year

2017–2026

90

Authors

1.4K

  1. ZC
    Zizhong Chen

    University of California, Riverside, United States

    27 publications · 1.4K citations

    24

    h-index

  2. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    19 publications · 964 citations

    16

    h-index

  3. NK
    Niraj K. Jha

    Princeton University, United States

    10 publications · 787 citations

    10

    h-index

  4. JA
    Jacob A. Abraham

    The University of Texas at Austin, United States

    10 publications · 2K citations

    10

    h-index

  5. DP
    David Peleg

    Weizmann Institute of Science, Israel

    9 publications · 602 citations

    9

    h-index

1–5 of 1.4K

Venues

  1. IEEE Transactions on Computers

    59 publications · 5K citations

    32

    h-index

  2. IEEE Transactions on Reliability

    26 publications · 1.1K citations

    21

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 28 publications · 1.9K citations

    19

    h-index

  4. arXiv (Cornell University)

    Repository · 12 publications · 297 citations

    12

    h-index

  5. SIAM Journal on Computing

    8 publications · 539 citations

    9

    h-index

1–5