Pages that link to "Item:Q5735549"
From MaRDI portal
The following pages link to Reliable circuits using less reliable relays (Q5735549):
Displaying 50 items.
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Sparse reliable graph backbones (Q418121) (← links)
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks (Q606827) (← links)
- On optimizing edge connectivity of product graphs (Q626866) (← links)
- Computing diameter constrained reliability of a network with junction points (Q649994) (← links)
- Using amplification to compute majority with small majority gates (Q677991) (← links)
- Ideal clutters (Q697573) (← links)
- Complexity and organizational architecture (Q712480) (← links)
- Redundancy in task assignments and group performance (Q772186) (← links)
- Graph theoretic characterization and reliability of the multiple-clique network (Q919011) (← links)
- Reliability properties of the hypercube network (Q1102261) (← links)
- Lower bounds on two-terminal network reliability (Q1116878) (← links)
- On the S-shaped theorem (Q1186022) (← links)
- Optimal design of hybrid fault-tolerant computer systems (Q1197072) (← links)
- Variable evaluation costs and the design of fallible hierarchies and polyarchies (Q1198131) (← links)
- Crossing properties of reliability functions (Q1200769) (← links)
- Directed monotone contact networks for threshold functions (Q1327314) (← links)
- Arbitrarily reliable systems with two dual modes of failure (Q1332894) (← links)
- Reliability polynomials can cross twice (Q1338581) (← links)
- Sixty years of network reliability (Q1616159) (← links)
- Determining whether a class of random graphs is consistent with an observed contact network (Q1648951) (← links)
- Thirteen theorems in search of the truth (Q1839180) (← links)
- Monomial ideals and the Scarf complex for coherent systems in reliability theory. (Q1879939) (← links)
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs (Q1995391) (← links)
- Testing idealness in the filter oracle model (Q2102851) (← links)
- On reliability of large-scale nets constructed from identical elements (Q2281435) (← links)
- Expected reliability of communication protocols (Q2317660) (← links)
- On the reliability roots of simplicial complexes and matroids (Q2319721) (← links)
- Practical sequential bounds for approximating two-terminal reliability (Q2378344) (← links)
- A bound on 4-restricted edge connectivity of graphs (Q2384424) (← links)
- Deltas, extended odd holes and their blockers (Q2421555) (← links)
- Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits (Q2513187) (← links)
- Interwoven redundant logic (Q2523883) (← links)
- Synthesis of contact networks from prescribed reliability functions (Q2531551) (← links)
- Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations (Q2630729) (← links)
- On edge cut of graphs leaving components of order at least five (Q2637742) (← links)
- On<i>m</i>-restricted edge connectivity of undirected generalized De Bruijn graphs (Q2874307) (← links)
- On the number of spanning trees of circulant graphs (Q3216668) (← links)
- Algebraic Methods for Granular Rough Sets (Q3299868) (← links)
- Interactive Reliability Analysis on a Microcomputer (Q3350597) (← links)
- Asymptotic property of a reparable multi-state device (Q3367377) (← links)
- The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees (Q3415946) (← links)
- Limiting survival functions of self-similar structures (Q4651715) (← links)
- A random hierarchical lattice: the series-parallel graph and its properties (Q4662240) (← links)
- Obituary: Claude Elwood Shannon 1916-2001 (Q5409124) (← links)
- Network reliability analysis: Part I (Q5650314) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
- Fast reliability ranking of matchstick minimal networks (Q6065903) (← links)
- Exact reliability optimization for series‐parallel graphs using convex envelopes (Q6066247) (← links)
