The Euclidean algorithm for Gaussian integers. - Heinrich Rolletschek (EUROCAL, 1983)

Closure Properties of Almost-Finiteness Classes in Recursive Function Theory. - Heinrich Rolletschek (J. Symb. Log., 1983)

Arithmetic in Quadratic Fields with Unique Factorization. - Erich L. Kaltofen; Heinrich Rolletschek (European Conference on Computer Algebra (2), 1985)

Complexity of Certain Decision Problems about Congruential Languages. - Paliath Narendran; Colm Ó'Dúnlaing; Heinrich Rolletschek (J. Comput. Syst. Sci., 1985)

Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals. - Franz Winkler 001; Bruno Buchberger; Franz Lichtenberger; Heinrich Rolletschek (ACM Trans. Math. Softw., 1985)

On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Integers. - Heinrich Rolletschek (J. Symb. Comput., 1986)

Shortest Division Chains in Imaginary Quadratic Number Fields. - Heinrich Rolletschek (J. Symb. Comput., 1990)

A Variant of the Notion of Semicreative Set. - Heinrich Rolletschek (Math. Log. Q., 1993)

Some New Lattice Constructions in High R. E. Degrees. - Heinrich Rolletschek (Math. Log. Q., 1995)