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.

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

Definition and Behavior of Langton's Ant in Three Dimensions
H. Hamann, Complex Systems 14 (2003) 263--268.

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

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

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

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

Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation
M. Fischer, M. Grafe, C. Matysczok, M. Schoo, B. Mueck, in: 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–166.

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

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

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

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

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA 
A.L. Rosenberg, F. Meyer auf der Heide, eds., Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.

A holistic methodology for network processor design
O. Bonorden, N. Bruls, U. Kastens, D.K. Le, F. Meyer auf der Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, M. Thies, in: 28th Annual IEEE International Conference on Local Computer Networks, 2003.

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

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

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

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

Distributed Maintenance of Resource Efficient Wireless Network Topologies
M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.

A simulation environment for ad hoc networks using sector subdivision
K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002.

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

Abstract Combinatorial Programs and Efficient Property Testers
C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS) (2002) 83–92.

A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing
T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.

Zur Berechenbarkeit reeller geometrischer Probleme
M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.

Computability on Regular Subsets of Euclidean Space
M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.

Point Location Algorithms of Minimum Size
M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.

Computability of Linear Equations
V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.

Bi-directional Coupling of Simulation Tools with a Walkthrough-System
B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.

Randomized Pursuit-Evasion in Graphs
M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory of Computing Systems (2002) 217–245.

The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments
J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002.