J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.

A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.

A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002.

J. Blömer, “Computing sums of radicals in polynomial time,”10.1109/sfcs.1991.185434__2002, doi:10.1109/sfcs.1991.185434 .

J. Blömer, “Denesting by Bounded Degree Radicals,”10.1007/s004530010028__Algorithmica, vol. 28, no. 1, pp. 2–15, 2002, doi:10.1007/s004530010028 .

J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.

J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,”10.1145/301250.301441__1999, doi:10.1145/301250.301441 .

J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss resilient codes,” Technical report/Departement of Computer Science, ETH Zürich, 1998.

J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.

J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \'26; Algorithms, no. 4, pp. 407–419, 1997.

H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.

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

J. Blömer, 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, 1993.

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

H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.

J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.

H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes (extended abstract),” in Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91, 1991.

J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.

H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.