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