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
Low complexity algorithms for linear recurrences
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
Isolating real roots of real polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Asymptotically fast algorithms for modern computer algebra
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Complexity of creative telescoping for bivariate rational functions
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Factorization of polynomials and GCD computations for finding universal denominators
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |