Bienkowski, M., Korzeniowski, M., &; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg.https://doi.org/10.1007/11558989_20 

Bienkowski, M., &; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg.https://doi.org/10.1007/11549345_1 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808).https://doi.org/10.1007/11752578_96 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846).https://doi.org/10.1007/11752578_101 

Böttcher, S., &; Steinmetz, R. (2005). Detecting Privacy Violations in Sensitive XML Databases. In Secure Data Management, Second VLDB Workshop, SDM 2005 (pp. 143–154). Springer.https://doi.org/10.1007/11552338_10 

Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O.,https://doi.org/10.1007/978-3-540-30217-9_4__Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30217-9_4 

Blömer, J., Guajardo, J., &; Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-30564-4_5 

Blömer, J., &; May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-24632-9_1 

May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq. In Public Key Cryptography – PKC 2004 (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-24632-9_16 

May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-28628-8_13 

Damerow, V., &; Sohler, C. (2004). Extreme Points Under Random Noise. In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30140-0_25 

Nüsken, M., &; Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In Proc. 12th Annual Symposium on Algorithms (ESA’04) (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-30140-0_49 

Schindelhauer, C., Volbert, K., &; Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04) (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer .https://doi.org/10.1007/978-3-540-30551-4_69 

Bansal, V., Meyer auf der Heide, F., &; Sohler, C. (2004). Labeling Smart Dust. In 12th Annual European Symposium on Algorithms (ESA 2004) (Vol. 3221). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30140-0_9 

Walder, H., &; Platzner, M. (2004). A Runtime Environment for Reconfigurable Hardware Operating Systems. In Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL) (pp. 831–835). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-30117-2_84 

Blömer, J., &; May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-45146-4_2 

Blömer, J., &; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-45126-6_12 

Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03) (pp. 705–715).https://doi.org/10.1007/978-3-540-24587-2_72 

Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &; Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science (Vol. 2748). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-45078-8_13 

Böttcher, S., &; Steinmetz, R. (2003). Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients. In Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003 (pp. 400–410). Springer.https://doi.org/10.1007/978-3-540-39403-7_30