Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19630

Ameur, Foued. Space-Bounded Learning Algorithms. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19634

Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat: /record/17482

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.”10.1007/3-540-60313-1_154__ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.
LibreCat: /record/2207

Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
LibreCat: /record/2208

Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”10.1016/s0020-0190(97)00032-x__Information Processing Letters, 1995, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
LibreCat: /record/16566
DOI: 10.1016/s0020-0190(97)00032-x

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.”10.1007/3-540-59042-0_81__STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”10.1007/3-540-60313-1_133__Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.”10.1145/215399.215430__Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995, doi:10.1145/215399.215430.
LibreCat: /record/16706
DOI: 10.1145/215399.215430

Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.”10.1109/istcs.1995.377051__Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.
LibreCat: /record/16707
DOI: 10.1109/istcs.1995.377051

Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.”10.1007/3-540-60618-1_77__Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77.
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”10.1007/3-540-60313-1_131__Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern. 1994.
LibreCat: /record/19624

Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.”10.1137/s0097539791194094__SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.
LibreCat: /record/17477
DOI: 10.1007/3-540-56731-3

Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat: /record/17479

Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.”10.1006/inco.1993.1007__Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.
LibreCat: /record/16729
DOI: 10.1006/inco.1993.1007

Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”10.1007/3-540-56939-1_89__Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89.
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.”10.1145/165231.165246__Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993, doi:10.1145/165231.165246.
LibreCat: /record/16731
DOI: 10.1145/165231.165246

Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.”10.1007/3-540-56503-5_46__Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.”10.1142/s0129626492000349__Parallel Processing Letters 2, 1992, pp. 213–20, doi:10.1142/s0129626492000349.
LibreCat: /record/18936
DOI: 10.1142/s0129626492000349

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.”10.1007/3-540-55488-2_31__Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.”10.1007/3-540-56731-3_3__Lecture Notes in Computer Science, 1992, doi:10.1007/3-540-56731-3_3.
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.”10.1007/3-540-55210-3_176__STACS 92, 1992, doi:10.1007/3-540-55210-3_176.
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.”10.1145/129712.129743__Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992, doi:10.1145/129712.129743.
LibreCat: /record/16736
DOI: 10.1145/129712.129743

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.”10.1007/978-3-322-95233-2_7__TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7.
LibreCat: /record/16737
DOI: 10.1007/978-3-322-95233-2_7

Alt, Helmut, et al. “Approximation of Convex Polygons.”10.1007/bfb0032068__Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.”10.1007/bfb0032018__Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018.
LibreCat: /record/16738
DOI: 10.1007/bfb0032018

Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.”10.1007/bfb0029597__Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.
LibreCat: /record/16739
DOI: 10.1007/bfb0029597

Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.”10.1007/bfb0029630__Lecture Notes in Computer Science, 1990, doi: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.”10.1145/100216.100229__Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100229.
LibreCat: /record/16741
DOI: 10.1145/100216.100229

Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.”10.1145/100216.100247__Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi: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, vol. 13, no. 4, 1990, pp. 231–32.
LibreCat: /record/16824

Just, Bettina, et al. “On Computations with Integer Division.”10.1051/ita/1989230101011__RAIRO - Theoretical Informatics and Applications, 1989, pp. 101–11, doi:10.1051/ita/1989230101011.
LibreCat: /record/16743
DOI: 10.1051/ita/1989230101011

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

Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.”10.1007/bfb0028969__STACS 89, 1989, doi: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.”10.1007/bfb0028978__STACS 89, 1989, doi: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.”10.1007/bfb0028983__STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

Babai, László, et al. “On the Limits of Computations with the Floor Function.”10.1016/0890-5401(88)90031-4__Information and Computation, 1988, pp. 99–107, doi: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.”10.1145/44483.44490__Journal of the ACM (JACM), 1988, pp. 740–47, doi:10.1145/44483.44490.
LibreCat: /record/16764
DOI: 10.1145/44483.44490

Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”10.1016/0304-3975(88)90018-7__Theoretical Computer Science, 1988, pp. 57–68, doi:10.1016/0304-3975(88)90018-7.
LibreCat: /record/16765
DOI: 10.1016/0304-3975(88)90018-7

Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.”10.1109/sfcs.1988.21968__[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988, doi:10.1109/sfcs.1988.21968.
LibreCat: /record/16766
DOI: 10.1109/sfcs.1988.21968

Just, Bettina, et al. “On Computations with Integer Division.”10.1007/bfb0035829__STACS 88, 1988, doi:10.1007/bfb0035829.
LibreCat: /record/16767
DOI: 10.1007/bfb0035829

Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.”10.1007/3-540-19487-8_24__SWAT 88, 1988, doi:10.1007/3-540-19487-8_24.
LibreCat: /record/16768
DOI: 10.1007/3-540-19487-8_24

Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.”10.1137/0216007__SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.
LibreCat: /record/16772
DOI: 10.1137/0216007

Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.”10.1137/0216008__SIAM Journal on Computing, 1987, pp. 100–07, doi:10.1137/0216008.
LibreCat: /record/16773
DOI: 10.1137/0216008

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

Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”10.1007/3-540-16761-7_54__Automata, Languages and Programming, 1986, doi: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.”10.1007/3-540-16078-7_72__STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
LibreCat: /record/16775
DOI: 10.1007/3-540-16078-7_72

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

Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.”10.1007/978-3-642-67838-7_34__GI - 10. Jahrestagung, 1980, doi: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.”10.1007/3-540-09510-1_32 __Automata, Languages and Programming. ICALP 1979, 1979, pp. 411–21, doi:10.1007/3-540-09510-1_32 .
LibreCat: /record/16812
DOI: 10.1007/3-540-09510-1_32