Michael Kalkbrener

According to our database1, Michael Kalkbrener authored at least 14 papers between 1987 and 2016.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Asymptotic behaviour of multivariate default probabilities and default correlations under stress.
J. Appl. Probab., 2016

1999
On the Complexity of Gröbner Bases Conversion.
J. Symb. Comput., 1999

1998
Algorithmic Properties of Polynomial Rings.
J. Symb. Comput., 1998

1997
On the Stability of Gröbner Bases Under Specializations.
J. Symb. Comput., 1997

Converting Bases with the Gröbner Walk.
J. Symb. Comput., 1997

1995
A Generalized Euclidean Algorithm for Geometry Theorem Proving.
Ann. Math. Artif. Intell., 1995

Primitive polynomial remainder sequences in elimination theory.
Appl. Algebra Eng. Commun. Comput., 1995

1994
Prime Decompositions of Radicals in Polynomial Rings.
J. Symb. Comput., 1994

1993
Low Degree Solutions to Linear Equations with K[x] Coefficients.
J. Symb. Comput., 1993

A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties.
J. Symb. Comput., 1993

An Upper Bound on the Number of Monomials in the Sylvester Resultant.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1991
CASA: A Computer Algebra Package for Constructive Algebraic Geometry.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
Solving Systems of Bivariate Algebraic Equations by Using Primitive Polynomial Remainder Sequences.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

1987
Solving systems of algebraic equations by using Gröbner bases.
Proceedings of the EUROCAL '87, 1987


  Loading...