Approximate square-free decomposition and root-finding of lll-conditioned algebraic equations

An analysis of cancellation error in multivariate Hensel construction with floating-point number arithmetic

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

Hybrid computation of bivariate rational interpolation

ACM SIGSAM Bulletin

The subresultant and clusters of close roots

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

A theorem for separating close roots of a polynomial and its derivatives

ACM SIGSAM Bulletin

Approximate radical of ideals with clusters of roots

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms

Proceedings of the 2007 international workshop on Symbolic-numeric computation

Computing Approximate GCDs in Ill-conditioned Cases

Proceedings of the 2007 international workshop on Symbolic-numeric computation

A new Gröbner basis conversion method based on stabilization techniques

Theoretical Computer Science

Nearest multivariate system with given root multiplicities

Journal of Symbolic Computation

An iterative method for calculating approximate GCD of univariate polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

The approximate irreducible factorization of a univariate polynomial: revisited

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

Computing clustered close-roots of univariate polynomials

Proceedings of the 2009 conference on Symbolic numeric computation

Exact real computation in computer algebra

SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation

GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials

CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing

Approximate polynomial GCD over integers

Journal of Symbolic Computation

Approximate GCD of several univariate polynomials with small degree perturbations

Journal of Symbolic Computation

Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

Approximately singular systems and ill-conditioned polynomial systems

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing

GPGCD: An iterative method for calculating approximate GCD of univariate polynomials

Theoretical Computer Science