On the public citation graph
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
0 signed · 27 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/net.3230150203openalex-snapshot
Fault‐tolerant broadcast graphs
inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1002/net.3230190606openalex-snapshot
On the construction of minimal broadcast networks
inferredcites →https://doi.org/10.1002/net.3230190706openalex-snapshot
Time bounds on fault‐tolerant broadcasting
inferredcites →https://doi.org/10.1016/0012-365x(79)90022-0openalex-snapshot
Minimum broadcast graphs
inferredcites →https://doi.org/10.1137/0404021openalex-snapshot
Tight Bounds on Mimimum Broadcast Networks
inferredcites →https://doi.org/10.1137/0608036openalex-snapshot
On Gossiping with Faulty Telephone Lines
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.3230220505openalex-snapshot
Tighter time bounds on fault‐tolerant broadcasting and gossiping
inferred← citeshttps://doi.org/10.1002/net.3230230409openalex-snapshot
Fault—tolerant hypercube broadcasting via information dispersal
inferred← citeshttps://doi.org/10.1006/jagm.1996.0810openalex-snapshot
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1157openalex-snapshot
Broadcasting in Faulty Binary Jumping Networks
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1303openalex-snapshot
Broadcasting with a Bounded Fraction of Faulty Nodes
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1625openalex-snapshot
Optimal Broadcasting in Faulty Trees
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_10openalex-snapshot
Optimal adaptive broadcasting with a bounded fraction of faulty nodes
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_17openalex-snapshot
Optimal fault-tolerant broadcasting in trees
inferred← citeshttps://doi.org/10.1007/bfb0022149openalex-snapshot
Broadcasting in hypercubes with randomly distributed Byzantine faults
inferred← citeshttps://doi.org/10.1016/0167-8191(96)00023-3openalex-snapshot
Adaptive broadcasting with faulty nodes
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90256-mopenalex-snapshot
Graph theoretical issues in computer networks
inferred← citeshttps://doi.org/10.1016/j.dam.2015.11.008openalex-snapshot
Binary linear programming models for robust broadcasting in communication networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00106-6openalex-snapshot
Minimum time broadcast in faulty star networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00107-8openalex-snapshot
Broadcasting with linearly bounded transmission faults
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00109-6openalex-snapshot
Communication complexity of fault-tolerant information diffusion
inferred← citeshttps://doi.org/10.1109/spdp.1993.395484openalex-snapshot
Communication complexity of fault-tolerant information diffusion
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.