Meyer auf der Heide, F., &; Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
LibreCat: /record/2184

Cypher, R., Meyer auf der Heide, F., Scheideler, C., &; Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.
LibreCat: /record/2186

Ameur, F., Fischer, P., Höffgen, K.-U., &; Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. Acta Informatica, 621–630.https://doi.org/10.1007/bf03036467 
LibreCat: /record/16698
DOI: 10.1007/bf03036467

Meyer auf der Heide, F., Oesterdiekhoff, B., &; Wanka, R. (1996). Strongly adaptive token distribution. Algorithmica, 413–427.https://doi.org/10.1007/bf01955042 
LibreCat: /record/16699
DOI: 10.1007/bf01955042

Karp, R. M., Luby, M., &; Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542.https://doi.org/10.1007/bf01940878 
LibreCat: /record/16700
DOI: 10.1007/bf01940878

Gil, J., Meyer auf der Heide, F., &; Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955.https://doi.org/10.1137/s0097539793255722 
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

Meyer auf der Heide, F., &; Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICAL. Berlin, Heidelberg.https://doi.org/10.1007/3-540-61440-0 
LibreCat: /record/16702
DOI: 10.1007/3-540-61440-0

Berenbrink, P., Meyer auf der Heide, F., &; Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60922-9_16 
LibreCat: /record/16703
DOI: 10.1007/3-540-60922-9_16

Stemann, V. (1995). Contention Resolution in Hashing Based Shared Memory Simulations (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19623

Czumaj, A. (1995). Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19627

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

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

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

Meyer auf der Heide, F., &; Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354).https://doi.org/10.1007/3-540-60313-1_154 
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

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

Meyer auf der Heide, F., Scheideler, C., &; Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).
LibreCat: /record/2208

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

Meyer auf der Heide, F., &; Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg.https://doi.org/10.1007/3-540-59042-0_81 
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60313-1_133 
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Meyer auf der Heide, F., Storch, M., &; Wanka, R. (1995). 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.https://doi.org/10.1145/215399.215430 
LibreCat: /record/16706
DOI: 10.1145/215399.215430

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. Proceedings Third Israel Symposium on the Theory of Computing and Systems.https://doi.org/10.1109/istcs.1995.377051 
LibreCat: /record/16707
DOI: 10.1109/istcs.1995.377051

Meyer auf der Heide, F., &; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60618-1_77 
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

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

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

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

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

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

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. Information and Computation, 196–217.https://doi.org/10.1006/inco.1993.1007 
LibreCat: /record/16729
DOI: 10.1006/inco.1993.1007

Meyer auf der Heide, F., Oesterdiekhoff, B., &; Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56939-1_89 
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93.https://doi.org/10.1145/165231.165246 
LibreCat: /record/16731
DOI: 10.1145/165231.165246

Lürwer-Brüggemeier, K., &; Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56503-5_46 
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

Kutylowski, M., &; Wanka, R. (1992). Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2, 213–220.https://doi.org/10.1142/s0129626492000349 
LibreCat: /record/18936
DOI: 10.1142/s0129626492000349

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg.https://doi.org/10.1007/3-540-55488-2_31 
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56731-3_3 
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

Meyer auf der Heide, F., &; Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg.https://doi.org/10.1007/3-540-55210-3_176 
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Karp, R. M., Luby, M., &; Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92.https://doi.org/10.1145/129712.129743 
LibreCat: /record/16736
DOI: 10.1145/129712.129743

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden.https://doi.org/10.1007/978-3-322-95233-2_7 
LibreCat: /record/16737
DOI: 10.1007/978-3-322-95233-2_7

Alt, H., Blömer, J., &; Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag.https://doi.org/10.1007/bfb0032068 
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg.https://doi.org/10.1007/bfb0032018 
LibreCat: /record/16738
DOI: 10.1007/bfb0032018

Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg.https://doi.org/10.1007/bfb0029597 
LibreCat: /record/16739
DOI: 10.1007/bfb0029597

Karpinski, M., &; Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg.https://doi.org/10.1007/bfb0029630 
LibreCat: /record/16740
DOI: 10.1007/bfb0029630

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90.https://doi.org/10.1145/100216.100229 
LibreCat: /record/16741
DOI: 10.1145/100216.100229

Gil, J., Meyer auf der Heide, F., &; Wigderson, A. (1990). Not all keys can be hashed in constant time. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90.https://doi.org/10.1145/100216.100247 
LibreCat: /record/16742
DOI: 10.1145/100216.100247

Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4), 231–232.
LibreCat: /record/16824

Just, B., Meyer auf der Heide, F., &; Wigderson, A. (1989). On computations with integer division. RAIRO - Theoretical Informatics and Applications, 101–111.https://doi.org/10.1051/ita/1989230101011 
LibreCat: /record/16743
DOI: 10.1051/ita/1989230101011

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89.https://doi.org/10.1145/72935.72974 
LibreCat: /record/16744
DOI: 10.1145/72935.72974

Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In STACS 89. Berlin/Heidelberg.https://doi.org/10.1007/bfb0028969 
LibreCat: /record/16745
DOI: 10.1007/bfb0028969

Meyer auf der Heide, F., &; Wanka, R. (1989). Time-optimal simulations of networks by universal parallel computers. In STACS 89. Berlin/Heidelberg.https://doi.org/10.1007/bfb0028978 
LibreCat: /record/16746
DOI: 10.1007/bfb0028978

Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In STACS 89. Berlin, Heidelberg.https://doi.org/10.1007/bfb0028983 
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

Babai, L., Just, B., &; Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. Information and Computation, 99–107.https://doi.org/10.1016/0890-5401(88)90031-4 
LibreCat: /record/16763
DOI: 10.1016/0890-5401(88)90031-4