Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.”10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4, 2010, pp. 59:1--59:26, doi:10.1145/1824777.1824779.

Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.

Schrieb, Jonas. Efficient and Compact CCA Security from Partitioned IBKEM. 2010.

Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive Systems.”10.1145/1882362.1882428__Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010, doi:10.1145/1882362.1882428.

Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.

Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.”10.1137/1.9781611973068.118__Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:10.1137/1.9781611973068.118.

Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.”10.1016/j.tcs.2008.12.045__Theoretical Computer Science, no. 18, 2009, pp. 1648–65, doi:10.1016/j.tcs.2008.12.045.

Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.”10.1007/978-3-642-05089-3_8__FM 2009: Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.

Stern, Claudius, et al. “Reliable Evidence of Data Integrity from an Untrusted Storage Service.”10.1109/icns.2008.28__Fourth International Conference on Networking and Services (Icns 2008), IEEE, 2008, doi:10.1109/icns.2008.28.

Krummel, Volker. Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn, 2007.

Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.”10.1007/978-3-540-77360-3_7__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 96–109, doi:10.1007/978-3-540-77360-3_7.

May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”10.1007/3-540-45708-9_16__Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, 2007, pp. 242–56, doi:10.1007/3-540-45708-9_16.

Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”10.1007/3-540-44670-2_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.

Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”10.1007/3-540-45537-x_26__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.

May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.”10.1007/3-540-44670-2_10__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:10.1007/3-540-44670-2_10.

Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.”10.1007/3-540-68530-8_13__Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.

Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.”10.3217/jucs-012-06-0654__Journal of Universal Computer Science (J.UCS), no. 6, 2006, pp. 654--671, doi:10.3217/jucs-012-06-0654.

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”10.1007/11889700_11__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:10.1007/11889700_11.

Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.”10.1007/11889700_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.

Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”10.1007/11889700_4__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:10.1007/11889700_4.