Clustering for Metric and Nonmetric Distance Measures
M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.

On the initialization of dynamic models for speech features
A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, J. Blömer, Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany (2010).

Efficient and Compact CCA Security from Partitioned IBKEM
J. Schrieb, (2010).

Engineering self-coordinating software intensive systems
W. Schäfer, A. Trächtler, M. Birattari, J. Blömer, M. Dorigo, G. Engels, R. O’Grady, M. Platzner, F. Rammig, W. Reif, in: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010.

Algorithms for the Bregman k-Median Problem
M.R. Ackermann, Algorithms for the Bregman K-Median Problem, Universität Paderborn, 2009.

Coresets and Approximate Clustering for Bregman Divergences
M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.

Sampling methods for shortest vectors, closest vectors and successive minima
J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.

Three-Valued Spotlight Abstractions
J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.

Reliable Evidence of Data Integrity from an Untrusted Storage Service
C. Stern, P. Adelt, V. Krummel, M.R. Ackermann, in: Fourth International Conference on Networking and Services (Icns 2008), IEEE, 2008.

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

Analysis of Countermeasures Against Access Driven Cache Attacks on AES
J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.

Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.

Low Secret Exponent RSA Revisited
J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.

Key Revocation with Interval Cover Families
J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341.

Dimension Reduction Methods for Convolution Modular Lattices
A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.

A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.

Randomness and Secrecy - A Brief Introduction
J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.

Fault Based Collision Attacks on AES
J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.

Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered
J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.

Sign Change Fault Attacks on Elliptic Curve Cryptosystems
J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.