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