Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.”https://doi.org/10.1007/978-3-540-31956-6_49__In Proceedings of the 4th International Conference on Networking, 3420:413–20.https://doi.org/10.1007/978-3-540-31956-6_49__Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005.https://doi.org/10.1007/978-3-540-31956-6_49 .

Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.”https://doi.org/10.1007/978-3-540-31856-9_30__In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 365–76. Lecture Notes in Computer Science, 2005.https://doi.org/10.1007/978-3-540-31856-9_30 .

Köhler, Sven, Christian Schindelhauer, and Martin Ziegler. “On Approximating Real-World Halting Problems.”https://doi.org/10.1007/11537311_40__In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11537311_40 .

Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.”https://doi.org/10.1007/11537311_41__In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11537311_41 .

Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.”https://doi.org/10.1007/11494645_68__In Proc. CiE 2005: New Computational Paradigms, 3526:562–71. Springer, 2005.https://doi.org/10.1007/11494645_68 .

Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.”https://doi.org/10.1007/11558989_20__In Peer-to-Peer Systems IV. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11558989_20 .

Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.”https://doi.org/10.1007/11549345_1__In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11549345_1 .

Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.”https://doi.org/10.1007/11752578_96__In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 801–8, 2005.https://doi.org/10.1007/11752578_96 .

Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.”https://doi.org/10.1007/11752578_101__In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 839–46, 2005.https://doi.org/10.1007/11752578_101 .

Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.”https://doi.org/10.1007/11552338_10__In Secure Data Management, Second VLDB Workshop, SDM 2005, 143–54. Springer, 2005.https://doi.org/10.1007/11552338_10 .

Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”https://doi.org/10.1007/978-3-540-30217-9_4__In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30217-9_4 .

Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.”https://doi.org/10.1007/978-3-540-30564-4_5__In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30564-4_5 .

Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”https://doi.org/10.1007/978-3-540-24632-9_1__In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-24632-9_1 .

May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^rq.”https://doi.org/10.1007/978-3-540-24632-9_16__In Public Key Cryptography – PKC 2004, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-24632-9_16 .

May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.”https://doi.org/10.1007/978-3-540-28628-8_13__In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-28628-8_13 .

Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.”https://doi.org/10.1007/978-3-540-30140-0_25__In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30140-0_25 .

Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.”https://doi.org/10.1007/978-3-540-30140-0_49__In Proc. 12th Annual Symposium on Algorithms (ESA’04), 3221:544–55. Berlin, Heidelberg: Springer, 2004.https://doi.org/10.1007/978-3-540-30140-0_49 .

Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.”https://doi.org/10.1007/978-3-540-30551-4_69__In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 3341:805–21. Berlin, Heidelberg: Springer , 2004.https://doi.org/10.1007/978-3-540-30551-4_69 .

Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling Smart Dust.”https://doi.org/10.1007/978-3-540-30140-0_9__In 12th Annual European Symposium on Algorithms (ESA 2004), Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30140-0_9 .

Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.”https://doi.org/10.1007/978-3-540-30117-2_84__In Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), 831–35. Berlin, Heidelberg: Springer, 2004.https://doi.org/10.1007/978-3-540-30117-2_84 .