 | 1999 |
|---|
| 13 |       | Michael Kalkbrener:
On the Complexity of Gröbner Bases Conversion.
J. Symb. Comput. 28(1-2): 265-273 (1999) |
| 1998 |
|---|
| 12 | | Michael Kalkbrener:
Algorithmic Properties of Polynomial Rings.
J. Symb. Comput. 26(5): 525-581 (1998) |
| 1997 |
|---|
| 11 | | Michael Kalkbrener:
On the Stability of Gröbner Bases Under Specializations.
J. Symb. Comput. 24(1): 51-58 (1997) |
| 10 | | Stéphane Collart,
Michael Kalkbrener,
Daniel Mall:
Converting Bases with the Gröbner Walk.
J. Symb. Comput. 24(3/4): 465-469 (1997) |
| 1995 |
|---|
| 9 | | Michael Kalkbrener:
A Generalized Euclidean Algorithm for Geometry Theorem Proving.
Ann. Math. Artif. Intell. 13(1-2): 73-96 (1995) |
| 8 | | Michael Kalkbrener:
Primitive Polynomial Remainder Sequences in Elimination Theory.
Appl. Algebra Eng. Commun. Comput. 6: 56-79 (1995) |
| 1994 |
|---|
| 7 | | Michael Kalkbrener:
Prime Decompositions of Radicals in Polynomial Rings.
J. Symb. Comput. 18(4): 365-372 (1994) |
| 1993 |
|---|
| 6 |  | Michael Kalkbrener:
An Upper Bound on the Number of Monomials in the Sylvester Resultant.
ISSAC 1993: 161-163 |
| 5 | | Michael Kalkbrener:
A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties.
J. Symb. Comput. 15(2): 143-167 (1993) |
| 4 | | Michael Kalkbrener,
Moss Sweedler,
L. Taylor:
Low Degree Solutions to Linear Equations with K[x] Coefficients.
J. Symb. Comput. 16(1): 75-81 (1993) |
| 1991 |
|---|
| 3 | | R. Gebauer,
Michael Kalkbrener,
B. Wall,
Franz Winkler:
CASA: A Computer Algebra Package for Constructive Algebraic Geometry.
ISSAC 1991: 403-410 |
| 1990 |
|---|
| 2 | | Michael Kalkbrener:
Solving Systems of Bivariate Algebraic Equations by Using Primitive Polynomial Remainder Sequences.
ISSAC 1990: 295 |
| 1987 |
|---|
| 1 | | Michael Kalkbrener:
Solving systems of algebraic equations by using Gröbner bases.
EUROCAL 1987: 282-292 |
