Meyer auf der Heide, F., Kutyowski, M., &; Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/3-540-44520-x_59 

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739.https://doi.org/10.1137/s009753979529564x 

Meyer auf der Heide, F., &; Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn, 112–116.

Bonorden, O., Juurlink, B., Von Otte, I., &; Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104.https://doi.org/10.1109/ipps.1999.760442 

Flammini, M., &; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.https://doi.org/10.1007/s002240000123 

Berenbrink, P., &; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).

Fischer, M., Lukovszki, T., &; Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver.

Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99) (pp. 136–141).

Lukovszki, T. (1999). New Results on Geometric Spanners and Their Applications (Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.