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

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

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

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

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

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

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

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

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