Rasch, Holger, and Heike Wehrheim. “Checking Consistency in UML Diagramms: Classes and State Machines.”10.1007/978-3-540-39958-2_16__Formal Methods for Open Object-Based Distributed Systems, 6th IFIP WG 6.1 International Conference, FMOODS 2003, Paris, France, November 19.21, 2003, Proceedings, edited by Elie Najm et al., 2003, pp. 229--243, doi:10.1007/978-3-540-39958-2_16.

Derrick, John, and Heike Wehrheim. “Using Coupled Simulations in Non-Atomic Refinement.”10.1007/3-540-44880-2_10__ZB 2003: Formal Specification and Development in Z and B, Third International Conference of B and Z Users, Turku, Finland, June 4-6, 2003, Proceedings, edited by Didier Bert et al., 2003, pp. 127--147, doi:10.1007/3-540-44880-2_10.

May, Alexander. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003.

Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.”10.1007/978-3-540-45146-4_2__Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.

Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).”10.1007/978-3-540-45126-6_12__Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12.

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.

Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.

Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.

Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.

Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.

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.

Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. 2003.

Fu, X., et al. “Secure, QoS-Enabled Mobility Support for IP-Based Networks.” Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember , 2003.

Geerdes, Hans-Florian, and Holger Karl. “The Potential of Relaying in Cellular Networks .” Proceedings of INOC 2003, Evry/Paris, 2003.