Eisenring, Michael, et al. “Communication Synthesis for Reconfigurable Embedded Systems.”10.1007/978-3-540-48302-1_21__Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), vol. 1673, Springer, 1999, pp. 205–14, doi:10.1007/978-3-540-48302-1_21.

Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”10.1007/3-540-68530-8_14__Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.

Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.”10.1007/bfb0054332__LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.

Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability Algorithms by Reconfigurable Hardware.”10.1007/bfb0055234__Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , Springer , 1998, pp. 69–78, doi:10.1007/bfb0055234.

Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”10.1007/3-540-63397-9_9__Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997, doi:10.1007/3-540-63397-9_9.

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”10.1007/3-540-63397-9_5__Algorithms — ESA ’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.

Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”10.1007/3-540-63397-9_13__5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13.

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.”10.1007/bfb0002716__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.

Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.”10.1007/3-540-63138-0_21__Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.

Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.”10.1007/bfb0002741__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.

Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.”10.1007/3-540-61863-5_33__Lecture Notes in Computer Science, 1996, doi:10.1007/3-540-61863-5_33.

Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”10.1007/bfb0024725__Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.

Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata, Languages and Programming, 23rd International Colloquium, ICAL. 1996, doi:10.1007/3-540-61440-0.

Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.”10.1007/3-540-60922-9_16__STACS 96, 1996, doi:10.1007/3-540-60922-9_16.

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.

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.

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.

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.

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

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.