Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Petrafcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).”https://doi.org/10.1007/11682462_34__In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11682462_34 .

Dynia, M., J. Kutyowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.”https://doi.org/10.1007/11821069_29__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11821069_29 .

Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.”https://doi.org/10.1007/11788911_27__In Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 266–69. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11788911_27 .

Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.”https://doi.org/10.1007/11844662_12__In Secure Data Management, Third VLDB Workshop, SDM 2006, 160–74. Springer, 2006.https://doi.org/10.1007/11844662_12 .

Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.”https://doi.org/10.1007/11792086_4__In Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11792086_4 .

Geiselmann, Willi, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, and Rainer Steinwandt. “A Simpler Sieving Device: Combining ECM and TWIRL.”https://doi.org/10.1007/11927587_12__In Information Security and Cryptology – ICISC 2006. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11927587_12 .

Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.”https://doi.org/10.1007/11561354_21__In Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), 3738:244–57, 2005.https://doi.org/10.1007/11561354_21 .

Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.”https://doi.org/10.1007/11561354_23__In Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005), 271–84. 3738, 2005.https://doi.org/10.1007/11561354_23 .

Loeser, Chris, Gunnar Schomaker, André Brinkmann, Mario Vodisek, and Michael Heidebuer. “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts.”https://doi.org/10.1007/978-3-540-31957-3_90__In Proceedings of the 4th International Conference on Networking, 3421:800–810. Berlin, Heidelberg, 2005.https://doi.org/10.1007/978-3-540-31957-3_90 .

Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.”https://doi.org/10.1007/11426639_15__In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.https://doi.org/10.1007/11426639_15 .

Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.”https://doi.org/10.1007/11426639_22__In EUROCRYPT 2005, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.https://doi.org/10.1007/11426639_22 .

Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.”https://doi.org/10.1007/11561071_5__In Algorithms – ESA 2005. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11561071_5 .

Meschut, Gerson. “Mischbauweise Sorgt Für Frischen Wind.” Konstruktion 04 (2005): 92–93.

Bdoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.”https://doi.org/10.1007/11523468_70__In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 866–77. Berlin, Heidelberg, 2005.https://doi.org/10.1007/11523468_70 .

Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.”https://doi.org/10.1007/11561071_67__In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:758–69. Berlin, Heidelberg: Springer, 2005.https://doi.org/10.1007/11561071_67 .

Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.”https://doi.org/10.1007/11549468_105__In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg, 2005.https://doi.org/10.1007/11549468_105 .

Bienkowski, Marcin, and Jarosaw Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.”https://doi.org/10.1007/11561071_72__In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:815–26. Berlin, Heidelberg: Springer , 2005.https://doi.org/10.1007/11561071_72 .

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 .

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 .

Steiger, Christoph, Herbert Walder, and Marco Platzner. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.”https://doi.org/10.1007/978-3-540-45234-8_56__In Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), 575–84. Berlin, Heidelberg: Springer, 2003.https://doi.org/10.1007/978-3-540-45234-8_56 .

Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.”https://doi.org/10.1007/3-540-36379-3_36__In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-36379-3_36 .

Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”https://doi.org/10.1007/3-540-45706-2_134__In Proceedings of the 8th International Euro-Par Conference. Paderborn, Germany, 2002.https://doi.org/10.1007/3-540-45706-2_134 .