M. Eisenring, M. Platzner, and L. Thiele, “Communication Synthesis for Reconfigurable Embedded Systems,” in Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), 1999, vol. 1673, pp. 205–214.

M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.

F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.

M. Platzner and G. De Micheli, “Acceleration of satisfiability algorithms by reconfigurable hardware,” in Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , 1998, pp. 69–78.

A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,”10.1007/3-540-63397-9_9__1997, doi:10.1007/3-540-63397-9_9 .

J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.

M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,”10.1007/3-540-63397-9_13__in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi:10.1007/3-540-63397-9_13 .

F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.

A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.

E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.

H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable formulas,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.

A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.

F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming, 23rd International Colloquium, ICAL. Berlin, Heidelberg, 1996.

P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in STACS 96, Berlin, Heidelberg, 1996.

F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in STACS 95, Berlin, Heidelberg, 1995.

A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.

F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.

A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.

F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.

F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg, 1993.