Transforming comparison model lower bounds to the parallel-random-access-machine
D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.

The constrained Liapunov-Schmidt procedure and periodic orbits
M. Golubitsky, J. Marsden, I. Stewart, M. Dellnitz, in: Normal Forms and Homoclinic Chaos, Providence, Rhode Island, 1995.

A packet routing protocol for arbitrary networks
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.

Shared memory simulations with triple-logarithmic delay
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.

Optimal trade-offs between size and slowdown for universal parallel networks
F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.

Improved optimal shared memory simulations, and the power of reconfiguration
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.

Hot-potato routing on multi-dimensional tori
F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.

Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.

Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation
M. Platzner, B. Rinner, R. Weiss, J.UCS Journal of Universal Computer Science 12 (1995) 811–820.

Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition
C. Dugast, P. Beyerlein, R. Haeb-Umbach, in: ICASSP, Detroit, 1995.