On the public citation graph

Broadcasting in grid graphs

0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230100106openalex-snapshot
Minimum‐time line broadcast networks
inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1007/bf02478413openalex-snapshot
The distribution of completion times for random communication in a task-oriented group
inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferredcites →https://doi.org/10.1016/0166-218x(94)90194-5openalex-snapshot
Broadcasting multiple messages in a grid
inferredcites →https://doi.org/10.1016/s0166-218x(97)00111-xopenalex-snapshot
Line broadcasting in cycles
inferredcites →https://doi.org/10.1016/s0167-8191(05)80023-7openalex-snapshot
Comments on broadcast algorithms for two-dimensional grids
inferredcites →https://doi.org/10.1121/1.1906679openalex-snapshot
Communication Patterns in Task-Oriented Groups
inferredcites →https://doi.org/10.1137/0139032openalex-snapshot
Broadcast Time in Communication Networks
inferredcites →https://doi.org/10.1137/0210052openalex-snapshot
Information Dissemination in Trees
inferredcites →https://doi.org/10.33915/etd.3172openalex-snapshot
Broadcasting in grid graphs
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.1007/11753810_71openalex-snapshot
Managing Random Sensor Networks by means of Grid Emulation
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_16openalex-snapshot
Broadcasting in Conflict-Aware Multi-channel Networks
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90047-9openalex-snapshot
Broadcasting in one dimension
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90024-3openalex-snapshot
Extremal broadcasting problems
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90194-5openalex-snapshot
Broadcasting multiple messages in a grid
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.010openalex-snapshot
An efficient heuristic for broadcasting in networks
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00371-3openalex-snapshot
Neighborhood Communications in Networks
inferred← citeshttps://doi.org/10.1109/hicss.1995.375499openalex-snapshot
Broadcasting in an n-grid with a given neighborhood template
inferred← citeshttps://doi.org/10.1109/hicss.1995.375500openalex-snapshot
Broadcasting with universal lists
inferred← citeshttps://doi.org/10.1109/hicss.2006.413openalex-snapshot
Reliable Broadcast in Wireless Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/infcom.1990.91283openalex-snapshot
On network characterization of and optimal broadcasting in the Manhattan Street Network
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354688openalex-snapshot
Approximation and heuristic algorithms for minimum delay application-layer multicast trees
inferred← citeshttps://doi.org/10.1109/iv.2004.106openalex-snapshot
Orderly broadcasting in a 2D torus
inferred← citeshttps://doi.org/10.1109/iv.2004.1320170openalex-snapshot
Orderly broadcasting in a 2D Torus
inferred← citeshttps://doi.org/10.1109/pccc.1988.10092openalex-snapshot
A distributed broadcast algorithm for binary De Bruijn networks
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365693openalex-snapshot
Rapid rumor ramification: approximating the minimum broadcast time
inferred← citeshttps://doi.org/10.1109/synasc57785.2022.00024openalex-snapshot
Fully-adaptive Model for Broadcasting with Universal Lists
inferred← citeshttps://doi.org/10.1109/tc.1981.1675796openalex-snapshot
Minimum Broadcast Trees
inferred← citeshttps://doi.org/10.1109/tnet.2007.892840openalex-snapshot
Approximation and Heuristic Algorithms for Minimum-Delay Application-Layer Multicast Trees
inferred← citeshttps://doi.org/10.1145/952532.952732openalex-snapshot
An optimal broadcasting schema for multidimensional mesh structures
inferred← citeshttps://doi.org/10.11606/d.45.1994.tde-20210729-004645openalex-snapshot
Novas estruturas de interconexão a base de barramentos e algoritmos de comunicação: uma contribuição à computação maciçamente paralela
inferred← citeshttps://doi.org/10.1504/ijhpcn.2004.008905openalex-snapshot
Minimal broadcasting schemas for the mesh structures
inferred← citeshttps://doi.org/10.33915/etd.2708openalex-snapshot
Broadcasting in cycles with chords
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02491openalex-snapshot
Line-Broadcasting in Complete k-Trees
showing the first 25 of 26 · page through all 26
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.