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
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Diophantine linear system solving
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A method for deciding whether the Galois group is abelian
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Partial solvability by radicals
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
Probabilistic algorithms for computing resultants
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Space-efficient evaluation of hypergeometric series
ACM SIGSAM Bulletin
Fast rational function reconstruction
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Algorithms for solving linear systems over cyclotomic fields
Journal of Symbolic Computation
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |