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

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

Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough of Massive Models. In: Algorithm Engineering, 2nd International Workshop, WAE ’98. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.

Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet.; 1998.

Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn; 1998.

Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096

Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.

Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.

Scheideler C. Universal Routing Strategies for Interconnection Networks. Vol 1390.; 1998. doi:10.1007/BFb0052928

Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. Theoretical Computer Science. 1998;196:181-200. doi:10.1016/s0304-3975(97)86791-6

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

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

Cole R, Maggs BM, Meyer auf der Heide F, 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. doi:10.1145/276698.276790

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

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

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

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

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

Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry. ; 1997:39-43.

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