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