On the area of hypercube layouts

[1]  Koji Nakano.  Linear Layouts of Generalized Hypercubes , 1993, WG.

[2]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[3]  L. H. Harper.  Optimal Assignments of Numbers to Vertices , 1964 .

[4]  Hans Jürgen Schneider,et al.  Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science , 1987 .

[5]  L. H. Harper,et al.  Embedding of Hypercubes into Grids , 1998, MFCS.

[6]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[7]  A. Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[8]  Ronald I. Greenberg,et al.  An Empirical Comparison of Area-Universal and Other Parallel Computing Networks , 1996 .

[9]  Ronald I. Greenberg,et al.  An Empirical Comparison of Networks and Routing Strategies for Parallel Computation , 1996 .

[10]  Dharma P. Agrawal,et al.  dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout , 1993, IEEE Trans. Parallel Distributed Syst..

[11]  Krishnan Padmanabhan,et al.  Performance of Multicomputer Networks under Pin-out Constraints , 1991, J. Parallel Distributed Comput..

[12]  L. H. Harper.  Optimal numberings and isoperimetric problems on graphs , 1966 .

[13]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[14]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[15]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[16]  S. Lennart Johnsson,et al.  The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton , 1987, ICPP.

[17]  L. H. Harper,et al.  The congestion of n-cube layout on a rectangular grid , 2000, Discret. Math..