Functional decomposition ofpolynomials: the tame case
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Improvement of the degree setting in Gosper's algorithm
Journal of Symbolic Computation
Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
On polynomial solutions of linear operator equations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A new polynomial factorization algorithm and its implementation
Journal of Symbolic Computation
Greatest factorial factorization and symbolic summation
Journal of Symbolic Computation
Comparative implementations of Berlekamp's and Niederreiter's polynomial factorization algorithms
FFA '95 Proceedings of the third international conference on Finite fields and applications
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
High degree solutions of low degree equations (extended abstract)
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Efficient isolation of polynomial's real roots
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Fast algorithms for polynomial solutions of linear differential equations
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Architecture-aware classical Taylor shift by 1
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
High-performance implementations of the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Univariate polynomial real root isolation: continued fractions revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Complexity of real root isolation using continued fractions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of real root isolation using continued fractions
Theoretical Computer Science
Products of ordinary differential operators by evaluation and interpolation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
Complexity of real root isolation using continued fractions
Theoretical Computer Science
Fast algorithms for differential equations in positive characteristic
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Continued fraction expansion of real roots of polynomial systems
Proceedings of the 2009 conference on Symbolic numeric computation
Fast computation of special resultants
Journal of Symbolic Computation
A deterministic algorithm for isolating real roots of a real polynomial
Journal of Symbolic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Cache complexity and multicore implementation for univariate real root isolation
ACM Communications in Computer Algebra
Theoretical Computer Science
On the computing time of the continued fractions method
Journal of Symbolic Computation
On the complexity of solving a bivariate polynomial system
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Improved bounds for the CF algorithm
Theoretical Computer Science
Hi-index | 0.00 |