Reliable circuits using less reliable relays

Recommendations

On some specific properties of realization of finite-sequential functions by circuits consisting of unreliable elements
scientific article; zbMATH DE number 647639
Improving the reliability of switching circuits
On the reliability of circuits in the basis {V, &,} in the case of one-type constant faults on the inputs of elements
scientific article; zbMATH DE number 4029459

Cited in

(84)

Reliability properties of the hypercube network
Lower bounds on two-terminal network reliability
On the S-shaped theorem
Optimal design of hybrid fault-tolerant computer systems
Variable evaluation costs and the design of fallible hierarchies and polyarchies
Crossing properties of reliability functions
Directed monotone contact networks for threshold functions
Arbitrarily reliable systems with two dual modes of failure
Reliability polynomials can cross twice
Sixty years of network reliability
Determining whether a class of random graphs is consistent with an observed contact network
Thirteen theorems in search of the truth
Monomial ideals and the Scarf complex for coherent systems in reliability theory.
Algorithm of multidimensional data transmission using extremal uniform hypergraphs
Testing idealness in the filter oracle model
On reliability of large-scale nets constructed from identical elements
Expected reliability of communication protocols
On the reliability roots of simplicial complexes and matroids
Practical sequential bounds for approximating two-terminal reliability
A bound on 4-restricted edge connectivity of graphs
Deltas, extended odd holes and their blockers
Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits
Interwoven redundant logic
Synthesis of contact networks from prescribed reliability functions
Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations
On edge cut of graphs leaving components of order at least five
On the optimality of Bellman-Ford-Moore shortest path algorithm
On m-restricted edge connectivity of undirected generalized De Bruijn graphs
On the number of spanning trees of circulant graphs
scientific article; zbMATH DE number 3128922 (Why is no real title available?)
Algebraic methods for granular rough sets
Interactive Reliability Analysis on a Microcomputer
Asymptotic property of a reparable multi-state device
The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees
Improved multiplex control systems: dynamic reliability and stochastic optimality
Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks
Detection delays, false alarm rates and the reconfiguration of control systems
On the width—length inequality
Reliable control using multiple control systems
Generalisation of Dedekind's problem of the enumeration of coherent structures
Maximizing the number of spanning trees on the (p,p+2) graphs
Reliability analysis on the multiple-loop network
On the width-length inequality
Sparse reliable graph backbones
How Do Read-Once Formulae Shrink?
Limiting survival functions of self-similar structures
A random hierarchical lattice: the series-parallel graph and its properties
On alternative definitions of multistate coherent systems
The number of spanning trees of the regular networks
Detecting and Estimating Signals over Noisy and Unreliable Synapses: Information-Theoretic Analysis
Full Hermite interpolation of the reliability of a hammock network
Dialectical Rough Sets, Parthood and Figures of Opposition-I
Selbstkorrigierende Zuordner für vollständige Codes
Obituary: Claude Elwood Shannon 1916-2001
scientific article; zbMATH DE number 3322469 (Why is no real title available?)
Network reliability analysis: Part I
Perfect, ideal and balanced matrices
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
On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
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
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots
On optimizing edge connectivity of product graphs
Computing diameter constrained reliability of a network with junction points
Higher-order interaction learning of line failure cascading in power networks
Does isolating high-modularity communities prevent cascading failure?
Using amplification to compute majority with small majority gates
QRP: quantum reliability polynomial for stochastic reliability analysis of reversible circuits
Most reliable graphs with reduced corank
Degree-based approximations for network reliability polynomials
An algebraic characterization of strong graphs
Characterization of locally most split reliable graphs
Ideal clutters
An optimization-based Monte Carlo method for estimating the two-terminal survival signature of networks with two component classes
Complexity and organizational architecture
Enumeration of lattice paths using vieta polynomials
An -constraint method for the bi-objective efficient 2-terminal reliability problem
Redundancy in task assignments and group performance
Graph theoretic characterization and reliability of the multiple-clique network

This page was built for publication: Reliable circuits using less reliable relays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5735549)