S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
It is shown that if formulas are used to compute Boolean functions in the presence of randomly occurring failures (as has been suggested by von Neumann and others), then 1) there is a limit strictly less than 1/2 to the failure probability per gate that can be tolerated, and 2) formulas that tolerate failures must be deeper (and, therefore, compute more slowly) than those that do not. © 1988 IEEE
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine