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

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

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 46--59, 1995.
LibreCat: /record/17482

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.”https://doi.org/10.1007/3-540-60313-1_154__In ESA, 341--354. Lecture Notes in Computer Science, 1995.https://doi.org/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).” In SPAA, 137--146, 1995.
LibreCat: /record/2207

Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.
LibreCat: /record/2208

Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”https://doi.org/10.1016/s0020-0190(97)00032-x__Information Processing Letters, 1995, 103–10.https://doi.org/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.”https://doi.org/10.1007/3-540-59042-0_81__In STACS 95. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-59042-0_81 .
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.”https://doi.org/10.1007/3-540-60313-1_133__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_133 .
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.”https://doi.org/10.1145/215399.215430__In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.https://doi.org/10.1145/215399.215430 .
LibreCat: /record/16706
DOI: 10.1145/215399.215430

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.”https://doi.org/10.1109/istcs.1995.377051__In Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.https://doi.org/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.”https://doi.org/10.1007/3-540-60618-1_77__In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60618-1_77 .
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1007/3-540-60313-1_131__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/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. Universität Paderborn, 1994.
LibreCat: /record/19624

Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.”https://doi.org/10.1137/s0097539791194094__SIAM Journal on Computing, 1994, 738–61.https://doi.org/10.1137/s0097539791194094 .
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.https://doi.org/10.1007/3-540-56731-3 .
LibreCat: /record/17477
DOI: 10.1007/3-540-56731-3

Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” In Proc. 3rd PASA Workshop, PARS Mitteilungen, 50–55, 1993.
LibreCat: /record/17479

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

Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.”https://doi.org/10.1007/3-540-56939-1_89__In Automata, Languages and Programming. Berlin, Heidelberg, 1993.https://doi.org/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.”https://doi.org/10.1145/165231.165246__In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993.https://doi.org/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.”https://doi.org/10.1007/3-540-56503-5_46__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993.https://doi.org/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.”https://doi.org/10.1142/s0129626492000349__Parallel Processing Letters 2, 1992, 213–20.https://doi.org/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.”https://doi.org/10.1007/3-540-55488-2_31__In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992.https://doi.org/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.”https://doi.org/10.1007/3-540-56731-3_3__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992.https://doi.org/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.”https://doi.org/10.1007/3-540-55210-3_176__In STACS 92. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-55210-3_176 .
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.”https://doi.org/10.1145/129712.129743__In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992.https://doi.org/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.”https://doi.org/10.1007/978-3-322-95233-2_7__In TEUBNER-TEXTE Zur Informatik. Wiesbaden, 1992.https://doi.org/10.1007/978-3-322-95233-2_7 .
LibreCat: /record/16737
DOI: 10.1007/978-3-322-95233-2_7

Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.”https://doi.org/10.1007/bfb0032068__In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990.https://doi.org/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.”https://doi.org/10.1007/bfb0032018__In Automata, Languages and Programming. Berlin/Heidelberg, 1990.https://doi.org/10.1007/bfb0032018 .
LibreCat: /record/16738
DOI: 10.1007/bfb0032018

Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.”https://doi.org/10.1007/bfb0029597__In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990.https://doi.org/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.”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