Space and Time Hierarchies for Classes of Control Structures and Data Structures
Journal of the ACM (JACM)
Encoding Data Structures in Trees
Journal of the ACM (JACM)
Preserving average proximity in arrays
Communications of the ACM
Introduction to VLSI Systems
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Issues in the Study of Graph Embeddings
WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
IEEE Transactions on Computers
Virtual Net: an efficient simulation for parallel computation
International Journal of Modelling and Simulation
Predicting application performance using supervised learning on communication features
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 14.98 |
The main results in this paper demonstrate that there exist pairs of integers (for "area Expansion" and "edge Dilation," respectively) such that any n-vertex rectangular grid can be embedded into a square grid having at most En vertices, in such a way that images in the square grid of vertices that are adjacent in the rectangular grid are at most distance D apart. Several techniques for "sq