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

Meyer auf der Heide, F., &; Reischuk, R. (1984). On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In 25th Annual Symposium onFoundations of Computer Science, 1984.https://doi.org/10.1109/sfcs.1984.715901 
LibreCat: /record/16786
DOI: 10.1109/sfcs.1984.715901

Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg.https://doi.org/10.1007/3-540-12920-0_20 
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. Acta Informatica, 269–296.https://doi.org/10.1007/bf00265559 
LibreCat: /record/16806
DOI: 10.1007/bf00265559

Klein, P., &; Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395.https://doi.org/10.1007/bf00290735 
LibreCat: /record/16807
DOI: 10.1007/bf00290735

Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information Processing Letters, 1–2.https://doi.org/10.1016/0020-0190(83)90001-7 
LibreCat: /record/16808
DOI: 10.1016/0020-0190(83)90001-7

Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83.https://doi.org/10.1145/800061.808734 
LibreCat: /record/16809
DOI: 10.1145/800061.808734

Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In Lecture Notes in Computer Science. Berlin/Heidelberg.https://doi.org/10.1007/bfb0036483 
LibreCat: /record/16810
DOI: 10.1007/bfb0036483

Meyer auf der Heide, F., &; Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/3-540-10854-8_29 
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-10856-4_111 
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111

Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322.https://doi.org/10.1016/s0304-3975(81)80004-7 
LibreCat: /record/16820
DOI: 10.1016/s0304-3975(81)80004-7

Klein, P., &; Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-67838-7_34 
LibreCat: /record/16815
DOI: 10.1007/978-3-642-67838-7_34

Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421.https://doi.org/10.1007/3-540-09510-1_32  
LibreCat: /record/16812
DOI: 10.1007/3-540-09510-1_32