On the public citation graph
Optimal algorithms for dissemination of information in some interconnection networks
0 signed · 26 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.3230180205openalex-snapshot
Generalizations of broadcasting and gossiping
inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1016/0020-0190(90)90160-yopenalex-snapshot
Parallel algorithms for gossiping by mail
inferredcites →https://doi.org/10.1016/0020-0190(91)90060-uopenalex-snapshot
Broadcasting in the Butterfly network
inferredcites →https://doi.org/10.1145/72935.72969openalex-snapshot
On the number of rounds necessary to disseminate information
inferredcites →https://doi.org/10.4153/cmb-1972-081-0openalex-snapshot
A Cure for the Telephone Disease
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1996.2618openalex-snapshot
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_196openalex-snapshot
Broadcasting in butterfly and debruijn networks
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_84openalex-snapshot
Optimal algorithms for dissemination of information in generalized communication modes
inferred← citeshttps://doi.org/10.1007/bfb0023459openalex-snapshot
Gossiping and broadcasting versus computing functions in networks
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90184-8openalex-snapshot
Broadcasting in butterfly and deBruijn networks
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90049-3openalex-snapshot
Note on optimal gossiping in some weak-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2014.11.008openalex-snapshot
The shortest path problem in the Knödel graph
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.05.003openalex-snapshot
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00110-8openalex-snapshot
The complexity of broadcasting in planar and decomposable graphs
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040908openalex-snapshot
Worst case analysis of a greedy multicast algorithm in k-ary n-cubes
inferred← citeshttps://doi.org/10.1142/s0129626423400170openalex-snapshot
A Note to Non-adaptive Broadcasting
inferred← citeshttps://doi.org/10.1142/s0129626425500021openalex-snapshot
Dimensional Broadcast Schemes for Generalized Knödel Graphs
inferred← citeshttps://doi.org/10.3390/a18020076openalex-snapshot
Broadcasting in Stars of Cliques and Path-Connected Cliques
inferred← citeshttps://doi.org/10.33915/etd.2434openalex-snapshot
Multiple message broadcasting and gossiping in the dynamically orientable graphs
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.