O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.
LibreCat: /record/19735

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.
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime Walkthrough of Massive Models,” in Algorithm Engineering, 2nd International Workshop, WAE ’98, 1998, pp. 133--142.
LibreCat: /record/17863

M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen unserer Welt mit dem Internet. 1998.
LibreCat: /record/18145

B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn, 1998.
LibreCat: /record/18445

C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
LibreCat: /record/2168
DOI: 10.1007/s002240000096

M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
LibreCat: /record/2169

U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.
LibreCat: /record/2170

C. Scheideler, Universal Routing Strategies for Interconnection Networks, vol. 1390. 1998.
LibreCat: /record/2185
DOI: 10.1007/BFb0052928

F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998.
LibreCat: /record/16503
DOI: 10.1016/s0304-3975(97)86791-6

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.
LibreCat: /record/16504
DOI: 10.1016/s0304-3975(98)00020-6

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

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.
LibreCat: /record/16563
DOI: 10.1145/276698.276790

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

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

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

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

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

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.
LibreCat: /record/18575

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