A. Wachsmann, Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher, vol. 6. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19630

F. Ameur, Space-Bounded Learning Algorithms, vol. 10. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19634

A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating shared memory in real time: On the computation power of reconfigurable meshes,” in Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat: /record/17482

F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.
LibreCat: /record/2207

F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.
LibreCat: /record/2208

D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” Information Processing Letters, pp. 103–110, 1995.
LibreCat: /record/16566
DOI: 10.1016/s0020-0190(97)00032-x

F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in STACS 95, Berlin, Heidelberg, 1995.
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between size and slowdown for universal parallel networks,” in Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95, 1995.
LibreCat: /record/16706
DOI: 10.1145/215399.215430

A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,”10.1109/istcs.1995.377051__1995, doi:10.1109/istcs.1995.377051 .
LibreCat: /record/16707
DOI: 10.1109/istcs.1995.377051

F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

R. Wanka, Paralleles Sortieren auf mehrdimensionalen Gittern. Universität Paderborn, 1994.
LibreCat: /record/19624

M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, pp. 738–761, 1994.
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.
LibreCat: /record/17477
DOI: 10.1007/3-540-56731-3

U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report),” in Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat: /record/17479

M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” Information and Computation, pp. 196–217, 1993.
LibreCat: /record/16729
DOI: 10.1006/inco.1993.1007

F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory simulations,” in Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93, 1993.
LibreCat: /record/16731
DOI: 10.1145/165231.165246