On the public citation graph

Broadcasting in hypercubes with randomly distributed Byzantine faults

0 signed · 32 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.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1002/net.3230220503openalex-snapshot
Reliable communication in networks with Byzantine link failures
inferredcites →https://doi.org/10.1002/net.3230230409openalex-snapshot
Fault—tolerant hypercube broadcasting via information dispersal
inferredcites →https://doi.org/10.1002/net.3230230807openalex-snapshot
Optimal communication in networks with randomly distributed byzantine faults
inferredcites →https://doi.org/10.1007/3-540-56939-1_88openalex-snapshot
Sparse networks supporting efficient reliable broadcasting
inferredcites →https://doi.org/10.1016/0020-0190(91)90105-qopenalex-snapshot
Broadcasting in a hypercube when some calls fail
inferredcites →https://doi.org/10.1016/0166-218x(88)90037-6openalex-snapshot
Broadcasting with random faults
inferredcites →https://doi.org/10.1109/12.9743openalex-snapshot
Reliable broadcast in hypercube multicomputers
inferredcites →https://doi.org/10.1109/ftcs.1991.146672openalex-snapshot
Optimal broadcasting in faulty hypercubes
inferredcites →https://doi.org/10.1137/0405015openalex-snapshot
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
inferredcites →https://doi.org/10.1145/73007.73031openalex-snapshot
Fast computation using faulty hypercubes
inferredcites →https://doi.org/10.21236/ada211910openalex-snapshot
Fast Computation Using Faulty Hypercubes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-62559-3_27openalex-snapshot
Independent spanning trees of product graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_8openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1007/bfb0027789openalex-snapshot
Broadcasting in star graphs with Byzantine failures
inferred← citeshttps://doi.org/10.1007/bfb0045110openalex-snapshot
Independent spanning trees of chordal rings
inferred← citeshttps://doi.org/10.1007/s00453-011-9543-0openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.10.007openalex-snapshot
Broadcasting with locally bounded Byzantine faults
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.09.002openalex-snapshot
Independent spanning trees on twisted cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.031openalex-snapshot
Feasibility and complexity of broadcasting with random transmission failures
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.020openalex-snapshot
An algorithm to construct independent spanning trees on parity cubes
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00205-1openalex-snapshot
Independent spanning trees of chordal rings
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00100-5openalex-snapshot
Reliable broadcasting in product networks
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)32382-0openalex-snapshot
Fast Broadcasting with Byzantine Faults
inferred← citeshttps://doi.org/10.1109/csae.2011.5952464openalex-snapshot
Construction of independent spanning trees on twisted-cubes
inferred← citeshttps://doi.org/10.1109/ftcs.1996.534612openalex-snapshot
Reliable broadcasting in product networks with Byzantine faults
inferred← citeshttps://doi.org/10.1109/icisce.2015.21openalex-snapshot
A Parallel Algorithm to Construct BISTs on Parity Cubes
inferred← citeshttps://doi.org/10.1109/ispan.1997.645139openalex-snapshot
Reliable broadcasting and secure distributing in channel networks
inferred← citeshttps://doi.org/10.1109/paap.2011.59openalex-snapshot
An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes
inferred← citeshttps://doi.org/10.1142/s0129054106004492openalex-snapshot
FAST BROADCASTING WITH BYZANTINE FAULTS
inferred← citeshttps://doi.org/10.1142/s0129626406002496openalex-snapshot
VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS
inferred← citeshttps://doi.org/10.1145/1073814.1073879openalex-snapshot
Feasibility and complexity of broadcasting with random transmission failures
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.