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 .

Hahn, O., M. Koyro, and Gerson Meschut. “Lipirea În Combinatie Cu Îmbinarile Obtinute Prin Deformare.” Sudura 2 (2002): 10–13.

Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.”https://doi.org/10.1007/3-540-45465-9_77__In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-45465-9_77 .

Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.”https://doi.org/10.1007/3-540-45706-2_133__In Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-45706-2_133 .

Meschut, Gerson. “Hybridfügen – Grundlagen, Technologie, Anwendungen.” In DVM-Bericht 668, 668:119–34. Berlin, 2001.

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.”https://doi.org/10.1007/3-540-48224-5_41__Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, 493–505.https://doi.org/10.1007/3-540-48224-5_41 .

Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”https://doi.org/10.1007/3-540-45294-x_21__In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.https://doi.org/10.1007/3-540-45294-x_21 .

Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.”https://doi.org/10.1007/3-540-45335-0_23__In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45335-0_23 .

Meyer auf der Heide, Friedhelm. “Data Management in Networks.”https://doi.org/10.1007/3-540-45477-2_2__In Graph-Theoretic Concepts in Computer Science, Vol. 2204.https://doi.org/10.1007/3-540-45477-2_2__Lecture Notes in Computer Science. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45477-2_2 .

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.”https://doi.org/10.1007/3-540-45718-6_68__In Computational Science - ICCS 2001. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45718-6_68 .

Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.https://doi.org/10.1007/3-540-44676-1 .

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”https://doi.org/10.1007/3-540-45022-x_22__In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000.https://doi.org/10.1007/3-540-45022-x_22 .

Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.”https://doi.org/10.1007/3-540-45253-2_15__In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-45253-2_15 .

Fromme, J., S. Ganguin, S. Iske, Dorothee M. Meister, and U. Sander, eds. Medienbildung und Gesellschaft. VS Verlag, 2000.

Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.”https://doi.org/10.1007/3-540-44411-4_34__In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-44411-4_34 .

Meyer auf der Heide, Friedhelm, Mirosaw Kutyowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.”https://doi.org/10.1007/3-540-44520-x_59__In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000.https://doi.org/10.1007/3-540-44520-x_59 .

Simon, Jens, Alexander Reinefeld, and Oliver Heinz. “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI.”https://doi.org/10.1007/10704208__In SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, edited by Hermann Hellwagner and Alexander Reinefeld, 1734:367–81. Lecture Notes in Computer Science (LNCS). Berlin / Heidelberg: Springer, 1999.https://doi.org/10.1007/10704208 .

Koyro, M., and Gerson Meschut. “Eine Quasistationäre Meßmethode Zur Ermittlung Der Wärmeleitfähigkeit Polymerer Zwischenschichten in Abhängigkeit von Der Temperatur.” In Tagungsband Zur Veranstaltung Werkstoffprüfung 1999, 173–84, 1999.

Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.”https://doi.org/10.1007/3-540-48447-7_20__In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999.https://doi.org/10.1007/3-540-48447-7_20 .

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”https://doi.org/10.1007/3-540-48481-7_9__In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999.https://doi.org/10.1007/3-540-48481-7_9 .

Eisenring, Michael, Marco Platzner, and Lothar Thiele. “Communication Synthesis for Reconfigurable Embedded Systems.”https://doi.org/10.1007/978-3-540-48302-1_21__In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), 1673:205–14. LCS. Springer, 1999.https://doi.org/10.1007/978-3-540-48302-1_21 .