Efficient VLSI layouts for homogeneous product networks

This publication has 16 references indexed in Scilit:

• A general framework for developing adaptive fault-tolerant routing algorithms
  IEEE Transactions on Reliability, 1993
• The hyper-deBruijn networks: scalable versatile architecture
  IEEE Transactions on Parallel and Distributed Systems, 1993
• Product-shuffle networks: toward reconciling shuffles and butterflies
  Discrete Applied Mathematics, 1992
• On the crossing number of the hypercube and the cube connected cycles
  Published by Springer Nature ,1992
• The banyan-hypercube networks
  IEEE Transactions on Parallel and Distributed Systems, 1990
• New lower bound techniques for VLSI
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981
• Universality considerations in VLSI circuits
  IEEE Transactions on Computers, 1981
• Area-efficient graph layouts
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1980
• A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
  Journal of Combinatorial Theory, Series B, 1972
• The crossing number of K5,n
  Journal of Combinatorial Theory, 1970