Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library.”10.1016/s0167-8191(02)00218-1__Parallel Computing, 2003, pp. 187–207, doi:10.1016/s0167-8191(02)00218-1.

Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.”10.1007/3-540-36574-5_12__Algorithms for Memory Hierarchies, vol. 2625, 2003, doi:10.1007/3-540-36574-5_12.

Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.

Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.”10.1109/ipdps.2003.1213107__Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003, doi:10.1109/ipdps.2003.1213107.

Mahlmann, Peter. Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web. 2003.

Volbert, Klaus, et al. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.” Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–22.

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

Klein, Jan, and Gabriel10.1145/1008653.1008660__Zachmann. “Time-Critical Collision Detection Using an Average-Case Approach.”10.1145/1008653.1008660__10.1145/1008653.1008660__Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), 2003, pp. 22–31, doi:10.1145/1008653.1008660.

Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.”10.1137/s0097539702419649__Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, doi:10.1137/s0097539702419649.

Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische Bildaufteilung.” Proceedings of 5. GI-Informatiktage 2003, 2003.

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

Ziegler, Martin. “Computable Operators on Regular Sets.” Computability and Complexity in Analysis, vol. 302-8/2003, 2003, pp. 389–406.

Damerow, Valentina, et al. “Smoothed Motion Complexity.”10.1007/978-3-540-39658-1_17__ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.

Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.

Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–71.

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

Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious Routing Schemes.”10.1145/777412.777418__Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003, doi:10.1145/777412.777418.

Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.

Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.”10.1145/777412.777448__Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA), 2003, doi:10.1145/777412.777448.

Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.”10.1145/780542.780599__Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003, doi:10.1145/780542.780599.