On the public citation graph

Efficient dynamic embedding of arbitrary binary trees into hypercubes

https://doi.org/10.1007/bfb0030119
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.1002/jgt.3190100110openalex-snapshot
One‐legged caterpillars span hypercubes
inferredcites →https://doi.org/10.1006/jagm.1996.0018openalex-snapshot
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
inferredcites →https://doi.org/10.1006/jpdc.1995.1010openalex-snapshot
Embedding K-ary Complete Trees into Hypercubes
inferredcites →https://doi.org/10.1006/jpdc.1996.0029openalex-snapshot
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes
inferredcites →https://doi.org/10.1007/3-540-60922-9_14openalex-snapshot
Embedding graphs with bounded treewidth into optimal hypercubes
inferredcites →https://doi.org/10.1007/3-540-61626-8_29openalex-snapshot
A general method for efficient embeddings of graphs into optimal hypercubes
inferredcites →https://doi.org/10.1007/978-3-642-82940-6_5openalex-snapshot
Hypercubes and Pyramids
inferredcites →https://doi.org/10.1007/bfb0040385openalex-snapshot
Simulating binary trees on hypercubes
inferredcites →https://doi.org/10.1016/0743-7315(85)90026-7openalex-snapshot
Embedding of tree networks into hypercubes
inferredcites →https://doi.org/10.1016/0743-7315(91)90046-copenalex-snapshot
Embedding mesh of trees in the hypercube
inferredcites →https://doi.org/10.1137/0220052openalex-snapshot
Embedding of Grids into Optimal Hypercubes
inferredcites →https://doi.org/10.1137/0221012openalex-snapshot
Efficient Embeddings of Trees in Hypercubes
inferredcites →https://doi.org/10.1137/0221039openalex-snapshot
Dynamic Tree Embeddings in Butterflies and Hypercubes
inferredcites →https://doi.org/10.1145/174130.174144openalex-snapshot
Taking random walks to grow trees in hypercubes
inferredcites →https://doi.org/10.1145/72935.72941openalex-snapshot
Embedding of d -dimensional grids into optimal hypercubes
inferredcites →https://doi.org/10.21136/cpm.1973.117800openalex-snapshot
Embedding the polytomic tree into the $n$-cube
inferredcites →https://doi.org/10.21136/cpm.1984.108506openalex-snapshot
On Hamiltonian circuits and spanning trees of hypercubes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.758openalex-snapshot
Performance evaluation of a random‐walk‐based algorithm for embedding dynamically evolving trees in hypercubic networks
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/jpdc.1998.1475openalex-snapshot
Lower Bounds for Dynamic Tree Embedding in Bipartite Networks
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-46632-0_5openalex-snapshot
Asynchronous Random Polling Dynamic Load Balancing
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.1016/j.jpdc.2010.05.003openalex-snapshot
Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
inferred← citeshttps://doi.org/10.1016/j.peva.2004.10.014openalex-snapshot
Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.033openalex-snapshot
Analysis of randomized load distribution for reproduction trees in linear arrays and rings
inferred← citeshttps://doi.org/10.1023/a:1027336712552openalex-snapshot
On the Performance of Randomized Embedding of Reproduction Trees in Static Networks
inferred← citeshttps://doi.org/10.1093/comjnl/45.5.561openalex-snapshot
Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
inferred← citeshttps://doi.org/10.1109/fcst.2009.74openalex-snapshot
A Random-Walk-Based Dynamic Tree Evolution Algorithm with Exponential Speed of Convergence to Optimality on Regular Networks
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750603openalex-snapshot
Asymptotically optimal probabilistic embedding algorithms for supporting tree structured computations in hypercubes
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016682openalex-snapshot
Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in butterflies
inferred← citeshttps://doi.org/10.1109/ipdps.2005.372openalex-snapshot
Rapidly Mixing Random Walks on Hypercubes with Application to Dynamic Tree Evolution
inferred← citeshttps://doi.org/10.1109/isit.2011.6033983openalex-snapshot
Network flows for functions
inferred← citeshttps://doi.org/10.1109/jsac.2013.130409openalex-snapshot
Network Flows for Function Computation
inferred← citeshttps://doi.org/10.1142/s0129054100000132openalex-snapshot
A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN 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.