Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.”https://doi.org/10.1007/bfb0029630__In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990.https://doi.org/10.1007/bfb0029630 .
LibreCat: /record/16740
DOI: 10.1007/bfb0029630

Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.”https://doi.org/10.1145/100216.100229__In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.https://doi.org/10.1145/100216.100229 .
LibreCat: /record/16741
DOI: 10.1145/100216.100229

Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys Can Be Hashed in Constant Time.”https://doi.org/10.1145/100216.100247__In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.https://doi.org/10.1145/100216.100247 .
LibreCat: /record/16742
DOI: 10.1145/100216.100247

Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum 13, no. 4 (1990): 231–32.
LibreCat: /record/16824

Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations with Integer Division.”https://doi.org/10.1051/ita/1989230101011__RAIRO - Theoretical Informatics and Applications, 1989, 101–11.https://doi.org/10.1051/ita/1989230101011 .
LibreCat: /record/16743
DOI: 10.1051/ita/1989230101011

Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.”https://doi.org/10.1145/72935.72974__In Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989.https://doi.org/10.1145/72935.72974 .
LibreCat: /record/16744
DOI: 10.1145/72935.72974

Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.”https://doi.org/10.1007/bfb0028969__In STACS 89. Berlin/Heidelberg, 1989.https://doi.org/10.1007/bfb0028969 .
LibreCat: /record/16745
DOI: 10.1007/bfb0028969

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.”https://doi.org/10.1007/bfb0028978__In STACS 89. Berlin/Heidelberg, 1989.https://doi.org/10.1007/bfb0028978 .
LibreCat: /record/16746
DOI: 10.1007/bfb0028978

Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.”https://doi.org/10.1007/bfb0028983__In STACS 89. Berlin, Heidelberg, 1989.https://doi.org/10.1007/bfb0028983 .
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the Limits of Computations with the Floor Function.”https://doi.org/10.1016/0890-5401(88)90031-4__Information and Computation, 1988, 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, 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 .
LibreCat: /record/16764
DOI: 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 .
LibreCat: /record/16765
DOI: 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 .
LibreCat: /record/16766
DOI: 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 .
LibreCat: /record/16767
DOI: 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 .
LibreCat: /record/16768
DOI: 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 .
LibreCat: /record/16772
DOI: 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 .
LibreCat: /record/16773
DOI: 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 .
LibreCat: /record/16771
DOI: 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 .
LibreCat: /record/16774
DOI: 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 .
LibreCat: /record/16775
DOI: 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 .
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.”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 .
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.”https://doi.org/10.1145/4221.4250__Journal of the ACM (JACM), 1985, 929–37.https://doi.org/10.1145/4221.4250 .
LibreCat: /record/16780
DOI: 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 .
LibreCat: /record/16781
DOI: 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 .
LibreCat: /record/16782
DOI: 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 .
LibreCat: /record/16783
DOI: 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 .
LibreCat: /record/16784
DOI: 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 .
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.”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 .
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.”https://doi.org/10.1145/828.322450__Journal of the ACM (JACM), 1984, 668–76.https://doi.org/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.”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 .
LibreCat: /record/16786
DOI: 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 .
LibreCat: /record/16787
DOI: 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 .
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.”https://doi.org/10.1007/bf00290735__Acta Informatica, 1983, 385–95.https://doi.org/10.1007/bf00290735 .
LibreCat: /record/16807
DOI: 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 .
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.”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 .
LibreCat: /record/16809
DOI: 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 .
LibreCat: /record/16810
DOI: 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 .
LibreCat: /record/16813
DOI: 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 .
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.”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 .
LibreCat: /record/16820
DOI: 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 .
LibreCat: /record/16815
DOI: 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  .
LibreCat: /record/16812
DOI: 10.1007/3-540-09510-1_32