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


2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.
LibreCat
 

2011 | Book Chapter | LibreCat-ID: 2986
Blömer, Johannes. “How to Share a Secret.” In Algorithms Unplugged, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-15328-0_17.
LibreCat | DOI
 

2011 | Preprint | LibreCat-ID: 2987
Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.
LibreCat
 

2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13731-0_21.
LibreCat | DOI
 

2010 | Journal Article | LibreCat-ID: 2990
Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.” ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26. https://doi.org/10.1145/1824777.1824779.
LibreCat | DOI
 

2010 | Journal Article | LibreCat-ID: 2991
Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann, and Johannes Blömer. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat
 

2010 | Conference Paper | LibreCat-ID: 2994
Schäfer, Wilhelm, Ansgar Trächtler, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O’Grady, Marco Platzner, Franz Rammig, and Wolfgang Reif. “Engineering Self-Coordinating Software Intensive Systems.” In Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press, 2010. https://doi.org/10.1145/1882362.1882428.
LibreCat | 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
 

2009 | Journal Article | LibreCat-ID: 2999
Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” Theoretical Computer Science, no. 18 (2009): 1648–65. https://doi.org/10.1016/j.tcs.2008.12.045.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3002 | OA
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.)
 

2007 | Book Chapter | LibreCat-ID: 3020
Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_2.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45537-x_26.
LibreCat | 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
 

2006 | Journal Article | LibreCat-ID: 3003
Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal of Universal Computer Science (J.UCS), no. 6 (2006): 654--671. https://doi.org/10.3217/jucs-012-06-0654.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3004
Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_11.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3005
Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In Lecture Notes in Computer Science, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_2.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3007
Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” In Lecture Notes in Computer Science, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_4.
LibreCat | Files available | 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
 

2004 | Book Chapter | LibreCat-ID: 3011
Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30564-4_5.
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
 

Filters and Search Terms

(person=23)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed