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

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 
LibreCat: /record/2986
DOI: 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.
LibreCat: /record/2987

Liske, G. (2011). Fault attacks in pairing-based cryptography. Universität Paderborn.
LibreCat: /record/659

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 
LibreCat: /record/2988
DOI: 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 
LibreCat: /record/2990
DOI: 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.
LibreCat: /record/2991

Schrieb, J. (2010). Efficient and Compact CCA Security from Partitioned IBKEM.
LibreCat: /record/2993

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 
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

Postler, T. (2010). Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung.
LibreCat: /record/47684

Schröer, C. (2009). Hierarchisches Clustering mit minimalen Cluster-Durchmessern.
LibreCat: /record/2880

Liske, G. (2009). Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens.
LibreCat: /record/2896

Scholz, C. (2009). Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen.
LibreCat: /record/2904

Ackermann, M. R. (2009). Algorithms for the Bregman k-Median Problem. Universität Paderborn.
LibreCat: /record/2911

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 
LibreCat: /record/2995
DOI: 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 
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

Schrieb, J., Wehrheim, H., &; Wonisch, D. (2009). Three-Valued Spotlight Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-05089-3_8 
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

Stern, C., Adelt, P., Krummel, V., &; Ackermann, M. R. (2008). Reliable Evidence of Data Integrity from an Untrusted Storage Service. In Fourth International Conference on Networking and Services (icns 2008). IEEE.https://doi.org/10.1109/icns.2008.28 
LibreCat: /record/3001
DOI: 10.1109/icns.2008.28

Schrieb, J. (2008). Construction and Applications of Identity-Based Encryption without Pairings.
LibreCat: /record/47685

Krummel, V. (2007). Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn.
LibreCat: /record/2912