Reliable computation with cellular automata
Journal of Computer and System Sciences
A simple three-dimensional real-time reliable cellular array
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Bounding Fan-out in Logical Networks
Journal of the ACM (JACM)
Reliable computation by networks in the presence of noise
IEEE Transactions on Information Theory
A coding theorem for distributed computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the effect of analog noise in discrete-time analog computations
Neural Computation
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Computing Boolean functions from multiple faulty copies of input bits
Theoretical Computer Science - Latin American theorotical informatics
Probabilistic system-on-a-chip architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Fault tolerance in cellular automata at high fault rates
Journal of Computer and System Sciences
Analysis of defect tolerance in molecular crossbar electronics
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
A new probabilistic failure model for networks of gates is formulated. Although this model has not been used previously, it supports the proofs of both the positive and negative results appearing in the literature. Furthermore, with respect to this new model, the complexity measures of both size and depth are affected by at most constant multiplicative factors when the set of functions that can be computed by gates is changed from one finite and complete basis to another, or when the bound on the failure probability of the gates is changed (within the limits allowed by the basis), or when the bound on the error probability of the network is changed (within the limits allowed by the basis and the failure probability of the gates).