Fault-tolerant Discovery
Fault-Tolerant Discovery is a resource discovery mechanism that ensures continuous and reliable identification of available resources in distributed systems despite the presence of node failures, network partitions, or other operational disruptions.
20
Publications
1.1K
Citations
46
Authors
25
Institutions
Publications per year
2017–2026
5
Parents
20
James Aspnes, Gauri Shah · Symposium on Discrete Algorithms · 2003 · 333 citations
James Aspnes, Gauri Shah · ACM Transactions on Algorithms · 2007 · 326 citations
1–5 of 20
46
2
h-index
2
h-index
National Institute of Standards and Technology, United States
2 publications · 52 citations
2
h-index
1
h-index
National Institute of Standards and Technology, United States
1 publications · 36 citations
1
h-index
1–5 of 46
25

University of Ottawa
Ottawa, Canada
2 h-index
3 publications
58 citations
Yale University
New Haven, United States
2 h-index
3 publications
992 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
1 publications
10 citations

King Saud University
Riyadh, Saudi Arabia
1 h-index
2 publications
38 citations
IBM (United Kingdom)
Winchester, United Kingdom
1 h-index
1 publications
10 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
1 publications
11 citations
Cardiff University
Cardiff, United Kingdom
1 h-index
3 publications
108 citations
University of California, Berkeley
Berkeley, United States
1 h-index
3 publications
150 citations
1–8 of 25
TALG · 1 publications · 326 citations
1
h-index
1 publications · 15 citations
1
h-index
TPDS · 1 publications · 20 citations
1
h-index
1 publications · 22 citations
1
h-index
1 publications · 13 citations
1
h-index
1–5