H. Rasch and H. Wehrheim, “Checking Consistency in UML Diagramms: Classes and State Machines,” in Formal Methods for Open Object-Based Distributed Systems, 6th IFIP WG 6.1 International Conference, FMOODS 2003, Paris, France, November 19.21, 2003, Proceedings, 2003, pp. 229--243.

J. Derrick and H. Wehrheim, “Using Coupled Simulations in Non-atomic Refinement,” in ZB 2003: Formal Specification and Development in Z and B, Third International Conference of B and Z Users, Turku, Finland, June 4-6, 2003, Proceedings, 2003, pp. 127--147.

A. May, New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003.

J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.

J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.

V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.

B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.

B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.

A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.

L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.

K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.

B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment,” in 15th European Simulation Symposium (ESS 2003), 2003, pp. 367–371.

A. Magen et al., “Sublinear Approximation of Euclidean Minimum Spanning Tree,” in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.

M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing oblivious routing schemes,” in Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03, 2003.

C. Rust, F. Stappert, and T. Lukovszki, “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture,” in 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.

C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA), 2003.

Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing in polynomial time,” in Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03, 2003.

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

X. Fu, T. Chen, A. Festag, H. Karl, G. Schäfer, and C. Fan, “Secure, QoS-Enabled Mobility Support for IP-based Networks,” in Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember , 2003.

H.-F. Geerdes and H. Karl, “The Potential of Relaying in Cellular Networks ,” in Proceedings of INOC 2003, Evry/Paris, 2003.