On the public citation graph

https://doi.org/10.2139/ssrn.4140150

0 signed · 34 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.1006/jpdc.2001.1813openalex-extracted
Fault-Tolerant Hamiltonicity of Twisted Cubes
inferredcites →https://doi.org/10.1007/b116777openalex-extracted
Introduction to Parallel Processing: Algorithms and Architectures
inferredcites →https://doi.org/10.1007/bf02948839openalex-extracted
An optimal multicast algorithm for cube-connected cycles
inferredcites →https://doi.org/10.1007/s11227-017-2033-7openalex-extracted
Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks
inferredcites →https://doi.org/10.1007/s11227-017-2186-4openalex-extracted
The hierarchical Petersen network: a new interconnection network with fixed degree
inferredcites →https://doi.org/10.1016/j.amc.2018.04.054openalex-extracted
The g-extra connectivity and diagnosability of crossed cubes
inferredcites →https://doi.org/10.1016/j.ins.2017.11.047openalex-extracted
Structure connectivity and substructure connectivity of k-ary n-cube networks
inferredcites →https://doi.org/10.1016/j.tcs.2016.04.014openalex-extracted
Structure connectivity and substructure connectivity of hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2017.10.032openalex-extracted
Structure fault tolerance of hypercubes and folded hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2018.09.028openalex-extracted
RVCCC: A new variational network of cube-connected cycles and its topological properties
inferredcites →https://doi.org/10.1016/j.tcs.2019.03.030openalex-extracted
The h-extra connectivity of k-ary n-cubes
inferredcites →https://doi.org/10.1016/j.tcs.2019.09.007openalex-extracted
Structure connectivity and substructure connectivity of twisted hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2020.04.014openalex-extracted
Structure connectivity and substructure connectivity of the crossed cube
inferredcites →https://doi.org/10.1016/s0020-0190(97)00013-6openalex-extracted
The diameter of the cube-connected cycles
inferredcites →https://doi.org/10.1016/s0020-0255(98)10045-2openalex-extracted
Topological properties of twisted cube
inferredcites →https://doi.org/10.1023/a:1008018024210openalex-extracted
Sep: A Fixed Degree Regular Network for Massively Parallel Systems
inferredcites →https://doi.org/10.1109/12.204798openalex-extracted
A cube-connected cycles architecture with high reliability and improved performance
inferredcites →https://doi.org/10.1109/12.324546openalex-extracted
Embedding cube-connected cycles graphs into faulty hypercubes
inferredcites →https://doi.org/10.1109/12.53599openalex-extracted
Performance analysis of k-ary n-cube interconnection networks
inferredcites →https://doi.org/10.1109/12.67315openalex-extracted
An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
inferredcites →https://doi.org/10.1109/71.246078openalex-extracted
Optimal routing algorithm and the diameter of the cube-connected cycles
inferredcites →https://doi.org/10.1109/71.262585openalex-extracted
The hierarchical hypercube: a new interconnection topology for massively parallel systems
inferredcites →https://doi.org/10.1109/71.481595openalex-extracted
A new family of Cayley graph interconnection networks of constant degree four
inferredcites →https://doi.org/10.1109/71.615436openalex-extracted
Fault diameter of k-ary n-cube networks
inferredcites →https://doi.org/10.1109/71.737700openalex-extracted
Cyclic-cubes: a new family of interconnection networks of even fixed-degrees
inferredcites →https://doi.org/10.1109/71.80187openalex-extracted
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1109/icdcs.2015.62openalex-extracted
ABCCC: An Advanced Cube Based Network for Data Centers
inferredcites →https://doi.org/10.1109/sfcs.1979.43openalex-extracted
The cube-connected-cycles: A versatile network for parallel computation
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-extracted
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1109/tpds.2015.2511725openalex-extracted
GBC3: A Versatile Cube-Based Server-Centric Network for Data Centers
inferredcites →https://doi.org/10.1109/tpds.2016.2609428openalex-extracted
ExCCC-DCN: A Highly Scalable, Cost-Effective and Energy-Efficient Data Center Structure
inferredcites →https://doi.org/10.1109/tpds.2019.2941207openalex-extracted
A Novel Low Cost Interconnection Architecture Based on the Generalized Hypercube
inferredcites →https://doi.org/10.1145/330560.330970openalex-extracted
Performance evaluation of probabilistic tree embedding in cube-connected cycles
inferredcites →https://doi.org/10.1145/358645.358660openalex-extracted
The cube-connected cycles: a versatile network for parallel computation
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.