Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Fault diagnosis in computing networks
Fault diagnosis in computing networks
Graph Theory With Applications
Graph Theory With Applications
Dynamic Testing Strategy for Distributed Systems
IEEE Transactions on Computers
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Distributed off-line testing of parallel systems
ATS '95 Proceedings of the 4th Asian Test Symposium
| Hi-index | 14.98 |
The problem of how a user incapable of performing tests can diagnose a system, given the results of the Kuhl and Reddy algorithm, (1980 (3 paper), 1981), is addressed. In particular, the authors provide optimal or near-optimal algorithms for this purpose under a variety of assumptions.