On the public citation graph
A new hierarchy of hypercube interconnection schemes for parallel computers
0 signed · 67 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/0378-4754(82)90063-5openalex-snapshot
Multiprocessors. A comparative study
inferredcites →https://doi.org/10.1016/0898-1221(78)90043-3openalex-snapshot
Combinatorial algorithms: Theory and practice
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/c-m.1981.220290openalex-snapshot
A Survey of Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1983.1676201openalex-snapshot
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.7907/15zs-9x82openalex-snapshot
The Tree Machine: A Highly Concurrent Computing Environment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_21openalex-snapshot
Hamiltonian Decomposition of Some Interconnection Networks
inferred← citeshttps://doi.org/10.1007/bfb0020494openalex-snapshot
A formal study of the Mcube interconnection network
inferred← citeshttps://doi.org/10.1007/s11227-008-0257-2openalex-snapshot
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube
inferred← citeshttps://doi.org/10.1016/0166-5316(91)90053-6openalex-snapshot
Performance analysis of a class of hierarchical hypercube multicomputer networks
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90054-oopenalex-snapshot
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90049-fopenalex-snapshot
Embedding shuffle networks in hypercubes
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90131-ropenalex-snapshot
On hypercube-based hierarchical interconnection network design
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2007.05.011openalex-snapshot
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.018openalex-snapshot
Geodesic pancyclicity and balanced pancyclicity of the generalized base- b hypercube
inferred← citeshttps://doi.org/10.1016/j.dam.2026.07.013openalex-snapshot
Subnetwork reliability analysis of generalized hypercube networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.004openalex-snapshot
Two spanning disjoint paths with required length in generalized hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.036openalex-snapshot
The h-restricted connectivity of the generalized hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.003openalex-snapshot
Reliability analysis of the generalized balanced hypercube
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115038openalex-snapshot
Super spanning connectivity of the generalized hypercube network
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)89285-xopenalex-snapshot
Task assignment in Cayley interconnection topologies
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00069-1openalex-snapshot
Ring, torus and hypercube architectures/algorithms for parallel computing
inferred← citeshttps://doi.org/10.1109/12.277296openalex-snapshot
The cost of broadcasting on star graphs and k-ary hypercubes
inferred← citeshttps://doi.org/10.1109/24.935021openalex-snapshot
Fault tolerance in the Block-Shift Network
inferred← citeshttps://doi.org/10.1109/71.113081openalex-snapshot
Extended hypercube: a hierarchical interconnection network of hypercubes
inferred← citeshttps://doi.org/10.1109/71.395400openalex-snapshot
Algorithms and properties of a new two-level network with folded hypercubes as basic modules
inferred← citeshttps://doi.org/10.1109/71.615435openalex-snapshot
Embedding hierarchical hypercube networks into the hypercube
inferred← citeshttps://doi.org/10.1109/71.615436openalex-snapshot
Fault diameter of k-ary n-cube networks
inferred← citeshttps://doi.org/10.1109/81.554320openalex-snapshot
Properties and performance of the block shift network
inferred← citeshttps://doi.org/10.1109/aispas.1997.581626openalex-snapshot
Design of high-performance massively parallel architectures under pin limitations and non-uniform propagation delay
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380472openalex-snapshot
Design and analysis of product networks
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750589openalex-snapshot
Efficient VLSI layouts of hypercubic networks
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750612openalex-snapshot
The priority broadcast scheme for dynamic broadcast in hypercubes and related networks
inferred← citeshttps://doi.org/10.1109/icpads.1996.517568openalex-snapshot
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors
inferred← citeshttps://doi.org/10.1109/icpads.1998.741094openalex-snapshot
An optimal routing scheme for multiple broadcast
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183371openalex-snapshot
TCN: scalable hierarchical hypercubes
inferred← citeshttps://doi.org/10.1109/icpp.2000.876069openalex-snapshot
Multilayer VLSI layout for interconnection networks
inferred← citeshttps://doi.org/10.1109/icpp.2001.952041openalex-snapshot
Parallel algorithms for index-permutation graphs. An extension of Cayley graphs for multiple chip-multiprocessors (MCMP)
inferred← citeshttps://doi.org/10.1109/icsmc.1999.816692openalex-snapshot
Simulated annealing and stochastic ruler algorithms for wavelength assignment planning in WDM optical networks
inferred← citeshttps://doi.org/10.1109/ipps.1993.262892openalex-snapshot
The connection cubes: symmetric, low diameter interconnection networks with low node degree
inferred← citeshttps://doi.org/10.1109/ipps.1995.395907openalex-snapshot
The Mcube: a symmetrical cube based network with twisted links
inferred← citeshttps://doi.org/10.1109/ipps.1997.580990openalex-snapshot
Cyclic networks: A family of versatile fixed-degree interconnection architectures
inferred← citeshttps://doi.org/10.1109/ipps.1999.760514openalex-snapshot
The recursive grid layout scheme for VLSI layout of hierarchical networks
inferred← citeshttps://doi.org/10.1109/ispan.1996.508966openalex-snapshot
Hierarchical swapped networks: efficient low-degree alternatives to hypercubes and generalized hypercubes
inferred← citeshttps://doi.org/10.1109/mwscas.1994.519244openalex-snapshot
Embedding hierarchical networks into the hypercube
inferred← citeshttps://doi.org/10.1109/paap.2011.19openalex-snapshot
Extended Folded Cube: A Improved Hierarchical Interconnection Network
inferred← citeshttps://doi.org/10.1109/spdp.1991.218288openalex-snapshot
Analysis of the modified even networks
inferred← citeshttps://doi.org/10.1109/spdp.1996.570368openalex-snapshot
Recursive hierarchical swapped networks: versatile interconnection architectures for highly parallel systems
inferred← citeshttps://doi.org/10.1142/s0129053397000088openalex-snapshot
Parallel Solution of Dense Linear Systems on the k-ary n-cube Networks
inferred← citeshttps://doi.org/10.1142/s0129053399000028openalex-snapshot
FAULT-TOLERANT CHARACTERISTICS AND TOPOLOGICAL PROPERTIES OF A HIERARCHICAL NETWORK OF HYPERCUBES
inferred← citeshttps://doi.org/10.1142/s0129054117500319openalex-snapshot
A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
inferred← citeshttps://doi.org/10.1145/224538.224572openalex-snapshot
Efficient embeddings into the hypercube using matrix transformations
inferred← citeshttps://doi.org/10.1145/76263.76310openalex-snapshot
The HCN: a versatile interconnection network based on cubes
inferred← citeshttps://doi.org/10.12677/csa.2017.79093openalex-snapshot
Domination Numbers for Generalized Base-b Hypercube Networks
inferred← citeshttps://doi.org/10.1504/ijcat.2012.046046openalex-snapshot
HPGRID: a new resource management architecture with its topological properties for massively parallel systems
inferred← citeshttps://doi.org/10.24200/squjs.vol3iss0pp41-45openalex-snapshot
Constructing Node-Disjoint Routes in K-Ary N-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.