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 .

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 .

Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”https://doi.org/10.1007/978-3-540-24587-2_72__In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003.https://doi.org/10.1007/978-3-540-24587-2_72 .

Ziegler, Martin. “Fast Relative Approximation of Potential Fields.”https://doi.org/10.1007/978-3-540-45078-8_13__In Lecture Notes in Computer Science, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003.https://doi.org/10.1007/978-3-540-45078-8_13 .

Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.”https://doi.org/10.1007/3-540-45084-x_8__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003.https://doi.org/10.1007/3-540-45084-x_8 .

Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.”https://doi.org/10.1007/3-540-36970-8_36__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003.https://doi.org/10.1007/3-540-36970-8_36 .

Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.”https://doi.org/10.1007/3-540-36970-8_9__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003.https://doi.org/10.1007/3-540-36970-8_9 .

Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.”https://doi.org/10.1007/978-3-540-39403-7_30__In Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, 400–410. Springer, 2003.https://doi.org/10.1007/978-3-540-39403-7_30 .

Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.”https://doi.org/10.1007/978-3-540-39429-7_6__In Database and XML Technologies, First International XML Database Symposium, XSym 2003, 85–99. Berlin, Heidelberg, 2003.https://doi.org/10.1007/978-3-540-39429-7_6 .