Blömer, J., &; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-45126-6_12 

Albanese, A., Blömer, J., Edmonds, J., Luby, M., &; Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744.https://doi.org/10.1109/18.556670 

Albanese, A., Blömer, J., Edmonds, J., Luby, M., &; Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press.https://doi.org/10.1109/sfcs.1994.365731 

Blömer, J. (2002). Computing sums of radicals in polynomial time. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.https://doi.org/10.1109/sfcs.1991.185434 

Blömer, J. (2002). Denesting by Bounded Degree Radicals. Algorithmica, 28(1), 2–15.https://doi.org/10.1007/s004530010028 

Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45022-x_22 

Blömer, J., &; Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99.https://doi.org/10.1145/301250.301441 

Blömer, J., &; Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.

Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-63397-9_5 

Blömer, J., Karp, R., &; Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \'26; Algorithms, (4), 407–419.https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y 

Alt, H., Behrends, B., &; Blömer, J. (1995). Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 13(3).

Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., &; Zuckerman, D. (1995). An XOR-based erasure-resilient coding scheme. Berkeley, USA.

Blömer, J. (1993). On Kummer theory and the number of roots of unity in radical extensions of Q. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik.

Blömer, J. (1992). Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik.

Alt, H., &; Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In Data structures and efficient algorithms (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-55488-2_19 

Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE.https://doi.org/10.1109/sfcs.1992.267807 

Alt, H., Behrends, B., &; Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91. ACM Press.https://doi.org/10.1145/109648.109669 

Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press.https://doi.org/10.1109/sfcs.1991.185434 

Alt, H., Blömer, J., &; Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag.https://doi.org/10.1007/bfb0032068