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

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

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

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

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

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

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).
LibreCat: /record/2991

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

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

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

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

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

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

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

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.
LibreCat: /record/2995
DOI: 10.1137/1.9781611973068.118

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

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

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.
LibreCat: /record/3001
DOI: 10.1109/icns.2008.28

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

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