On the public citation graph

Simulating binary trees on hypercubes

https://doi.org/10.1007/bfb0040385
0 signed · 65 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.1002/jgt.3190100110openalex-snapshot
One‐legged caterpillars span hypercubes
inferredcites →https://doi.org/10.1007/bfb0040388openalex-snapshot
Embedding grids into hypercubes
inferredcites →https://doi.org/10.1109/12.5991openalex-snapshot
On embedding rectangular grids in hypercubes
inferredcites →https://doi.org/10.1109/12.67319openalex-snapshot
Embedding rectangular grids into square grids
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.1145/62212.62229openalex-snapshot
Optimal simulations by Butterfly Networks
inferredcites →https://doi.org/10.21136/cpm.1974.117839openalex-snapshot
On cubes and dichotomic trees
inferredcites →https://doi.org/10.21136/cpm.1984.108506openalex-snapshot
On Hamiltonian circuits and spanning trees of hypercubes
inferredcites →https://doi.org/10.21236/ada200780openalex-snapshot
Optimal Simulations by Butterfly Networks

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199901)33:1<71::aid-net5>3.0.co;2-3openalex-snapshot
Small congestion embedding of graphs into hypercubes
inferred← citeshttps://doi.org/10.1002/jgt.20128openalex-snapshot
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
inferred← citeshttps://doi.org/10.1002/net.3230240604openalex-snapshot
Compressing grids into small hypercubes
inferred← citeshttps://doi.org/10.1006/jagm.2002.1217openalex-snapshot
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
inferred← citeshttps://doi.org/10.1006/jagm.2002.1218openalex-snapshot
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0073openalex-snapshot
Embedding Large Complete Binary Trees in Hypercubes with Load Balancing
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1734openalex-snapshot
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_46openalex-snapshot
Is the shuffle-exchange better than the butterfly?
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_68openalex-snapshot
Optimal specified root embedding of full binary trees in faulty hypercubes
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_14openalex-snapshot
Embedding graphs with bounded treewidth into optimal hypercubes
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_29openalex-snapshot
A general method for efficient embeddings of graphs into optimal hypercubes
inferred← citeshttps://doi.org/10.1007/978-0-585-27268-9_8openalex-snapshot
A Unique Design of Fiber-Optic Interconnection Networks and Algorithms
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/978-94-009-2411-6_7openalex-snapshot
Bandwidth in Multigrids for Random Graphs
inferred← citeshttps://doi.org/10.1007/bf01301964openalex-snapshot
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group
inferred← citeshttps://doi.org/10.1007/bf01381720openalex-snapshot
Hypercube embedding heuristics: An evaluation
inferred← citeshttps://doi.org/10.1007/bfb0015237openalex-snapshot
Efficient use of parallel & distributed systems: From theory to practice
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/bfb0030119openalex-snapshot
Efficient dynamic embedding of arbitrary binary trees into hypercubes
inferred← citeshttps://doi.org/10.1007/s00224-001-1034-2openalex-snapshot
One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90046-yopenalex-snapshot
Lattice bandwidth of random graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00078-6openalex-snapshot
Embedding trees in recursive circulants
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00197-qopenalex-snapshot
On the k-ary hypercube
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0772-8.50008-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.007openalex-snapshot
Wirelength of hypercubes into certain trees
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.050openalex-snapshot
Spanning multi-paths in hypercubes
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.03.001openalex-snapshot
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00101-7openalex-snapshot
Embedding ladders and caterpillars into the hypercube
inferred← citeshttps://doi.org/10.1080/02286203.2007.11442408openalex-snapshot
Virtual Net: An Efficient Simulation for Parallel Computation
inferred← citeshttps://doi.org/10.1093/comjnl/46.6.632openalex-snapshot
Efficient Embeddings into Hypercube-like Topologies
inferred← citeshttps://doi.org/10.1109/12.250605openalex-snapshot
Near embeddings of hypercubes into Cayley graphs on the symmetric group
inferred← citeshttps://doi.org/10.1109/12.485371openalex-snapshot
Embedding star networks into hypercubes
inferred← citeshttps://doi.org/10.1109/12.494105openalex-snapshot
Embedding an arbitrary binary tree into the star graph
inferred← citeshttps://doi.org/10.1109/71.372776openalex-snapshot
Optimal simulation of full binary trees on faulty hypercubes
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633091openalex-snapshot
Efficient Algorithms for Scheduling Tasks on Hypercubes
inferred← citeshttps://doi.org/10.1109/hicss.1995.375503openalex-snapshot
Embedding hypercubes into pancake, cycle prefix and substring reversal networks
inferred← citeshttps://doi.org/10.1109/hipc.1996.565815openalex-snapshot
Congestion-free dilation-2 embedding of full binary trees on star graphs
inferred← citeshttps://doi.org/10.1109/ipps.1994.288226openalex-snapshot
Efficient embedding K-ary complete trees into hypercubes
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367085openalex-snapshot
Problems on routing bounded distance assignments in hypercubes
inferred← citeshttps://doi.org/10.1109/parbse.1990.77112openalex-snapshot
Range search in parallel using distributed data structures
inferred← citeshttps://doi.org/10.1109/spdp.1991.218290openalex-snapshot
Embedding complete binary trees in faulty hypercubes
inferred← citeshttps://doi.org/10.1109/spdp.1991.218291openalex-snapshot
Embedding all binary trees in the hypercube
inferred← citeshttps://doi.org/10.1109/spdp.1992.242739openalex-snapshot
On embedding ternary trees into Boolean hypercubes
inferred← citeshttps://doi.org/10.1109/ssst.1996.493541openalex-snapshot
Near-optimal embeddings of trees into Fibonacci cubes
inferred← citeshttps://doi.org/10.1137/0219038openalex-snapshot
Embedding Trees in a Hypercube is NP-Complete
inferred← citeshttps://doi.org/10.1137/0221012openalex-snapshot
Efficient Embeddings of Trees in Hypercubes
inferred← citeshttps://doi.org/10.1142/s0219265923500317openalex-snapshot
Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis
inferred← citeshttps://doi.org/10.1145/113379.113393openalex-snapshot
Simulating binary trees on X-trees (extended abstract)
inferred← citeshttps://doi.org/10.1155/1994/63707openalex-snapshot
Area Optimization of Slicing Floorplans in Parallel
inferred← citeshttps://doi.org/10.2316/journal.205.2007.2.205-4369openalex-snapshot
VIRTUAL NET: AN EFFICIENT SIMULATION FOR PARALLEL COMPUTATION
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5277openalex-snapshot
Parallel and Distributed Algorithms for a Class of Graph-Related Computational Problems.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5510openalex-snapshot
High Performance Software Reconfiguration in the Context of Distributed Systems and Interconnection Networks.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5554openalex-snapshot
Interconnection Networks Embeddings and Efficient Parallel Computations.
inferred← citeshttps://doi.org/10.4236/am.2010.16065openalex-snapshot
On Embedding of m-Sequential k-ary Trees into Hypercubes
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.