Bibliography

1

W. W. Adams, P. Loustaunau.
An Introduction to Grobner Bases.
Graduate Studies in Mathematics, Volume 3, AMS, 1994.

2

T. Becker, V. Weispfenning
Grbner Bases: A Computational Approach to Commutative Algebra.
Graduate Studies in Mathematics, Volume 141, Springer Verlag, 1993 (second edition, 1998).

3

D. Cox, J. Little, D. O'Shea.
Ideals, Varieties, and Algorithms.
Springer-Verlag, 1991 (second corrected edition, 1998).

4

D. Duval.
Evaluation dynamique et clôture algébrique.
Journal of Pure and Applied Algebra 99, 267-295, 1995.

5

FRISCO.
A Framework for Integrated Symbolic/Numeric Computation.
ESPRIT Project LTR 21024, 1996-1999, European Union.

6

A. Galligo, L. Poittier, C. Traverso.
Greatest Easy Common Divisor and standard basis completion algorithms.
ISSAC'98.
Lecture Notes in Computer Science 358, 162-176, 1988.

7

P. Gianni.
Properties of Gröbner basis under specializations.
European Conference on Computer Algebra, Leipzig, GDR, 1987 (J. H. Davenport, ed.).
Lecture Notes in Computer Science 378, 293-297, 1987.

8

M. Moreno-Maza.
Calculs de Pgcd au-dessus des Tours d'Extensions Simples et Résolution des Systèmes d'Équations Algébriques.
Doctoral Thesis, Université Paris 6, 1997.

9

M. Kalkbrener.
On the stability of Gröbner basis under specializations.
Journal of Symbolic Computation 24 (1), 51-58, 1997.

10

K. Rimey.
A system of polynomial equations and a solution by an unusual method.
ACM SIGSAM Bulletin, 1, 18, 1984.

11

W. Y. Sit.
An algorithm for solving parametric linear systems.
Journal of Symbolic Computation 13, 353-394, 1992.

12

C. Traverso.
Hilbert Functions and the Buchberger Algorithm.
Journal of Symbolic Computation 22 (4), 355-376, 1996.

13

B. L. van der Waerden.
Modern Algebra II.
Third edition. F. Ungar Publishing Co., NY, 1950.

14

V. Weispfenning.
Comprehensive Gröbner Bases.
Journal of Symbolic Computation, 14 (1), 1-30, 1992.