Factoring polynomials over algebraic number fields via norms
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A modular algorithm for computing greatest common right divisors of Ore polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On the genericity of the modular polynomial GCD algorithm
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Computing univariate GCDs over number fields
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the design and implementation of Brown's algorithm over the integers and number fields
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Interval arithmetic in cylindrical algebraic decomposition
Journal of Symbolic Computation
A modular GCD algorithm over number fields presented with multiple extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Algorithms for polynomial GCD computation over algebraic function fields
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Fast rational function reconstruction
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation
Vector rational number reconstruction
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Good reduction of Puiseux series and applications
Journal of Symbolic Computation
Hi-index | 0.00 |