Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.”https://doi.org/10.1145/44483.44490__Journal of the ACM (JACM), 1988, 740–47.https://doi.org/10.1145/44483.44490 .

Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”https://doi.org/10.1016/0304-3975(88)90018-7__Theoretical Computer Science, 1988, 57–68.https://doi.org/10.1016/0304-3975(88)90018-7 .

Dietzfelbinger, M., A. Karlin, K. Mehlhorn, Friedhelm Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.”https://doi.org/10.1109/sfcs.1988.21968__In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.https://doi.org/10.1109/sfcs.1988.21968 .

Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.”https://doi.org/10.1007/bfb0035829__In STACS 88. Berlin, Heidelberg, 1988.https://doi.org/10.1007/bfb0035829 .

Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.”https://doi.org/10.1007/3-540-19487-8_24__In SWAT 88. Berlin, Heidelberg, 1988.https://doi.org/10.1007/3-540-19487-8_24 .

Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.”https://doi.org/10.1137/0216007__SIAM Journal on Computing, 1987, 97–99.https://doi.org/10.1137/0216007 .

Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.”https://doi.org/10.1137/0216008__SIAM Journal on Computing, 1987, 100–107.https://doi.org/10.1137/0216008 .

Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.”https://doi.org/10.1137/0215008__SIAM Journal on Computing, 1986, 106–19.https://doi.org/10.1137/0215008 .

Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”https://doi.org/10.1007/3-540-16761-7_54__In Automata, Languages and Programming. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16761-7_54 .

Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.”https://doi.org/10.1007/3-540-16078-7_72__In STACS 86. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16078-7_72 .

Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.”https://doi.org/10.1007/3-540-16078-7_89__In STACS 86. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16078-7_89 .

Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.”https://doi.org/10.1016/0020-0190(85)90042-0__Information Processing Letters, 1985, 101–5.https://doi.org/10.1016/0020-0190(85)90042-0 .

Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.”https://doi.org/10.1145/4221.4250__Journal of the ACM (JACM), 1985, 929–37.https://doi.org/10.1145/4221.4250 .

Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.”https://doi.org/10.1016/0304-3975(85)90079-9__Theoretical Computer Science, 1985, 325–30.https://doi.org/10.1016/0304-3975(85)90079-9 .

Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.”https://doi.org/10.1109/sfcs.1985.58__In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.https://doi.org/10.1109/sfcs.1985.58 .

Fich, F E, Friedhelm Meyer auf der Heide, P Ragde, and A Wigderson. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.”https://doi.org/10.1145/22145.22151__In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985.https://doi.org/10.1145/22145.22151 .

Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.”https://doi.org/10.1145/22145.22191__In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985.https://doi.org/10.1145/22145.22191 .

Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.”https://doi.org/10.1109/sfcs.1985.38__In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.https://doi.org/10.1109/sfcs.1985.38 .

Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.”https://doi.org/10.1016/S0019-9958(85)80035-8__Information and Control 67, no. 1–3 (1985): 195–211.https://doi.org/10.1016/S0019-9958(85)80035-8 .

Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.”https://doi.org/10.1145/828.322450__Journal of the ACM (JACM), 1984, 668–76.https://doi.org/10.1145/828.322450 .

Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.”https://doi.org/10.1109/sfcs.1984.715901__In 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984.https://doi.org/10.1109/sfcs.1984.715901 .

Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).”https://doi.org/10.1007/3-540-12920-0_20__In STACS 84. Berlin, Heidelberg, 1984.https://doi.org/10.1007/3-540-12920-0_20 .

Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”https://doi.org/10.1007/bf00265559__Acta Informatica, 1983, 269–96.https://doi.org/10.1007/bf00265559 .

Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.”https://doi.org/10.1007/bf00290735__Acta Informatica, 1983, 385–95.https://doi.org/10.1007/bf00290735 .

Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.”https://doi.org/10.1016/0020-0190(83)90001-7__Information Processing Letters, 1983, 1–2.https://doi.org/10.1016/0020-0190(83)90001-7 .

Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.”https://doi.org/10.1145/800061.808734__In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983.https://doi.org/10.1145/800061.808734 .

Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”https://doi.org/10.1007/bfb0036483__In Lecture Notes in Computer Science. Berlin/Heidelberg, 1983.https://doi.org/10.1007/bfb0036483 .

Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.”https://doi.org/10.1007/3-540-10854-8_29__In Fundamentals of Computation Theory. Berlin, Heidelberg, 1981.https://doi.org/10.1007/3-540-10854-8_29 .

Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.”https://doi.org/10.1007/3-540-10856-4_111__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1981.https://doi.org/10.1007/3-540-10856-4_111 .

Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.”https://doi.org/10.1016/s0304-3975(81)80004-7__Theoretical Computer Science, 1981, 315–22.https://doi.org/10.1016/s0304-3975(81)80004-7 .

Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.”https://doi.org/10.1007/978-3-642-67838-7_34__In GI - 10. Jahrestagung. Berlin, Heidelberg, 1980.https://doi.org/10.1007/978-3-642-67838-7_34 .

Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.”https://doi.org/10.1007/3-540-09510-1_32 __Automata, Languages and Programming. ICALP 1979, 1979, 411–21.https://doi.org/10.1007/3-540-09510-1_32  .