Böttcher, Stefan, and Rita Steinmetz. “Detecting Privacy Violations in Sensitive XML Databases.”10.1007/11552338_10__Secure Data Management, Second VLDB Workshop, SDM 2005, Springer, 2005, pp. 143–54, doi:10.1007/11552338_10.
LibreCat: /record/15156
DOI: 10.1007/11552338_10

Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”10.1007/978-3-540-30217-9_4__Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.
LibreCat: /record/19692
DOI: 10.1007/978-3-540-30217-9_4

Blömer, Johannes, et al. “Provably Secure Masking of AES.”10.1007/978-3-540-30564-4_5__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.
LibreCat: /record/3011
DOI: 10.1007/978-3-540-30564-4_5

Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”10.1007/978-3-540-24632-9_1__Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:10.1007/978-3-540-24632-9_1.
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

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

May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.”10.1007/978-3-540-28628-8_13__Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, 2004, pp. 213–19, doi:10.1007/978-3-540-28628-8_13.
LibreCat: /record/3015
DOI: 10.1007/978-3-540-28628-8_13

Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.”10.1007/978-3-540-30140-0_25__Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004, doi:10.1007/978-3-540-30140-0_25.
LibreCat: /record/18778
DOI: 10.1007/978-3-540-30140-0_25

Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.”10.1007/978-3-540-30140-0_49__Proc. 12th Annual Symposium on Algorithms (ESA’04), vol. 3221, Springer, 2004, pp. 544–55, doi:10.1007/978-3-540-30140-0_49.
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49

Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.”10.1007/978-3-540-30551-4_69__Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69.
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

Bansal, Vikas, et al. “Labeling Smart Dust.”10.1007/978-3-540-30140-0_9__12th Annual European Symposium on Algorithms (ESA 2004), vol. 3221, 2004, doi:10.1007/978-3-540-30140-0_9.
LibreCat: /record/16474
DOI: 10.1007/978-3-540-30140-0_9

Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable Hardware Operating Systems.”10.1007/978-3-540-30117-2_84__Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), Springer, 2004, pp. 831–35, doi:10.1007/978-3-540-30117-2_84.
LibreCat: /record/13618
DOI: 10.1007/978-3-540-30117-2_84

Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.”10.1007/3-540-36574-5_12__Algorithms for Memory Hierarchies, vol. 2625, 2003, doi:10.1007/3-540-36574-5_12.
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.”10.1007/978-3-540-45146-4_2__Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.
LibreCat: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).”10.1007/978-3-540-45126-6_12__Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12.
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”10.1007/978-3-540-24587-2_72__Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–15, doi:10.1007/978-3-540-24587-2_72.
LibreCat: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

Ziegler, Martin. “Fast Relative Approximation of Potential Fields.”10.1007/978-3-540-45078-8_13__Lecture Notes in Computer Science, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:10.1007/978-3-540-45078-8_13.
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.”10.1007/3-540-45084-x_8__Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-45084-x_8.
LibreCat: /record/16543
DOI: 10.1007/3-540-45084-x_8

Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.”10.1007/3-540-36970-8_36__Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-36970-8_36.
LibreCat: /record/16664
DOI: 10.1007/3-540-36970-8_36

Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.”10.1007/3-540-36970-8_9__Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-36970-8_9.
LibreCat: /record/16665
DOI: 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.”10.1007/978-3-540-39403-7_30__Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–10, doi:10.1007/978-3-540-39403-7_30.
LibreCat: /record/15077
DOI: 10.1007/978-3-540-39403-7_30