On the public citation graph
A class of fault-tolerant multiprocessor networks
0 signed · 35 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/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9780511816239openalex-snapshot
Switching and Finite Automata Theory
inferredcites →https://doi.org/10.1109/24.24569openalex-snapshot
A class of fault-tolerant multiprocessor networks
inferredcites →https://doi.org/10.1109/pgec.1967.264748openalex-snapshot
On the Connection Assignment Problem of Diagnosable Systems
inferredcites →https://doi.org/10.1109/t-c.1974.223782openalex-snapshot
Characterization of Connection Assignment of Diagnosable Systems
inferredcites →https://doi.org/10.1109/tc.1981.1675777openalex-snapshot
Analysis of Chordal Ring Network
inferredcites →https://doi.org/10.1109/tc.1983.1676331openalex-snapshot
Mesh-Connected Computers with Broadcasting
inferredcites →https://doi.org/10.1109/tc.1985.1676608openalex-snapshot
A Regular Fault-Tolerant Architecture for Interconnection Networks
inferredcites →https://doi.org/10.1145/800053.801905openalex-snapshot
Distributed fault-tolerance for large multiprocessor systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00453-016-0210-3openalex-snapshot
Random and Conditional (t, k)-Diagnosis of Hypercubes
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90128-wopenalex-snapshot
Stirling networks: a versatile combinatorial topology for multiprocessor systems
inferred← citeshttps://doi.org/10.1016/j.ins.2011.02.012openalex-snapshot
Independent spanning trees on even networks
inferred← citeshttps://doi.org/10.1080/00207160903501925openalex-snapshot
A note on embeddings among folded hypercubes, even graphs and odd graphs
inferred← citeshttps://doi.org/10.1109/24.103002openalex-snapshot
Partitioning of even networks for improved diagnosability (multiprocessor systems)
inferred← citeshttps://doi.org/10.1109/24.46474openalex-snapshot
Performability of the hypercube (reliability)
inferred← citeshttps://doi.org/10.1109/pdgc.2014.7030740openalex-snapshot
Fault tolerance for hypercube networks via independent spanning trees
inferred← citeshttps://doi.org/10.1109/sicon.1993.515675openalex-snapshot
Multicasting on certain self-similar networks
inferred← citeshttps://doi.org/10.1109/spdp.1991.218288openalex-snapshot
Analysis of the modified even networks
inferred← citeshttps://doi.org/10.1109/tdsc.2016.2562620openalex-snapshot
Conditional Diagnosability of $(n,k)$ -Star Graphs Under the PMC Model
inferred← citeshttps://doi.org/10.1109/tpds.2013.290openalex-snapshot
Structural Properties and Conditional Diagnosability of Star Graphs by Using the PMC Model
inferred← citeshttps://doi.org/10.1109/tr.2009.2020101openalex-snapshot
Comments on “A Class of Fault-Tolerant Multiprocessor Networks”
inferred← citeshttps://doi.org/10.1109/tr.2011.2170105openalex-snapshot
Strong Diagnosability and Conditional Diagnosability of Augmented Cubes Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tr.2013.2284743openalex-snapshot
A Scalable Comparison-Based Diagnosis Algorithm for Hypercube-Like Networks
inferred← citeshttps://doi.org/10.1142/s0219265916500092openalex-snapshot
Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Systems Based on the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1145/166237.166261openalex-snapshot
Linear recursive networks and their applications in topological design and data routing
inferred← citeshttps://doi.org/10.1145/167954.166261openalex-snapshot
Linear recursive networks and their applications in topological design and data routing
inferred← citeshttps://doi.org/10.1145/2348839.2348850openalex-snapshot
Conditional Diagnosability of k-Ary n-Cubes under the PMC Model
inferred← citeshttps://doi.org/10.1145/2699854openalex-snapshot
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model
inferred← citeshttps://doi.org/10.3745/kipsta.2010.17a.3.113openalex-snapshot
Constructing Algorithm of Edge-Disjoint Spanning Trees in Even Interconnection Network Ed
inferred← citeshttps://doi.org/10.4218/etrij.08.0208.0272openalex-snapshot
One-to-All Broadcasting of Odd Networks for One-Port and All-Port Models
inferred← citeshttps://doi.org/10.4218/etrij.09.0208.0404openalex-snapshot
One-to-All Broadcasting of Even Networks for One-Port and All-Port Models
showing the first 23 of 24 · page through all 24
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.