Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat: /record/3037

Blömer, Johannes, et al. An XOR-Based Erasure-Resilient Coding Scheme. 1995.
LibreCat: /record/3038

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.
LibreCat: /record/3045

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

Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.”10.1007/3-540-55488-2_19__Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, 1992, pp. 1–24, doi:10.1007/3-540-55488-2_19.
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.”10.1109/sfcs.1992.267807__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, Helmut, et al. “Approximate Matching of Polygonal Shapes (Extended Abstract).”10.1145/109648.109669__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, Johannes. “Computing Sums of Radicals in Polynomial Time.”10.1109/sfcs.1991.185434__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, Helmut, et al. “Approximation of Convex Polygons.”10.1007/bfb0032068__Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.
LibreCat: /record/3050
DOI: 10.1007/bfb0032068