O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, “The Paderborn University BSP (PUB) library,” Parallel Computing, pp. 187–207, 2003.
LibreCat: /record/19726
DOI: 10.1016/s0167-8191(02)00218-1

K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” Algorithms for Memory Hierarchies, vol. 2625, 2003.
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

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

S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of distributed algorithms for topology control in wireless networks,”10.1109/ipdps.2003.1213107__2003, doi:10.1109/ipdps.2003.1213107 .
LibreCat: /record/19806
DOI: 10.1109/ipdps.2003.1213107

P. Mahlmann, Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web. 2003.
LibreCat: /record/19828

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

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

J. Klein and G.  Zachmann, “Time-Critical Collision Detection Using an Average-Case Approach,” in  Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), 2003, pp. 22–31.
LibreCat: /record/19900
DOI: 10.1145/1008653.1008660

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

M. Terbahl and J. Krokowski, “Verteiltes Rendern durch dynamische Bildaufteilung,” 2003.
LibreCat: /record/24273

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

M. Ziegler, “Computable Operators on Regular Sets,” in Computability and Complexity in Analysis, 2003, vol. 302–8/2003, pp. 389–406.
LibreCat: /record/26277

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.
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

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

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.
LibreCat: /record/17423

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.
LibreCat: /record/18791

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.
LibreCat: /record/18907
DOI: 10.1145/777412.777418

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.
LibreCat: /record/18947

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.
LibreCat: /record/18960
DOI: 10.1145/777412.777448

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.
LibreCat: /record/18966
DOI: 10.1145/780542.780599