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
706
1–5 of 706
1.4K
24
h-index
16
h-index
10
h-index
10
h-index
9
h-index
1–5 of 1.4K
541
University of Illinois Urbana-Champaign
Urbana, United States
21 h-index
51 publications
5.8K citations
University of Tennessee at Knoxville
Knoxville, United States
15 h-index
48 publications
3.1K citations
University of California, Riverside
Riverside, United States
14 h-index
48 publications
1.9K citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
21 publications
7.7K citations
The University of Texas at Austin
Austin, United States
13 h-index
27 publications
1.4K citations
Princeton University
Princeton, United States
12 h-index
21 publications
1.2K citations

Weizmann Institute of Science
Rehovot, Israel
12 h-index
19 publications
700 citations

Oak Ridge National Laboratory
Oak Ridge, United States
12 h-index
21 publications
1.4K citations
1–8 of 541
59 publications · 5K citations
32
h-index
26 publications · 1.1K citations
21
h-index
TPDS · 28 publications · 1.9K citations
19
h-index
Repository · 12 publications · 297 citations
12
h-index
8 publications · 539 citations
9
h-index
1–5