A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 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.

R. Cole et al., “Randomized protocols for low-congestion circuit routing in multistage interconnection networks,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98, 1998.

A. Bäumker, Communication Efficient Parallel Searching, vol. 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.

W. Dittrich, Communication and I/O Efficient Parallel Data Structures, vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.

W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.

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 .

W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.

C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its Point Set,” in Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.

S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.

M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.

D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.

A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” Information and Computation, pp. 103–120, 1997.

F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,”10.1007/s002240000071__Theory of Computing Systems, pp. 627–644, 1997, doi:10.1007/s002240000071 .

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.

P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97, 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.

B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,”10.1109/sfcs.1997.646117__1997, doi:10.1109/sfcs.1997.646117 .