J. Gehweiler, Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn, 2003.

H. Hamann, “Definition and Behavior of Langton’s Ant in Three Dimensions,” Complex Systems, vol. 14, no. 3, pp. 263--268, 2003.

M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.

M. Ziegler, “Fast Relative Approximation of Potential Fields,” in Lecture Notes in Computer Science, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.

M. Fischer, M. Grafe, C. Matysczok, B. Mueck, and M. Schoo, “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation,” in Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, 2003, vol. 5, pp. 170–177.

W. Dangelmaier, W.  Franke, B. Mueck, and M. Fischer, “Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen,” in 2. Paderborner Workshop Augmented &; Virtual Reality in der Produktentstehung, 2003, vol. 123, pp. 141–151.

M. Fischer, M. Grafe, C. Matysczok, M. Schoo, and B. Mueck, “Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation,” in 2. Paderborner Workshop Augmented &; Virtual Reality in der Produktentstehung, 2003, vol. 123, pp. 153–166.

M. Adler, B. Vöcking, C. Sohler, H. Räcke, and N. Sivadasan, “Randomized Pursuit-Evasion in Graphs,” Combinatorics, Probability &; Computing, pp. 225–244, 2003.

C. Sohler, Property Testing and Geometry, vol. 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.

F. Meyer auf der Heide, “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications),” it - Information Technology, 2003.

B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast on parallel locality models,” Journal of Discrete Algorithms, pp. 151–166, 2003.

A. L. Rosenberg and F. Meyer auf der Heide, Eds., Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. 2003.

O. Bonorden et al., “A holistic methodology for network processor design,” in 28th Annual IEEE International Conference on Local Computer Networks, 2003.

O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,” in Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.

R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal,” in Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–420.

J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression,” in Proc. of 4. GI-Informatiktage, 2002, pp. 224–229.

A.  Benczúr, U. Glässer, and T. Lukovszki, “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks,” Proc. of 10th International Workshop on Abstract State Machines, LNCS, 2002.

M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,”10.1007/3-540-45706-2_134__2002, doi:10.1007/3-540-45706-2_134 .

K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,”10.1109/empdp.2002.994324__2002, doi:10.1109/empdp.2002.994324 .

A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.