Reliable circuits using less reliable relays
From MaRDI portal
Publication:5735549
DOI10.1016/0016-0032(56)90044-8zbMath0123.12408OpenAlexW2014091871MaRDI QIDQ5735549
Claude Shannon, Edward F. Moore
Publication date: 1956
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(56)90559-2
Related Items
On the optimality of Bellman-Ford-Moore shortest path algorithm, Directed monotone contact networks for threshold functions, Sixty years of network reliability, Arbitrarily reliable systems with two dual modes of failure, Monomial ideals and the Scarf complex for coherent systems in reliability theory., Reliability polynomials can cross twice, Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations, Dialectical Rough Sets, Parthood and Figures of Opposition-I, Practical sequential bounds for approximating two-terminal reliability, On edge cut of graphs leaving components of order at least five, A bound on 4-restricted edge connectivity of graphs, Reliability properties of the hypercube network, Detecting and Estimating Signals over Noisy and Unreliable Synapses: Information-Theoretic Analysis, Determining whether a class of random graphs is consistent with an observed contact network, Improved multiplex control systems: dynamic reliability and stochastic optimality, Lower bounds on two-terminal network reliability, Maximizing the number of spanning trees on the (p,p+2) graphs, On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks, Selbstkorrigierende Zuordner für vollständige Codes, On the number of spanning trees of circulant graphs, Reliability analysis on the multiple-loop network, Polynomial-time algorithms for multimarginal optimal transport problems with structure, The node cop‐win reliability of unicyclic and bicyclic graphs, Fast reliability ranking of matchstick minimal networks, Exact reliability optimization for series‐parallel graphs using convex envelopes, Deltas, extended odd holes and their blockers, Uniformly optimally reliable graphs: A survey, Network reliability: Heading out on the highway, <scp>M</scp>ost reliable two‐terminal graphs with node failures, Rational roots of all‐terminal reliability, Network reliability analysis: Part I, How Do Read-Once Formulae Shrink?, Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots, On optimizing edge connectivity of product graphs, Sparse reliable graph backbones, Graph theoretic characterization and reliability of the multiple-clique network, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, Computing diameter constrained reliability of a network with junction points, Algebraic Methods for Granular Rough Sets, On the S-shaped theorem, Using amplification to compute majority with small majority gates, Obituary: Claude Elwood Shannon 1916-2001, Optimal design of hybrid fault-tolerant computer systems, Variable evaluation costs and the design of fallible hierarchies and polyarchies, Limiting survival functions of self-similar structures, Algorithm of multidimensional data transmission using extremal uniform hypergraphs, Detection delays, false alarm rates and the reconfiguration of control systems, Crossing properties of reliability functions, Ideal clutters, A random hierarchical lattice: the series-parallel graph and its properties, On the width—length inequality, Perfect, ideal and balanced matrices, Complexity and organizational architecture, Interactive Reliability Analysis on a Microcomputer, Reliable control using multiple control systems, On reliability of large-scale nets constructed from identical elements, Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits, Asymptotic property of a reparable multi-state device, On the width-length inequality, Interwoven redundant logic, Synthesis of contact networks from prescribed reliability functions, On alternative definitions of multistate coherent systems, Expected reliability of communication protocols, Full Hermite interpolation of the reliability of a hammock network, On the reliability roots of simplicial complexes and matroids, Redundancy in task assignments and group performance, The number of spanning trees of the regular networks, Generalisation of Dedekind's problem of the enumeration of coherent structures, The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees, Thirteen theorems in search of the truth, Testing idealness in the filter oracle model, Onm-restricted edge connectivity of undirected generalized De Bruijn graphs
