Rasch, Holger, and Heike Wehrheim. “Checking Consistency in UML Diagramms: Classes and State Machines.”https://doi.org/10.1007/978-3-540-39958-2_16__In 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, Uwe Nestmann, and Perdita Stevens, 229--243. Lecture Notes in Computer Science, 2003.https://doi.org/10.1007/978-3-540-39958-2_16 .

Derrick, John, and Heike Wehrheim. “Using Coupled Simulations in Non-Atomic Refinement.”https://doi.org/10.1007/3-540-44880-2_10__In 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, Jonathan P. Bowen, Steve King, and Marina A. Wald\rquote en, 127--147. Lecture Notes in Computer Science, 2003.https://doi.org/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.”https://doi.org/10.1007/978-3-540-45146-4_2__In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003.https://doi.org/10.1007/978-3-540-45146-4_2 .

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

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.

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

Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.

Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.

Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 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 .

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

Fu, X., T. Chen, A. Festag, Holger Karl, G. Schäfer, and C. Fan. “Secure, QoS-Enabled Mobility Support for IP-Based Networks.” In Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember , 2003.

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