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 
LibreCat: /record/3014
DOI: 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 
LibreCat: /record/3015
DOI: 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 
LibreCat: /record/18778
DOI: 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 
LibreCat: /record/18263
DOI: 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 
LibreCat: /record/18279
DOI: 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 
LibreCat: /record/16474
DOI: 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 
LibreCat: /record/13618
DOI: 10.1007/978-3-540-30117-2_84

Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies, 2625.https://doi.org/10.1007/3-540-36574-5_12 
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

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 
LibreCat: /record/3016
DOI: 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 
LibreCat: /record/3018
DOI: 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 
LibreCat: /record/18196
DOI: 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 
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

Dellnitz, M., &; Preis, R. (2003). Congestion and Almost Invariant Sets in Dynamical Systems. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45084-x_8 
LibreCat: /record/16543
DOI: 10.1007/3-540-45084-x_8

Schütze, O. (2003). A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-36970-8_36 
LibreCat: /record/16664
DOI: 10.1007/3-540-36970-8_36

Schütze, O., Mostaghim, S., Dellnitz, M., &; Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-36970-8_9 
LibreCat: /record/16665
DOI: 10.1007/3-540-36970-8_9

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 
LibreCat: /record/15077
DOI: 10.1007/978-3-540-39403-7_30

Böttcher, S., &; Steinmetz, R. (2003). A DTD Graph Based XPath Query Subsumption Test. In Database and XML Technologies, First International XML Database Symposium, XSym 2003 (pp. 85–99). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-39429-7_6 
LibreCat: /record/15078
DOI: 10.1007/978-3-540-39429-7_6

Steiger, C., Walder, H., &; Platzner, M. (2003). Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL) (pp. 575–584). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-45234-8_56 
LibreCat: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG) (pp. 413–420). Berlin, Heidelberg.https://doi.org/10.1007/3-540-36379-3_36 
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

Grünewald, M., Lukovszki, T., Schindelhauer, C., &; Volbert, K. (2002). Distributed Maintenance of Resource Efficient Wireless Network Topologies. Proceedings of the 8th International Euro-Par Conference.https://doi.org/10.1007/3-540-45706-2_134 
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

Hahn, O., Koyro, M., &; Meschut, G. (2002). Lipirea în combinatie cu îmbinarile obtinute prin deformare. Sudura, 2, 10–13.
LibreCat: /record/21050

Adler, M., Räcke, H., Sivadasan, N., Sohler, C., &; Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45465-9_77 
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., &; Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45706-2_133 
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

Meschut, G. (2001). Hybridfügen – Grundlagen, Technologie, Anwendungen. In DVM-Bericht 668 (Vol. 668, pp. 119–134). Berlin.
LibreCat: /record/21009

Czumaj, A., &; Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 493–505.https://doi.org/10.1007/3-540-48224-5_41 
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

Lukovszki, T., Maheshwari, A., &; Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS.https://doi.org/10.1007/3-540-45294-x_21 
LibreCat: /record/18964
DOI: 10.1007/3-540-45294-x_21

Ziegler, M., &; Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45335-0_23 
LibreCat: /record/18152
DOI: 10.1007/3-540-45335-0_23

Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45477-2_2 
LibreCat: /record/16493
DOI: 10.1007/3-540-45477-2_2

Meyer auf der Heide, F., &; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45718-6_68 
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

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

Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45022-x_22 
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Czumaj, A., Sohler, C., &; Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-45253-2_15 
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Fromme, J., Ganguin, S., Iske, S., Meister, D. M., &; Sander, U. (Eds.). (2000). Medienbildung und Gesellschaft. VS Verlag.
LibreCat: /record/18121

Ziegler, M., &; Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-44411-4_34 
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Meyer auf der Heide, F., Kutyowski, M., &; Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/3-540-44520-x_59 
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Simon, J., Reinefeld, A., &; Heinz, O. (1999). Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI. In H. Hellwagner &; A. Reinefeld (Eds.), SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters (Vol. 1734, pp. 367–381). Berlin / Heidelberg: Springer.https://doi.org/10.1007/10704208 
LibreCat: /record/2435
DOI: 10.1007/10704208

Koyro, M., &; Meschut, G. (1999). 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 (pp. 173–184).
LibreCat: /record/20992

Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204).https://doi.org/10.1007/3-540-48447-7_20 
LibreCat: /record/18959
DOI: 10.1007/3-540-48447-7_20

Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg.https://doi.org/10.1007/3-540-48481-7_9 
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Eisenring, M., Platzner, M., &; Thiele, L. (1999). Communication Synthesis for Reconfigurable Embedded Systems. In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL) (Vol. 1673, pp. 205–214). Springer.https://doi.org/10.1007/978-3-540-48302-1_21 
LibreCat: /record/13608
DOI: 10.1007/978-3-540-48302-1_21

Fischer, M., Lukovszki, T., &; Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg.https://doi.org/10.1007/3-540-68530-8_14 
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

Meyer auf der Heide, F., &; Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg.https://doi.org/10.1007/bfb0054332 
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Platzner, M., &; De Micheli, G. (1998). Acceleration of satisfiability algorithms by reconfigurable hardware. In Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL)  (pp. 69–78). Berlin, Heidelberg: Springer .https://doi.org/10.1007/bfb0055234 
LibreCat: /record/13606
DOI: 10.1007/bfb0055234

Czumaj, A., &; Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97).https://doi.org/10.1007/3-540-63397-9_9 
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-63397-9_5 
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Fischer, M., Meyer auf der Heide, F., &; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. 5th Annual European Symposium on Algorithms (ESA ’97), 1284, 1157–1170.https://doi.org/10.1007/3-540-63397-9_13 
LibreCat: /record/16568
DOI: 10.1007/3-540-63397-9_13

Meyer auf der Heide, F., &; Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/bfb0002716 
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Bäumker, A., &; Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg.https://doi.org/10.1007/3-540-63138-0_21 
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

Karaivazoglou, E., &; Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/bfb0002741 
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Kleine Büning, H., &; Lettmann, T. (1996). Learning a representation for optimizable formulas. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-61863-5_33 
LibreCat: /record/19816
DOI: 10.1007/3-540-61863-5_33