On the public citation graph

Embedding grids into hypercubes

https://doi.org/10.1007/bfb0040388
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.
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.1007/bfb0040386openalex-snapshot
Embedding rectangular grids into square grids
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1109/12.5991openalex-snapshot
On embedding rectangular grids in hypercubes
inferredcites →https://doi.org/10.1109/sfcs.1986.38openalex-snapshot
Optimal simulations of tree machines
inferredcites →https://doi.org/10.1109/tc.1982.1676109openalex-snapshot
On Embedding Rectangular Grids in Square Grids
inferredcites →https://doi.org/10.1137/0214013openalex-snapshot
Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
inferredcites →https://doi.org/10.1145/28395.28425openalex-snapshot
Reconfiguring a hypercube in the presence of faults
inferredcites →https://doi.org/10.1145/4221.4228openalex-snapshot
A polynomial algorithm for the min-cut linear arrangement of trees

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230240604openalex-snapshot
Compressing grids into small hypercubes
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1092openalex-snapshot
Multiple Network Embeddings into Hypercubes
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_28openalex-snapshot
Optimum simulation of meshes by small hypercubes
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_42openalex-snapshot
Embeddings of treelike graphs into 2-dimensional meshes
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_8openalex-snapshot
Embedding 3-dimensional grids into optimal hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_13openalex-snapshot
Embedding one Interconnection Network in Another
inferred← citeshttps://doi.org/10.1007/bf01381720openalex-snapshot
Hypercube embedding heuristics: An evaluation
inferred← citeshttps://doi.org/10.1007/bfb0017137openalex-snapshot
Comparing interconnection networks
inferred← citeshttps://doi.org/10.1007/bfb0023817openalex-snapshot
Simulating permutation networks on hypercubes
inferred← citeshttps://doi.org/10.1007/bfb0040385openalex-snapshot
Simulating binary trees on hypercubes
inferred← citeshttps://doi.org/10.1007/bfb0040386openalex-snapshot
Embedding rectangular grids into square grids
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90001-nopenalex-snapshot
Load balanced tree embeddings
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90131-8openalex-snapshot
Embedding meshes in Boolean cubes by graph decomposition
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00064-6openalex-snapshot
Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees
inferred← citeshttps://doi.org/10.1080/00207169808804707openalex-snapshot
Embedding meshes in hypercubes with edge faults
inferred← citeshttps://doi.org/10.1109/12.67319openalex-snapshot
Embedding rectangular grids into square grids
inferred← citeshttps://doi.org/10.1109/12.83623openalex-snapshot
Embedding complete binary trees into butterfly networks
inferred← citeshttps://doi.org/10.1109/71.238627openalex-snapshot
A parallel algorithm for an efficient mapping of grids in hypercubes
inferred← citeshttps://doi.org/10.1109/71.308535openalex-snapshot
E-kernel: an embedding kernel on the IBM victor V256 multiprocessor for program mapping and network reconfiguration
inferred← citeshttps://doi.org/10.1109/dmcc.1990.556398openalex-snapshot
Embedding Meshes into Small Boolean Cubes
inferred← citeshttps://doi.org/10.1109/dmcc.1990.556400openalex-snapshot
Multiple Network Embedding into Hybercubes
inferred← citeshttps://doi.org/10.1109/ipps.1993.262820openalex-snapshot
Hypersphere Mapper: a nonlinear programming approach to the hypercube embedding problem
inferred← citeshttps://doi.org/10.1109/spdp.1990.143662openalex-snapshot
The embedding kernel on the IBM victor multiprocessor for program mapping and network reconfiguration
inferred← citeshttps://doi.org/10.1145/72935.72941openalex-snapshot
Embedding of d -dimensional grids into optimal hypercubes
inferred← citeshttps://doi.org/10.1145/76263.76295openalex-snapshot
Dilation d embedding of a hyper-pyramid into a hypercube
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5252openalex-snapshot
Parallel Computation on Hypercube-Like Machines.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5642openalex-snapshot
Embedding Schemes for 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.