An Algorithm for Determining the Fault Diagnosability of a System
IEEE Transactions on Computers
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems
IEEE Transactions on Computers
Improved Diagnosability Algorithms
IEEE Transactions on Computers
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
| Hi-index | 14.98 |
A. Somani et al, (1987) introduced the single-fault set diagnosability measure and gave an O(n/sup 3.5/) algorithm for determining it in the PMC model. The authors present a new algorithm for the same problem with a time complexity of only O(n/sup 2.5/).