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.
109 Publications
2017 | Book Chapter | LibreCat-ID: 2381
Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” In Lecture Notes in Computer Science, edited by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27. Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-57586-5_11.
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3049
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991. https://doi.org/10.1109/sfcs.1991.185434.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1991.185434.
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3015
May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-28628-8_13.
LibreCat
| DOI
2014 | Preprint | LibreCat-ID: 442 | 
Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.” Universität Paderborn, 2014.
LibreCat
| Files available
| Download (ext.)
2016 | Conference Paper | LibreCat-ID: 208
Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” In Proceedings of the CT-RSA 2016, 431–47. LNCS, 2016. https://doi.org/10.1007/978-3-319-29485-8_25.
LibreCat
| Files available
| DOI
2009 | Book Chapter | LibreCat-ID: 2995
Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. https://doi.org/10.1137/1.9781611973068.118.
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 4344
Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.” In 29th International Symposium on Algorithms and Computation (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3019
May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45708-9_16.
LibreCat
| DOI
2021 | Preprint | LibreCat-ID: 26645 |
Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.
LibreCat
| Download (ext.)
Filters and Search Terms
(department=64) AND (type=book OR type=book_editor OR type=book_chapter OR type=publicationtype_review OR type=conference_abstract OR type=conference_editor OR type=conference OR type=dissertation OR type=encyclopedia_article OR type=journal_article OR type=journal_editor OR type=newspaper_article OR type=patent OR type=preprint OR type=report OR type=translation OR type=translation_chapter OR type=working_paper OR type=research_data)