Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks

This publication has 20 references indexed in Scilit:

• Better expansion for Ramanujan graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Asymptotically tight bounds for computing with faulty arrays of processors
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The Monarch parallel processor hardware design
  Computer, 1990
• Technologies for low latency interconnection switches
  Published by Association for Computing Machinery (ACM) ,1989
• Fast computation using faulty hypercubes
  Published by Association for Computing Machinery (ACM) ,1989
• Fault Tolerance in Networks of Bounded Degree
  SIAM Journal on Computing, 1988
• Increasing the size of a network by a constant factor can increase performance by more than a constant factor
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• A unified theory of interconnection network structure
  Theoretical Computer Science, 1986
• Tight Bounds on the Complexity of Parallel Sorting
  IEEE Transactions on Computers, 1985
• The Performance of Multistage Interconnection Networks for Multiprocessors
  IEEE Transactions on Computers, 1983