On the public citation graph
Multiple message broadcasting in communication networks
0 signed · 35 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.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.3230230109openalex-snapshot
Local broadcasting in a tree under minisum criterion
inferredcites →https://doi.org/10.1002/net.3230230505openalex-snapshot
A new method for constructing minimal broadcast networks
inferredcites →https://doi.org/10.1016/0012-365x(79)90022-0openalex-snapshot
Minimum broadcast graphs
inferredcites →https://doi.org/10.1016/0166-218x(94)90001-9openalex-snapshot
Broadcasting multiple messages in simultaneous send/receive systems
inferredcites →https://doi.org/10.1016/0743-7315(91)90094-popenalex-snapshot
Optimal broadcasting on SIMD hypercubes without indirect addressing capability
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/12.93751openalex-snapshot
Information dissemination in trees with nonuniform edge transmission times
inferredcites →https://doi.org/10.1109/spdp.1993.395513openalex-snapshot
Broadcasting multiple messages in simultaneous send/receive systems
inferredcites →https://doi.org/10.1109/spdp.1994.346164openalex-snapshot
Optimal multiple message broadcasting in telephone-like communication systems
inferredcites →https://doi.org/10.1137/0139032openalex-snapshot
Broadcast Time in Communication Networks
inferredcites →https://doi.org/10.1137/0404021openalex-snapshot
Tight Bounds on Mimimum Broadcast Networks
inferredcites →https://doi.org/10.1145/165231.165250openalex-snapshot
Optimal broadcast and summation in the LogP model
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.21749openalex-snapshot
New upper bound on m‐time‐relaxed k‐broadcast graphs
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1584openalex-snapshot
An Optimal Algorithm for Broadcasting Multiple Messages in Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-72990-7_54openalex-snapshot
On Uncoordinated File Distribution with Non-altruistic Downloaders
inferred← citeshttps://doi.org/10.1007/978-3-540-75416-9_10openalex-snapshot
Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees
inferred← citeshttps://doi.org/10.1007/s10951-007-0017-9openalex-snapshot
Optimal scheduling of peer-to-peer file dissemination
inferred← citeshttps://doi.org/10.1007/s10951-020-00643-wopenalex-snapshot
Broadcasting a file in a communication network
inferred← citeshttps://doi.org/10.1016/j.dam.2026.03.049openalex-snapshot
Broadcasting two messages in wheel graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.12.001openalex-snapshot
Optimal broadcast for fully connected processor-node networks
inferred← citeshttps://doi.org/10.1016/j.parco.2009.09.001openalex-snapshot
Two-tree algorithms for full bandwidth broadcast, reduction and scan
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00244-5openalex-snapshot
Sparse Hypercube—a minimal k-line broadcast graph
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00155-9openalex-snapshot
Optimal multiple message broadcasting in telephone-like communication systems
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120383openalex-snapshot
Minimizing weighted sum finish time for one-to-many file transfer in peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/cluster51413.2022.00028openalex-snapshot
Fast(er) Construction of Round-optimal $n$-Block Broadcast Schedules
inferred← citeshttps://doi.org/10.1109/ngi.2007.371191openalex-snapshot
Relying on randomness PlanetLab experiments with distributed file-sharing protocols
inferred← citeshttps://doi.org/10.1145/1215956.1215963openalex-snapshot
Analysis of peer-to-peer file dissemination
inferred← citeshttps://doi.org/10.1145/3735139openalex-snapshot
Optimal Broadcast Schedules in Logarithmic Time with Applications to Broadcast, Reduction, All-Broadcast and All-Reduction
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.