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

Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies, 2625.https://doi.org/10.1007/3-540-36574-5_12 
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

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

Rührup, S., Schindelhauer, C., Volbert, K., &; Grünewald, M. (2003). Performance of distributed algorithms for topology control in wireless networks. Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS).https://doi.org/10.1109/ipdps.2003.1213107 
LibreCat: /record/19806
DOI: 10.1109/ipdps.2003.1213107

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

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

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

Klein, J., &;https://doi.org/10.1145/1008653.1008660__Zachmann, G. (2003). Time-Critical Collision Detection Using an Average-Case Approach. In https://doi.org/10.1145/1008653.1008660__Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003) (pp. 22–31).https://doi.org/10.1145/1008653.1008660 
LibreCat: /record/19900
DOI: 10.1145/1008653.1008660

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

Terbahl, M., &; Krokowski, J. (2003). Verteiltes Rendern durch dynamische Bildaufteilung. Proceedings of 5. GI-Informatiktage 2003.
LibreCat: /record/24273

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

Ziegler, M. (2003). Computable Operators on Regular Sets. Computability and Complexity in Analysis, 302-8/2003, 389–406.
LibreCat: /record/26277

Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &; Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer.https://doi.org/10.1007/978-3-540-39658-1_17 
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Awerbuch, B., Brinkmann, A., &; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.
LibreCat: /record/2129

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

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

Bienkowski, M., Korzeniowski, M., &; Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03.https://doi.org/10.1145/777412.777418 
LibreCat: /record/18907
DOI: 10.1145/777412.777418

Rust, C., Stappert, F., &; Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In 7th World Multiconference on Systemics, Cybernetics and Informatics.
LibreCat: /record/18947

Schindelhauer, C., Lukovszki, T., Rührup, S., &; Volbert, K. (2003). Worst case mobility in ad hoc networks. In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA).https://doi.org/10.1145/777412.777448 
LibreCat: /record/18960
DOI: 10.1145/777412.777448

Azar, Y., Cohen, E., Fiat, A., Kaplan, H., &; Racke, H. (2003). Optimal oblivious routing in polynomial time. In Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03.https://doi.org/10.1145/780542.780599 
LibreCat: /record/18966
DOI: 10.1145/780542.780599