Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
79 Publications
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT 2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 2965
Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853
LibreCat
| Files available
| DOI
2010 | Journal Article | LibreCat-ID: 2990
Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance Measures. ACM Trans Algorithms. 2010;(4):59:1--59:26. doi:10.1145/1824777.1824779
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3049
Blömer J. Computing sums of radicals in polynomial time. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 1991. doi:10.1109/sfcs.1991.185434
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer J. Computing sums of radicals in polynomial time. In: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 2002. doi:10.1109/sfcs.1991.185434
LibreCat
| Files available
| DOI
2014 | Preprint | LibreCat-ID: 442 | 
Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. 2014.
LibreCat
| Files available
| Download (ext.)
2016 | Conference Paper | LibreCat-ID: 208
Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: Proceedings of the CT-RSA 2016. LNCS. ; 2016:431-447. doi:10.1007/978-3-319-29485-8_25
LibreCat
| Files available
| DOI
2009 | Book Chapter | LibreCat-ID: 2995
Ackermann MR, Blömer J. 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:1088-1097. doi:10.1137/1.9781611973068.118
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 4344
Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:10.4230/LIPIcs.ISAAC.2018.46
LibreCat
| DOI