Topological Properties of Interconnection Networks

[1]  Julio Solano-González,et al.  Higher dimensional hexagonal networks , 2003, J. Parallel Distributed Comput..

[2]  Ivan Stojmenovic,et al.  Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[3]  Ivan Stojmenovic,et al.  Higher Dimensional Honeycomb Networks , 2001, J. Interconnect. Networks.

[4]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[5]  Ivan Stojmenovic,et al.  Multiplicative Circulant Networks Topological Properties and Communication Algorithms , 1997, Discret. Appl. Math..

[6]  Kang G. Shin,et al.  Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package , 1997, J. Parallel Distributed Comput..

[7]  Jehoshua Bruck,et al.  Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares , 1993, IEEE Trans. Computers.

[8]  Ferrell S. Wheeler,et al.  Signed Digit Representations of Minimal Hamming Weight , 1993, IEEE Trans. Computers.

[9]  Ivan Stojmenovic,et al.  Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry , 1993, Networks.

[10]  Frank Harary,et al.  Subcube Fault-Tolerance in Hypercubes , 1993, Inf. Comput..

[11]  Ivan Stojmenovic.  Routing and Broadcasting on Incomplete and Gray Code Incomplete Hypercubes , 1993, Parallel Algorithms Appl..

[12]  Wen-Jing Hsu,et al.  Fibonacci Cubes-A New Interconnection Technology , 1993, IEEE Trans. Parallel Distributed Syst..

[13]  P. F. Corbett,et al.  Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks , 1992, IEEE Trans. Parallel Distributed Syst..

[14]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[15]  Lennart Johnson,et al.  Communication in network architectures , 1990 .

[16]  Arun K. Somani,et al.  An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

[17]  Ming-Syan Chen,et al.  Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors , 1990, IEEE Trans. Computers.

[18]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[19]  Amotz Bar-Noy,et al.  Square meshes are not always optimal , 1989, SPAA '89.

[20]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[21]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[22]  Bernd Becker,et al.  How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[23]  Arnold L. Rosenberg,et al.  Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[24]  Shmuel Zaks,et al.  A new algorithm for generation of permutations , 1984, BIT.

[25]  Alain J. Martin.  The Torus: An Exercise in Constructing a Processing Surface , 1982 .

[26]  H. T. Kung,et al.  On the Area of Binary Tree Layouts , 1980, Inf. Process. Lett..

[27]  C. Thompson.  Area-time complexity for VLSI , 1979, STOC 1979.

[28]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[29]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[30]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .