Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).”https://doi.org/10.1007/978-3-540-45126-6_12__In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003.https://doi.org/10.1007/978-3-540-45126-6_12 .

Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.”https://doi.org/10.1109/18.556670__IEEE Transactions on Information Theory 42, no. 6 (2002): 1737–44.https://doi.org/10.1109/18.556670 .

Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.”https://doi.org/10.1109/sfcs.1994.365731__In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press, 2002.https://doi.org/10.1109/sfcs.1994.365731 .

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”https://doi.org/10.1109/sfcs.1991.185434__In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002.https://doi.org/10.1109/sfcs.1991.185434 .

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

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”https://doi.org/10.1007/3-540-45022-x_22__In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000.https://doi.org/10.1007/3-540-45022-x_22 .

Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.”https://doi.org/10.1145/301250.301441__In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99. ACM Press, 1999.https://doi.org/10.1145/301250.301441 .

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.

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/3-540-63397-9_5__In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997.https://doi.org/10.1007/3-540-63397-9_5 .

Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.”https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y__Random Structures \'26; Algorithms, no. 4 (1997): 407–19.https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y .

Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence 13, no. 3 (1995).

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.

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

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

Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.”https://doi.org/10.1007/3-540-55488-2_19__In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992.https://doi.org/10.1007/3-540-55488-2_19 .

Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.”https://doi.org/10.1109/sfcs.1992.267807__In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE, 1992.https://doi.org/10.1109/sfcs.1992.267807 .

Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes (Extended Abstract).”https://doi.org/10.1145/109648.109669__In Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91. ACM Press, 1991.https://doi.org/10.1145/109648.109669 .

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”https://doi.org/10.1109/sfcs.1991.185434__In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991.https://doi.org/10.1109/sfcs.1991.185434 .

Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.”https://doi.org/10.1007/bfb0032068__In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990.https://doi.org/10.1007/bfb0032068 .