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
2020 | Journal Article | LibreCat-ID: 20888
Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.” ACM Transactions on Algorithms 16, no. 4 (2020): 1–25. https://doi.org/10.1145/3409385.
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-24632-9_1.
LibreCat
| Files available
| DOI
2023 | Conference Paper | LibreCat-ID: 43458 | 
Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023.
LibreCat
| Download (ext.)
1998 | Journal Article | LibreCat-ID: 3028
Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat
| Files available
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” In Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03. ACM Press, 2004. https://doi.org/10.1145/948109.948151.
LibreCat
| DOI
2014 | Conference Paper | LibreCat-ID: 463
Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 123--136, 2014. https://doi.org/10.1109/FDTC.2014.22.
LibreCat
| Files available
| DOI
2007 | Book Chapter | LibreCat-ID: 3026
Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-68530-8_13.
LibreCat
| DOI
2016 | Conference Paper | LibreCat-ID: 2367
Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.” In 2016 IEEE 16th International Conference on Data Mining (ICDM), 805–10. IEEE, 2016. https://doi.org/10.1109/icdm.2016.0094.
LibreCat
| DOI
2014 | Conference Paper | LibreCat-ID: 2977
Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” In 2014 22nd International Conference on Pattern Recognition. IEEE, 2014. https://doi.org/10.1109/icpr.2014.253.
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_15.
LibreCat
| Files available
| DOI
2016 | Book Chapter | LibreCat-ID: 2970
Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31750-2_24.
LibreCat
| DOI
2016 | Book Chapter | LibreCat-ID: 2978
Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31750-2_24.
LibreCat
| DOI
2011 | Dissertation | LibreCat-ID: 2910
Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.
LibreCat
| Download (ext.)
2009 | Dissertation | LibreCat-ID: 2911
Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.
LibreCat
| Download (ext.)
2013 | Report | LibreCat-ID: 2917
Juhnke, Jakob, Hanno Lefmann, and Volker Strehl. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI, 2013.
LibreCat
1995 | Report | LibreCat-ID: 3038
Blömer, Johannes, Malik Kalfane, Richard Karp, Marek Karpinski, Michael Luby, and David Zuckerman. An XOR-Based Erasure-Resilient Coding Scheme. Technical Report, International Computer Science Institute. Berkeley, USA, 1995.
LibreCat
| Files available
2014 | Journal Article | LibreCat-ID: 2976
Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.” Algorithmica 69 (2014). https://doi.org/10.1007/s00453-012-9717-4.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3002 |
Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.” In Selected Areas in Cryptography, 96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/978-3-540-77360-3_7.
LibreCat
| DOI
| Download (ext.)
2015 | Conference Paper | LibreCat-ID: 322 |
Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015. https://doi.org/10.1007/978-3-662-47854-7_29.
LibreCat
| Files available
| DOI
| Download (ext.)
1995 | Journal Article | LibreCat-ID: 3037
Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence 13, no. 3 (1995).
LibreCat
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)