Solving systems of algebraic equations by using Gröbner bases. - Michael Kalkbrener (EUROCAL, 1987)

Solving Systems of Bivariate Algebraic Equations by Using Primitive Polynomial Remainder Sequences. - Michael Kalkbrener (ISSAC, 1990)

CASA: A Computer Algebra Package for Constructive Algebraic Geometry. - R. Gebauer; Michael Kalkbrener; B. Wall; Franz Winkler 001 (ISSAC, 1991)

An Upper Bound on the Number of Monomials in the Sylvester Resultant. - Michael Kalkbrener (ISSAC, 1993)

A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties. - Michael Kalkbrener (J. Symb. Comput., 1993)

Low Degree Solutions to Linear Equations with K[x] Coefficients. - Michael Kalkbrener; Moss Sweedler; L. Taylor (J. Symb. Comput., 1993)

Prime Decompositions of Radicals in Polynomial Rings. - Michael Kalkbrener (J. Symb. Comput., 1994)

Primitive polynomial remainder sequences in elimination theory. - Michael Kalkbrener (Appl. Algebra Eng. Commun. Comput., 1995)

A Generalized Euclidean Algorithm for Geometry Theorem Proving. - Michael Kalkbrener (Ann. Math. Artif. Intell., 1995)

Converting Bases with the Gröbner Walk. - Stéphane Collart; Michael Kalkbrener; Daniel Mall (J. Symb. Comput., 1997)

On the Stability of Gröbner Bases Under Specializations. - Michael Kalkbrener (J. Symb. Comput., 1997)

Algorithmic Properties of Polynomial Rings. - Michael Kalkbrener (J. Symb. Comput., 1998)

On the Complexity of Gröbner Bases Conversion. - Michael Kalkbrener (J. Symb. Comput., 1999)

Asymptotic behaviour of multivariate default probabilities and default correlations under stress. - Natalie Packham; Michael Kalkbrener; Ludger Overbeck (J. Appl. Probab., 2016)