Parallel Computing in Paderborn: The SFB 376 cMassive Parallelism 4 Algorithms, Design Methods, Applicationsd
F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.

Routing on Networks of Optical Crossbars (Extended Abstract).
F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.

Contention Resolution in Hashing Based Shared Memory Simulations
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.

A lower bound for randomized algebraic decision trees
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.

A Realistic Cost Model for the Communication Time in Parallel Programs
M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.

Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.

A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware
M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität Paderborn, 1996.

Universal routing strategies
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.

Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.

Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.