On the public citation graph
A dilated-diagonal-based scheme for broadcast in a wormhole-routed 2D torus
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.
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.1016/0020-0190(93)90099-uopenalex-snapshot
An efficient algorithm for multiple simultaneous broadcasts in the hypercube
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/12.589231openalex-snapshot
Toward optimal broadcast in a star graph using multiple spanning trees
inferredcites →https://doi.org/10.1109/2.191995openalex-snapshot
A survey of wormhole routing techniques in direct networks
inferredcites →https://doi.org/10.1109/71.298203openalex-snapshot
Deadlock-free multicast wormhole routing in 2-D mesh multicomputers
inferredcites →https://doi.org/10.1109/71.342134openalex-snapshot
Optimal broadcast in all-port wormhole-routed hypercubes
inferredcites →https://doi.org/10.1109/71.485503openalex-snapshot
A trip-based multicasting model in wormhole-routed networks with virtual channels
inferredcites →https://doi.org/10.1109/71.485507openalex-snapshot
Circuit-switched broadcasting in torus and mesh networks
inferredcites →https://doi.org/10.1109/71.503775openalex-snapshot
All-to-all personalized communication in a wormhole-routed torus
inferredcites →https://doi.org/10.1109/dmcc.1991.633174openalex-snapshot
Efficient All-to-All Communication Patterns in Hypercube and Mesh Topologies
inferredcites →https://doi.org/10.1109/fmpc.1995.380471openalex-snapshot
A broadcast algorithm for all-port wormhole-routed torus networks
inferredcites →https://doi.org/10.1109/ipps.1994.288249openalex-snapshot
Circuit-switched broadcasting in d-dimensional tori and meshes
inferredcites →https://doi.org/10.1109/ipps.1995.395878openalex-snapshot
Broadcasting on the star and pancake interconnection networks
inferredcites →https://doi.org/10.1145/181181.181323openalex-snapshot
A dominating set model for broadcast in all-port wormhole-routed 2D mesh networks
inferredcites →https://doi.org/10.1145/224538.224554openalex-snapshot
A near-optimal broadcasting algorithm in all-port wormhole-routed hypercubes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.2002.1848openalex-snapshot
Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_130openalex-snapshot
Broadcasting in All-Port Wormhole 3-D Meshes of Trees
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_172openalex-snapshot
Circuit-Switched Broadcasting in Multi-port Multi-dimensional Torus Networks⋆
inferred← citeshttps://doi.org/10.1007/bfb0100679openalex-snapshot
Circuit-switched broadcast in multi-port 2D tori
inferred← citeshttps://doi.org/10.1007/s10766-011-0169-2openalex-snapshot
Efficient and Scalable Routing Algorithms for Collective Communication Operations on 2D All-Port Torus Networks
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.1023/a:1011650615731openalex-snapshot
Circuit-Switched Broadcasting in Multi-Port Multi-Dimensional Torus Networks
inferred← citeshttps://doi.org/10.1049/ip-cdt:20000887openalex-snapshot
Multinode broadcasting in a wormhole-routed 2-D torus using an aggregation-then-distribution strategy
inferred← citeshttps://doi.org/10.1109/12.841128openalex-snapshot
Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori
inferred← citeshttps://doi.org/10.1109/71.824641openalex-snapshot
Adaptive and deadlock-free routing for irregular faulty patterns in mesh multicomputer
inferred← citeshttps://doi.org/10.1109/icpads.1998.741093openalex-snapshot
Broadcasting on wormhole-routed 2D tori with arbitrary size
inferred← citeshttps://doi.org/10.1109/icpp.1998.708528openalex-snapshot
Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori
inferred← citeshttps://doi.org/10.1109/icpp.2003.1240619openalex-snapshot
A priority-based balanced routing scheme for random broadcasting and routing in tori
inferred← citeshttps://doi.org/10.1109/icppw.1999.800040openalex-snapshot
Multi-node broadcasting in a wormhole-routed 2-D torus using an aggregation-then-distribution strategy
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846005openalex-snapshot
Optimal broadcasting in all-port meshes of trees with distance-insensitive routing
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302923openalex-snapshot
Random broadcasting in product networks and symmetric networks
inferred← citeshttps://doi.org/10.1109/ipps.1998.669881openalex-snapshot
Nearly optimal algorithms for broadcast on d-dimensional all-port and wormhole-routed torus
inferred← citeshttps://doi.org/10.1109/ispa.2010.100openalex-snapshot
Prioritized Dominating-Set Broadcasting for Optimal Random Broadcasting
inferred← citeshttps://doi.org/10.1109/tpds.2005.129openalex-snapshot
A recursion-based broadcast paradigm in wormhole routed networks
inferred← citeshttps://doi.org/10.1145/277830.277926openalex-snapshot
Depth contention-free broadcasting on torus networks
inferred← citeshttps://doi.org/10.6688/jise.2003.19.1.6openalex-snapshot
Optimal Algorithm for Matrix Transpose on Wormhole-Switched Meshes *
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.