Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dilation d embedding of a hyper-pyramid into a hypercube
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Embedding meshes on the star graph
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Placement of the Processors of a Hypercube
IEEE Transactions on Computers
Embedding Rectangular Grids Into Square Grids
IEEE Transactions on Computers
Embedding Complete Binary Trees Into Butterfly Networks
IEEE Transactions on Computers
An algebraic theory for modeling direct interconnection networks
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Embedding hyperpyramids into hypercubes
IBM Journal of Research and Development
Optimal Simulation of Full Binary Trees on Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Efficient embeddings into the hypercube using matrix transformations
ICS '95 Proceedings of the 9th international conference on Supercomputing
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Embedding Hierarchical Hypercube Networks into the Hypercube
IEEE Transactions on Parallel and Distributed Systems
On Embedding Between 2D Meshes of the Same Size
IEEE Transactions on Computers
Contention-Free 2D-Mesh Cluster Allocation in Hypercubes
IEEE Transactions on Computers
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Optimal Processor Assignment for a Class of Pipelined Computations
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On Embedding Various Networks into the Hypercube Using Matrix Transformations
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient embeddings of ternary trees into hypercubes
Journal of Parallel and Distributed Computing
ACO for Solving the Distributed Allocation of a Corporate Semantic Web
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Performance effects of node mappings on the IBM bluegene/l machine
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 15.00 |
The following graph-embedding question is addressed: given a two-dimensional grid and the smallest hypercube with at least as many nodes as grid points, how can one assign grid points to hypercube nodes (with at most one grid point per node) so as to keep grid neighbors near each other in the cube? An embedding scheme for an infinite class of two-dimensional grids is given that keeps grid neighbors within a distance of two apart.