A polynomial time algorithm for diophantine equations in one variable

On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

On the complexity of factoring bivariate supersparse (Lacunary) polynomials

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Factoring bivariate sparse (lacunary) polynomials

Journal of Complexity

ISSAC 2007 poster abstracts

ACM Communications in Computer Algebra

On lacunary polynomial perfect powers

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation

The number of roots of a lacunary bivariate polynomial on a line

Journal of Symbolic Computation

Supersparse black box rational function interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Detecting lacunary perfect powers and computing their roots

Journal of Symbolic Computation

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Factoring bivariate lacunary polynomials without heights

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation