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

J. Blömer, “How to Share a Secret,” in Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.
LibreCat: /record/2986
DOI: 10.1007/978-3-642-15328-0_17

J. Blömer and S. Naewe, “Solving the Closest Vector Problem with respect to Lp Norms,” arXiv:1104.3720. 2011.
LibreCat: /record/2987

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

M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” ACM Trans. Algorithms, no. 4, pp. 59:1--59:26, 2010.
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat: /record/2991

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

W. Schäfer et al., “Engineering self-coordinating software intensive systems,” in Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10, 2010.
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

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

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

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

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

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

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

J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, no. 18, pp. 1648–1665, 2009.
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

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

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

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