Ackermann, M. R., Blömer, J., &; Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.

Blömer, J. (2011). How to Share a Secret. In Algorithms Unplugged (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-15328-0_17 

Blömer, J., &; Naewe, S. (2011). Solving the Closest Vector Problem with respect to Lp Norms. ArXiv:1104.3720.

Ackermann, M. R., &; Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-13731-0_21 

Ackermann, M. R., Blömer, J., &; Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26.https://doi.org/10.1145/1824777.1824779 

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

Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G.,https://doi.org/10.1145/1882362.1882428__Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press.https://doi.org/10.1145/1882362.1882428 

Ackermann, M. R., &; Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611973068.118 

Blömer, J., &; Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, (18), 1648–1665.https://doi.org/10.1016/j.tcs.2008.12.045 

Blömer, J., &; Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-77360-3_7 

Blömer, J., &; May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-44670-2_2 

Blömer, J., &; May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45537-x_26 

Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-68530-8_13 

Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (J.UCS), (6), 654--671.https://doi.org/10.3217/jucs-012-06-0654 

Blömer, J., &; Krummel, V. (2006). Fault Based Collision Attacks on AES. In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11889700_11 

Blömer, J., &; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11889700_2 

Blömer, J., Otto, M., &; Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11889700_4 

Blömer, J., &; May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11426639_15 

Blömer, J., Guajardo, J., &; Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-30564-4_5 

Blömer, J., &; May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-24632-9_1