On the public citation graph
A Note on the Reliability of Communication Networks
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1955.tb03767.xopenalex-snapshot
Boolean Matrices and the Design of Combinational Relay Switching Circuits
inferredcites →https://doi.org/10.1002/j.1538-7305.1955.tb03799.xopenalex-snapshot
Analysis of Switching Networks
inferredcites →https://doi.org/10.1016/0016-0032(56)90044-8openalex-snapshot
Reliable circuits using less reliable relays
inferredcites →https://doi.org/10.1016/0016-0032(56)90559-2openalex-snapshot
Reliable circuits using less reliable relays
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1063/1.3034322openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
inferredcites →https://doi.org/10.1109/tce.1958.6372698openalex-snapshot
The analysis of redundancy networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.21977openalex-snapshot
Network reliability: Heading out on the highway
inferred← citeshttps://doi.org/10.1002/net.3230040202openalex-snapshot
Exact calculation of computer network reliability
inferred← citeshttps://doi.org/10.1002/net.3230100105openalex-snapshot
Maximal expected flow in a network subject to arc failures
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_80761openalex-snapshot
Uncertain Graph Data Management
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_80761-1openalex-snapshot
Uncertain Graph Data Management
inferred← citeshttps://doi.org/10.1007/bf01534958openalex-snapshot
On the realization of reliability functions of probabilistic communication networks
inferred← citeshttps://doi.org/10.1016/0026-2714(83)91008-9openalex-snapshot
Steiner trees in probabilistic networks
inferred← citeshttps://doi.org/10.1016/0305-0548(76)90017-4openalex-snapshot
Shortest distance and reliability of probabilistic networks
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73612-0openalex-snapshot
Random Graphs of Small Order
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80128-8openalex-snapshot
Chapter 11 Network reliability
inferred← citeshttps://doi.org/10.1109/access.2018.2828036openalex-snapshot
On the Exact Reliability Enhancements of Small Hammock Networks
inferred← citeshttps://doi.org/10.1109/dtis.2017.7929871openalex-snapshot
On hammock networks - sixty years after
inferred← citeshttps://doi.org/10.1109/icccc.2018.8390449openalex-snapshot
On algorithms for evaluating the reliability of large Hammock networks
inferred← citeshttps://doi.org/10.1109/tcbb.2014.2343967openalex-snapshot
Reachability Analysis in Probabilistic Biological Networks
inferred← citeshttps://doi.org/10.1109/tcom.1965.1089137openalex-snapshot
Applications of Topological Methods to Probabilistic Communication Networks
inferred← citeshttps://doi.org/10.1109/tcom.1967.1089673openalex-snapshot
Vulnerability of Communication Networks
inferred← citeshttps://doi.org/10.1109/tcom.1972.1091214openalex-snapshot
Analysis and Design of Reliable Computer Networks
inferred← citeshttps://doi.org/10.1109/tct.1965.1082452openalex-snapshot
Probabilistic Flows Through a Communication Network
inferred← citeshttps://doi.org/10.1109/tct.1969.1082978openalex-snapshot
Synthesis of Reliable Networks
inferred← citeshttps://doi.org/10.1109/tit.1968.1054196openalex-snapshot
Bounds on the average terminal capacity of probabilistic nets (Corresp.)
inferred← citeshttps://doi.org/10.1109/tpas.1966.291638openalex-snapshot
Reliability and Optimum Design of the Interconnections of a Power System
inferred← citeshttps://doi.org/10.1109/tr.1976.5214985openalex-snapshot
Synthesis of Available Networks
inferred← citeshttps://doi.org/10.1109/tr.1982.5221373openalex-snapshot
A New Approach for Network Reliability Analysis
inferred← citeshttps://doi.org/10.1109/tr.2013.2241132openalex-snapshot
Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks
inferred← citeshttps://doi.org/10.1137/0111058openalex-snapshot
Wye-Delta Transformation in Probablilistic Networks
inferred← citeshttps://doi.org/10.1137/0119070openalex-snapshot
The Shortest Hamiltonian Chain of a Graph
inferred← citeshttps://doi.org/10.1145/2506583.2506691openalex-snapshot
Reachability analysis in large probabilistic biological networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.