The construction of interconnection networks which allow a fast dissemination of information between the nodes is one main issue in parallel computing. Algebraic methods and techniques can be used for the construction and analysis of network topologies.  
This project was finished on 31.3.1998.

A special focus of this research is on topologies with as many as possible nodes for a given diameter and a given degree.

• Michael Sampels:
  Algebraic Constructions of Efficient Systolic Architectures.
  Proceedings of the 2nd International Conference on Massively Parallel Computing Systems (MPCS ´96), pp. 15-22. IEEE Computer Society Press, 1996.
• Michael Sampels:
  Cayley Graphs as Interconnection Networks: A Case Study.
  Proceedings of the 7th International Workshop on Parallel Processing by Cellular Automata and Arrays (PARCELLA ´96), pp. 67-76. Akademie-Verlag, 1996.
• Michael Sampels, Stefan Schöf:
  Massively Parallel Architectures for Parallel Discrete Event Simulation.
  Proceedings of the 8th European Simulation Symposium (ESS ´96), vol. 2, pp. 374-378. SCS, 1996.
• Michael Sampels:
  Massively Parallel Architectures and Systolic Communication.
  Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP ´97), pp. 322-329. IEEE Computer Society Press, 1997.
• Michael Sampels:
  Large Networks with Small Diameter.
  Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG ´97), Lecture Notes in Computer Science 1335, pp. 288-302. Springer-Verlag, 1997.
• Michael Sampels:
  Represenation of Vertex-Symmetric Interconnection Networks.
  Proceedings of the 2nd International Conference on Parallel Processing & Applied Mathematics (PPAM ´97), vol. 1, pp. 226-237. PCz IMI, 1997.
• Michael Sampels:
  Algebraische Konstruktion effizienter Verbindungsnetzwerke.
  Dissertation, Logos-Verlag Berlin, 1998, ISBN 3-89722-051-2.