On the public citation graph

Interleaved all-to-all reliable broadcast on meshes and hypercubes

0 signed · 54 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.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4684-5511-3_19openalex-snapshot
A Fine-Grain, Message-Passing Processing Node
inferredcites →https://doi.org/10.1007/978-94-009-0517-7_2openalex-snapshot
Decomposition into Cycles I: Hamilton Decompositions
inferredcites →https://doi.org/10.1007/bf01660031openalex-snapshot
The torus routing chip
inferredcites →https://doi.org/10.1016/0012-365x(78)90096-1openalex-snapshot
Hamiltonian decompositions of products of cycles
inferredcites →https://doi.org/10.1016/0012-365x(82)90163-7openalex-snapshot
Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/0376-5075(79)90032-1openalex-snapshot
Virtual cut-through: A new computer communication switching technique
inferredcites →https://doi.org/10.1109/12.46277openalex-snapshot
Addressing, routing, and broadcasting in hexagonal mesh multiprocessors
inferredcites →https://doi.org/10.1109/12.54844openalex-snapshot
Hardware-assisted software clock synchronization for homogeneous distributed systems
inferredcites →https://doi.org/10.1109/12.8723openalex-snapshot
A distributed algorithm for fault diagnosis in systems with soft failures
inferredcites →https://doi.org/10.1109/12.9743openalex-snapshot
Reliable broadcast in hypercube multicomputers
inferredcites →https://doi.org/10.1109/iccd.1989.63348openalex-snapshot
A microprogrammable VLSI routing controller for HARTS
inferredcites →https://doi.org/10.1109/sfcs.1986.24openalex-snapshot
How robust is the n-cube?
inferredcites →https://doi.org/10.1109/tc.1985.1676622openalex-snapshot
Ensuring Fault Tolerance of Phase-Locked Clocks
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1145/118544.119233openalex-snapshot
Reliable broadcast algorithms for HARTS
inferredcites →https://doi.org/10.1145/2455.2457openalex-snapshot
Synchronizing clocks in the presence of faults
inferredcites →https://doi.org/10.1145/2465.2467openalex-snapshot
The cosmic cube
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/52324.52343openalex-snapshot
The VMP network adapter board (NAB): high-performance network communication for multiprocessors
inferredcites →https://doi.org/10.1145/800255.810659openalex-snapshot
A large scale, homogeneous, fully distributed parallel machine, I

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.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1538openalex-snapshot
Broadcasting on Incomplete WK-Recursive Networks
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1631openalex-snapshot
Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_24openalex-snapshot
Dihamiltonian Decomposition of Regular Graphs with Degree Three
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_31openalex-snapshot
Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_27openalex-snapshot
N-party BAR Transfer
inferred← citeshttps://doi.org/10.1007/bfb0009506openalex-snapshot
Directed hamiltonian packing in d-dimensional meshes and its application
inferred← citeshttps://doi.org/10.1007/s11227-022-04825-5openalex-snapshot
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting
inferred← citeshttps://doi.org/10.1016/j.dam.2014.09.006openalex-snapshot
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.12.004openalex-snapshot
Edge-disjoint Hamiltonian cycles of balanced hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.004openalex-snapshot
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
inferred← citeshttps://doi.org/10.1080/23799927.2023.2225049openalex-snapshot
Recursive definition and two edge-disjoint Hamiltonian cycles of bubble-sort star graphs
inferred← citeshttps://doi.org/10.1109/12.599895openalex-snapshot
All-to-all broadcasting in faulty hypercubes
inferred← citeshttps://doi.org/10.1109/71.494631openalex-snapshot
On general results for all-to-all broadcast
inferred← citeshttps://doi.org/10.1109/aiccsa.2005.1387017openalex-snapshot
An all-to-all broadcasting algorithm for faulty hypercubes
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633359openalex-snapshot
Edge-Disjoint Hamiltonian Cycles in de Bruijn Networks
inferred← citeshttps://doi.org/10.1109/hicss.1997.663156openalex-snapshot
Distributed route initialization algorithms for the Monash Secure RISC Multiprocessor
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys53884.2021.00074openalex-snapshot
Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting
inferred← citeshttps://doi.org/10.1109/icpads.2001.934838openalex-snapshot
Parallel routing in hypercube networks with faulty nodes
inferred← citeshttps://doi.org/10.1109/infoseee.2014.6948077openalex-snapshot
On the embedding of edge-disjoint Hamiltonian cycles in transposition networks
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370223openalex-snapshot
Nonuniformly Communicating Noncontiguous Data: A Case Study with PETSc and MPI
inferred← citeshttps://doi.org/10.1109/ipps.1997.580957openalex-snapshot
Hybrid time synchronization implemented through special ring array for mesh or torus
inferred← citeshttps://doi.org/10.1109/tpds.2002.1028435openalex-snapshot
On the asymptotical optimality of multilayered decentralized consensus protocol
inferred← citeshttps://doi.org/10.1142/s0129054124500047openalex-snapshot
Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting
inferred← citeshttps://doi.org/10.1145/2034640.2034647openalex-snapshot
N-party BAR Transfer
inferred← citeshttps://doi.org/10.3390/math11153384openalex-snapshot
Three Edge-Disjoint Hamiltonian Cycles in Folded Locally Twisted Cubes and Folded Crossed Cubes with Applications to All-to-All Broadcasting
inferred← citeshttps://doi.org/10.3390/math14020232openalex-snapshot
Constructing Two Edge-Disjoint Hamiltonian Cycles in BCube Data Center Networks for All-to-All Broadcasting
inferred← citeshttps://doi.org/10.3390/sym14081740openalex-snapshot
Fault Tolerant Addressing Scheme for Oxide Interconnection Networks
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.336-338.2248openalex-snapshot
Embedding Two Edge-Disjoint Hamiltonian Cycles into Parity Cubes
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3909openalex-snapshot
Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes
inferred← citeshttps://doi.org/10.48550/arxiv.1010.2466openalex-snapshot
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes
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.