On the complexity of diophantine geometry in low dimensions (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Sparse resultant of composed polynomials I* mixed-unmixed case
Journal of Symbolic Computation
Sparse resultant of composed polynomials II unmixed--mixed case
Journal of Symbolic Computation
Factoring sparse resultants of linearly combined polynomials
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Sparse Resultant under Vanishing Coefficients
Journal of Algebraic Combinatorics: An International Journal
Dense resultant of composed polynomials mixed-mixed case
Journal of Symbolic Computation
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Resultants of skewly composed polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Rational Univariate Reduction via toric resultants
Journal of Symbolic Computation
Cayley-Dixon projection operator for multi-univariate composed polynomials
Journal of Symbolic Computation
Resultants of partially composed polynomials
Journal of Symbolic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
A perturbed differential resultant based implicitization algorithm for linear DPPEs
Journal of Symbolic Computation
Improving the complexity of index calculus algorithms in elliptic curves over binary fields
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |