Algorithms for polynomials over a real algebraic number field.

An analysis of the subresultant algorithm over an algebraic number field

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation

Real algebraic number computation using interval arithmetic

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation

On a modular algorithm for computing GCDs of polynomials over algebraic number fields

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation

A subresultant theory for Ore polynomials with applications

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation

Simplification of radical expressions

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary report

ACM SIGSAM Bulletin

Real root isolation for algebraic polynomials

ACM SIGSAM Bulletin

Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix

Computer Mathematics