Fast parallel algorithms for similarity of matrices
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
A system for manipulating polynomials given by straight-line programs
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software (TOMS)
On computing greatest common divisors with polynomials given by black boxes for their evaluations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
NC2 computation of gcd-free basis and application to parallel algebraic numbers computation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
On bivariate Hensel and its parallelization
ISSAC '98 Proceedings of the 1998 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
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Complexity issues in bivariate polynomial factorization
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Factoring into coprimes in essentially linear time
Journal of Algorithms
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
An improved EZ-GCD algorithm for multivariate polynomials
Journal of Symbolic Computation
On factorization of multivariate polynomials over algebraic number and function fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |