scientific article; zbMATH DE number 434680
From MaRDI portal
Publication:3139515
zbMATH Open0798.68069MaRDI QIDQ3139515FDOQ3139515
Authors: A. Nayak, L. Pagli, N. Santoro 
Publication date: 2 January 1994
Title of this publication is not available (Why is that?)
Recommendations
- Efficient construction of catastrophic patterns for VLSI reconfigurable arrays
- scientific article; zbMATH DE number 4115981
- On the complexity of testing for catastrophic faults
- Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
- Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12) Applications of graph theory to circuits and networks (94C15)
Cited In (6)
- On enumeration of catastrophic fault patterns
- On the complexity of testing for catastrophic faults
- Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
- An improved testing scheme for catastrophic fault patterns
- A decomposition scheme for the analysis of fault trees and other combinatorial circuits
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139515)
