Bäumker, A., Dittrich, W., &; Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203.https://doi.org/10.1016/s0304-3975(98)00020-6 
LibreCat: /record/16504
DOI: 10.1016/s0304-3975(98)00020-6

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 
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K.,https://doi.org/10.1145/276698.276790__Vöcking, B. (1998). 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.https://doi.org/10.1145/276698.276790 
LibreCat: /record/16563
DOI: 10.1145/276698.276790

Bäumker, A. (1997). Communication Efficient Parallel Searching (Vol. 28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19631

Dittrich, W. (1997). Communication and I/O Efficient Parallel Data Structures (Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19636

Strothmann, W.-B. (1997). Bounded Degree Spanning Trees (Vol. 35). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19637

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 
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Strothmann, W.-B., &; Lukovszki, T. (1997). Decremental Biconnectivity on Planar Graphs. Paderborn.
LibreCat: /record/18955

Sohler, C., &; Denny, M. (1997). Encoding a Triangulation as a Permutation of its Point Set. In Proceedings of the 9th Canadian Conference on Computational Geometry (pp. 39–43).
LibreCat: /record/18575

Bock, S., Meyer auf der Heide, F., &; Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.
LibreCat: /record/2175

Flammini, M., &; Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).
LibreCat: /record/2179

Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &; Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. Computational Complexity, 357–375.https://doi.org/10.1007/bf01270387 
LibreCat: /record/16564
DOI: 10.1007/bf01270387

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 103–120.https://doi.org/10.1006/inco.1997.2642 
LibreCat: /record/16565
DOI: 10.1006/inco.1997.2642

Meyer auf der Heide, F., Storch, M., &; Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems, 627–644.https://doi.org/10.1007/s002240000071 
LibreCat: /record/16567
DOI: 10.1007/s002240000071

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 
LibreCat: /record/16568
DOI: 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 
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Berenbrink, P., Meyer auf der Heide, F., &; Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97.https://doi.org/10.1145/258492.258522 
LibreCat: /record/16604
DOI: 10.1145/258492.258522

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 
LibreCat: /record/16605
DOI: 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 
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. Proceedings 38th Annual Symposium on Foundations of Computer Science.https://doi.org/10.1109/sfcs.1997.646117 
LibreCat: /record/16689
DOI: 10.1109/sfcs.1997.646117