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

Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747.https://doi.org/10.1145/44483.44490 
LibreCat: /record/16764
DOI: 10.1145/44483.44490

Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &; Wigderson, A. (1988). A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science, 57–68.https://doi.org/10.1016/0304-3975(88)90018-7 
LibreCat: /record/16765
DOI: 10.1016/0304-3975(88)90018-7

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &; Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.https://doi.org/10.1109/sfcs.1988.21968 
LibreCat: /record/16766
DOI: 10.1109/sfcs.1988.21968

Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., &; Wigderson, A. (1988). On computations with integer division. In STACS 88. Berlin, Heidelberg.https://doi.org/10.1007/bfb0035829 
LibreCat: /record/16767
DOI: 10.1007/bfb0035829

Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., &; Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In SWAT 88. Berlin, Heidelberg.https://doi.org/10.1007/3-540-19487-8_24 
LibreCat: /record/16768
DOI: 10.1007/3-540-19487-8_24

Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &; Wigderson, A. (1987). A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 97–99.https://doi.org/10.1137/0216007 
LibreCat: /record/16772
DOI: 10.1137/0216007

Meyer auf der Heide, F., &; Wigderson, A. (1987). The Complexity of Parallel Sorting. SIAM Journal on Computing, 100–107.https://doi.org/10.1137/0216008 
LibreCat: /record/16773
DOI: 10.1137/0216008

Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing, 106–119.https://doi.org/10.1137/0215008 
LibreCat: /record/16771
DOI: 10.1137/0215008

Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &; Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-16761-7_54 
LibreCat: /record/16774
DOI: 10.1007/3-540-16761-7_54

Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In STACS 86. Berlin, Heidelberg.https://doi.org/10.1007/3-540-16078-7_72 
LibreCat: /record/16775
DOI: 10.1007/3-540-16078-7_72

Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &; Wigderson, A. (1986). A time-space tradeoff for element distinctness. In STACS 86. Berlin, Heidelberg.https://doi.org/10.1007/3-540-16078-7_89 
LibreCat: /record/16776
DOI: 10.1007/3-540-16078-7_89

Lautemann, C., &; Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. Information Processing Letters, 101–105.https://doi.org/10.1016/0020-0190(85)90042-0 
LibreCat: /record/16779
DOI: 10.1016/0020-0190(85)90042-0

Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937.https://doi.org/10.1145/4221.4250 
LibreCat: /record/16780
DOI: 10.1145/4221.4250

Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science, 325–330.https://doi.org/10.1016/0304-3975(85)90079-9 
LibreCat: /record/16781
DOI: 10.1016/0304-3975(85)90079-9

Meyer auf der Heide, F., &; Wigderson, A. (1985). The complexity of parallel sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).https://doi.org/10.1109/sfcs.1985.58 
LibreCat: /record/16782
DOI: 10.1109/sfcs.1985.58

Fich, F. E., Meyer auf der Heide, F., Ragde, P., &; Wigderson, A. (1985). One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85.https://doi.org/10.1145/22145.22151 
LibreCat: /record/16783
DOI: 10.1145/22145.22151

Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions of hard problems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85.https://doi.org/10.1145/22145.22191 
LibreCat: /record/16784
DOI: 10.1145/22145.22191

Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear search algorithms. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).https://doi.org/10.1109/sfcs.1985.38 
LibreCat: /record/16788
DOI: 10.1109/sfcs.1985.38

Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control, 67(1–3), 195–211.https://doi.org/10.1016/S0019-9958(85)80035-8 
LibreCat: /record/16823
DOI: 10.1016/S0019-9958(85)80035-8

Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676.https://doi.org/10.1145/828.322450 
LibreCat: /record/16785
DOI: 10.1145/828.322450