The Paderborn University BSP (PUB) library
O. Bonorden, B. Juurlink, I. von Otte, I. Rieping, Parallel Computing (2003) 187–207.

Algorithmic Approaches for Storage Networks
K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003).

Storage Management as Means to cope with Exponential Information Growth
C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.

Performance of distributed algorithms for topology control in wireless networks
S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003.

Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web
P. Mahlmann, Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web, 2003.

Directed power-variable infrared communication for the mini robot Khepera
K. Volbert, M. Grünewald, C. Schindelhauer, U. Rückert, in: Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–122.

ADB-Trees: Controlling the Error of Time-Critical Collision Detection
J. Klein, G. Zachmann, in: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003), 2003, pp. 37–45.

Time-Critical Collision Detection Using an Average-Case Approach
J. Klein, G.  Zachmann, in:  Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), 2003, pp. 22–31.

Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003.

Verteiltes Rendern durch dynamische Bildaufteilung
M. Terbahl, J. Krokowski, in: Proceedings of 5. GI-Informatiktage 2003, Bad Schussenried, Germany, 2003.

Stability versus Speed in a Computable Algebraic Model
M. Ziegler, in: Proc. 5th Conference on Real Numbers and Computers (RN), INRIA, 2003, pp. 47–64.

Computable Operators on Regular Sets
M. Ziegler, in: Computability and Complexity in Analysis, 2003, pp. 389–406.

Smoothed Motion Complexity
V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.

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

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

Sublinear Approximation of Euclidean Minimum Spanning Tree
A. Magen, F. Ergun, C. Sohler, R. Rubinfeld, A. Czumaj, I. Newman, L. Fortnow, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.

A practical algorithm for constructing oblivious routing schemes
M. Bienkowski, M. Korzeniowski, H. Räcke, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.

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

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

Optimal oblivious routing in polynomial time
Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. Racke, in: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003.