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

Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. IEEE Transactions on Information Theory. 2002;42(6):1737-1744. doi:10.1109/18.556670
LibreCat: /record/3034
DOI: 10.1109/18.556670

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

Blömer J. Computing sums of radicals in polynomial time. In: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 2002. doi:10.1109/sfcs.1991.185434
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

Blömer J. Denesting by Bounded Degree Radicals. Algorithmica. 2002;28(1):2-15. doi:10.1007/s004530010028
LibreCat: /record/35857
DOI: 10.1007/s004530010028

Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Blömer J, Seifert J-P. On the complexity of computing short linearly independent vectors and short bases in a lattice. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99. ACM Press; 1999. doi:10.1145/301250.301441
LibreCat: /record/3024
DOI: 10.1145/301250.301441

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

Blömer J. Denesting by bounded degree radicals. In: Algorithms — ESA ’97. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:10.1007/3-540-63397-9_5
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

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

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

Blömer J, Kalfane M, Karp R, Karpinski M, Luby M, Zuckerman D. An XOR-Based Erasure-Resilient Coding Scheme. Berkeley, USA; 1995.
LibreCat: /record/3038

Blömer J. 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.
LibreCat: /record/3045

Blömer J. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik; 1992.
LibreCat: /record/3043

Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:10.1007/3-540-55488-2_19
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

Blömer J. How to denest Ramanujan’s nested radicals. In: Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE; 1992. doi:10.1109/sfcs.1992.267807
LibreCat: /record/3047
DOI: 10.1109/sfcs.1992.267807

Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes (extended abstract). In: Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91. ACM Press; 1991. doi:10.1145/109648.109669
LibreCat: /record/3048
DOI: 10.1145/109648.109669

Blömer J. Computing sums of radicals in polynomial time. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 1991. doi:10.1109/sfcs.1991.185434
LibreCat: /record/3049
DOI: 10.1109/sfcs.1991.185434

Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068
LibreCat: /record/3050
DOI: 10.1007/bfb0032068