Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.”10.1007/3-540-16078-7_89__STACS 86, 1986, doi:10.1007/3-540-16078-7_89.
LibreCat: /record/16776
DOI: 10.1007/3-540-16078-7_89

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

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

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

Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.”10.1109/sfcs.1985.58__26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58.
LibreCat: /record/16782
DOI: 10.1109/sfcs.1985.58

Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.”10.1145/22145.22151__Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22151.
LibreCat: /record/16783
DOI: 10.1145/22145.22151

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

Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.”10.1109/sfcs.1985.38__26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38.
LibreCat: /record/16788
DOI: 10.1109/sfcs.1985.38

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

Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.”10.1145/828.322450__Journal of the ACM (JACM), 1984, pp. 668–76, doi:10.1145/828.322450.
LibreCat: /record/16785
DOI: 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.”10.1109/sfcs.1984.715901__25th Annual Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.
LibreCat: /record/16786
DOI: 10.1109/sfcs.1984.715901

Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).”10.1007/3-540-12920-0_20__STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”10.1007/bf00265559__Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.
LibreCat: /record/16806
DOI: 10.1007/bf00265559

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

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

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

Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”10.1007/bfb0036483__Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483.
LibreCat: /record/16810
DOI: 10.1007/bfb0036483

Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.”10.1007/3-540-10854-8_29__Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.”10.1007/3-540-10856-4_111__Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111

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