Bonorden, Olaf, Bernhardus Juurlink, Ingo von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library.”https://doi.org/10.1016/s0167-8191(02)00218-1__Parallel Computing, 2003, 187–207.https://doi.org/10.1016/s0167-8191(02)00218-1 .

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

Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003, 2003.

Rührup, Stefan, Christianhttps://doi.org/10.1109/ipdps.2003.1213107__Schindelhauer, Klaus Volbert, and M. Grünewald. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.”https://doi.org/10.1109/ipdps.2003.1213107__In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003.https://doi.org/10.1109/ipdps.2003.1213107 .

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

Volbert, Klaus, Matthias Grünewald, Christian Schindelhauer, and Ulrich 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, 113–22, 2003.

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

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

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

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

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

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

Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.”https://doi.org/10.1007/978-3-540-39658-1_17__In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003.https://doi.org/10.1007/978-3-540-39658-1_17 .

Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.

Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” In 15th European Simulation Symposium (ESS 2003), 367–71. SCS - Europe, 2003.

Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 813–822, 2003.

Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical Algorithm for Constructing Oblivious Routing Schemes.”https://doi.org/10.1145/777412.777418__In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.https://doi.org/10.1145/777412.777418 .

Rust, Carsten, Friedhelm Stappert, and Tamás 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.

Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.”https://doi.org/10.1145/777412.777448__In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA), 2003.https://doi.org/10.1145/777412.777448 .

Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal Oblivious Routing in Polynomial Time.”https://doi.org/10.1145/780542.780599__In Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003.https://doi.org/10.1145/780542.780599 .