On the public citation graph
Hierarchical interconnection networks with folded hypercubes as basic clusters
0 signed · 18 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/0743-7315(91)90131-ropenalex-snapshot
On hypercube-based hierarchical interconnection network design
inferredcites →https://doi.org/10.1109/12.53600openalex-snapshot
Hierarchical interconnection networks for multicomputer systems
inferredcites →https://doi.org/10.1109/71.243525openalex-snapshot
The hyper-deBruijn networks: scalable versatile architecture
inferredcites →https://doi.org/10.1109/71.250115openalex-snapshot
dBCube: a new class of hierarchical multiprocessor interconnection networks with area efficient layout
inferredcites →https://doi.org/10.1109/71.262585openalex-snapshot
The hierarchical hypercube: a new interconnection topology for massively parallel systems
inferredcites →https://doi.org/10.1109/71.395400openalex-snapshot
Algorithms and properties of a new two-level network with folded hypercubes as basic modules
inferredcites →https://doi.org/10.1109/71.80187openalex-snapshot
Properties and performance of folded 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/s11227-023-05095-5openalex-snapshot
Embedding hierarchical folded cubes into linear arrays and complete binary trees with minimum wirelength
inferred← citeshttps://doi.org/10.1016/j.ins.2013.10.031openalex-snapshot
Reliability analysis and fault tolerance for hypercube multi-computer networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.01.004openalex-snapshot
Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.022openalex-snapshot
Fault tolerance analysis of hierarchical folded cube
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.001openalex-snapshot
Component conditional fault tolerance of hierarchical folded cubic networks
inferred← citeshttps://doi.org/10.1109/pacrim.2011.6032891openalex-snapshot
Performance comparison of hierarchical interconnection networks
inferred← citeshttps://doi.org/10.1155/2011/189434openalex-snapshot
Topological Properties of Hierarchical Interconnection Networks: A Review and Comparison
inferred← citeshttps://doi.org/10.2478/cait-2021-0003openalex-snapshot
Hierarchical Hexagon: A New Fault-Tolerant Interconnection Network for Parallel Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06497openalex-snapshot
Load-balanced Routing for Nested Interconnection Networks
inferred← citeshttps://doi.org/10.6109/jkiice.2014.18.6.1361openalex-snapshot
Embedding Algorithms Hypercube, HCN, and HFN into HFCube Interconnection Networks
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.