Eisenring, M., Platzner, M., &; Thiele, L. (1999). Communication Synthesis for Reconfigurable Embedded Systems. In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL) (Vol. 1673, pp. 205–214). Springer.https://doi.org/10.1007/978-3-540-48302-1_21 

Fischer, M., Lukovszki, T., &; Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg.https://doi.org/10.1007/3-540-68530-8_14 

Meyer auf der Heide, F., &; Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg.https://doi.org/10.1007/bfb0054332 

Platzner, M., &; De Micheli, G. (1998). Acceleration of satisfiability algorithms by reconfigurable hardware. In Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL)  (pp. 69–78). Berlin, Heidelberg: Springer .https://doi.org/10.1007/bfb0055234 

Czumaj, A., &; Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97).https://doi.org/10.1007/3-540-63397-9_9 

Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-63397-9_5 

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

Meyer auf der Heide, F., &; Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/bfb0002716 

Bäumker, A., &; Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg.https://doi.org/10.1007/3-540-63138-0_21 

Karaivazoglou, E., &; Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/bfb0002741 

Kleine Büning, H., &; Lettmann, T. (1996). Learning a representation for optimizable formulas. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-61863-5_33 

Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &; Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg.https://doi.org/10.1007/bfb0024725 

Meyer auf der Heide, F., &; Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICAL. Berlin, Heidelberg.https://doi.org/10.1007/3-540-61440-0 

Berenbrink, P., Meyer auf der Heide, F., &; Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60922-9_16 

Meyer auf der Heide, F., &; Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg.https://doi.org/10.1007/3-540-59042-0_81 

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60313-1_133 

Meyer auf der Heide, F., &; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60618-1_77 

Bäumker, A., Dittrich, W., &; Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60313-1_131 

Meyer auf der Heide, F., Monien, B., &; Rosenberg, A. L. (Eds.). (1993). Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-56731-3 

Meyer auf der Heide, F., Oesterdiekhoff, B., &; Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56939-1_89