A. V. Aho, K. Steiglitz, and J. D. Ullman, Evaluating Polynomials at Fixed Sets of Points, SIAM Journal on Computing, vol.4, issue.4, pp.533-539, 1975.
DOI : 10.1137/0204045

B. K. Alpert and V. Rokhlin, A Fast Algorithm for the Evaluation of Legendre Expansions, SIAM Journal on Scientific and Statistical Computing, vol.12, issue.1, pp.158-179, 1991.
DOI : 10.1137/0912009

G. Andrews, R. Askey, and R. Roy, Special functions, 1999.

R. Barrio and J. Peña, Basis conversions among univariate polynomial representations, Comptes Rendus Mathematique, vol.339, issue.4, pp.293-298, 2004.
DOI : 10.1016/j.crma.2004.06.017

D. J. Bernstein, Composing Power Series Over a Finite Ring in Essentially Linear Time, Journal of Symbolic Computation, vol.26, issue.3, pp.339-341, 1998.
DOI : 10.1006/jsco.1998.0216

A. Bostan, G. Lecerf, and . Schost, Tellegen's principle into practice, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.37-44, 2003.
DOI : 10.1145/860854.860870

A. Bostan, B. Salvy, and . Schost, Fast algorithms for orthogonal polynomials
URL : https://hal.archives-ouvertes.fr/inria-00273508

A. Bostan and . Schost, Polynomial evaluation and interpolation on special sets of points, Journal of Complexity, vol.21, issue.4, pp.420-446, 2005.
DOI : 10.1016/j.jco.2004.09.009

R. P. Brent, MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION, Analytic Computational Complexity, pp.151-176, 1975.
DOI : 10.1016/B978-0-12-697560-4.50014-9

R. P. Brent and H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, pp.581-595, 1978.
DOI : 10.1145/322092.322099

P. Bürgisser, M. Clausen, and A. Shokrollahi, Algebraic complexity theory, volume 315 of GMW, 1997.

J. Canny, E. Kaltofen, and Y. Lakshman, Solving systems of non-linear polynomial equations faster, ISSAC'89, pp.121-128, 1989.

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

J. R. Driscoll, J. D. Healy, and D. N. Rockmore, Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs [16] M. Frumkin. A fast algorithm for expansion over spherical harmonics, SIAM J. Comp. Appl. Algebra Engrg. Comm. Comp, vol.26, issue.66, pp.1066-1099333, 1995.

J. G. Gathen and J. Gerhard, Modern computer algebra, 1999.

J. Gerhard, Modular algorithms for polynomial basis conversion and greatest factorial factorization, RWCA'00, pp.125-141, 2000.

G. Hanrot, M. Quercia, and P. Zimmermann, The Middle Product Algorithm, I. Appl. Algebra Engrg, Comm. Comp, vol.14, issue.6, pp.415-438, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071921

G. Hanrot and P. Zimmermann, Newton iteration revisited, 2002.

G. Heinig, Fast and Superfast Algorithms for Hankel-Like Matrices Related to Orthogonal Polynomials, NAA'00, pp.361-380, 1988.
DOI : 10.1007/3-540-45262-1_45

J. G. Hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

E. Kaltofen, Challenges of Symbolic Computation: My Favorite Open Problems, Journal of Symbolic Computation, vol.29, issue.6, pp.891-919, 2000.
DOI : 10.1006/jsco.2000.0370

E. Kaltofen and Y. Lakshman, Improved sparse multivariate polynomial interpolation algorithms, ISSAC'88, pp.467-474, 1989.
DOI : 10.1007/3-540-51084-2_44

J. Keiner, Computing with Expansions in Gegenbauer Polynomials, SIAM Journal on Scientific Computing, vol.31, issue.3, 2007.
DOI : 10.1137/070703065

G. Leibon, D. Rockmore, and G. Chirikjian, A fast Hermite transform with applications to protein structure determination, SNC'07, pp.117-124, 2007.

Y. Li and X. Zhang, Basis conversion among Bézier, Tchebyshev and Legendre, Comput. Aided Geom. Design, vol.15, issue.6, pp.637-642, 1998.

V. Y. Pan, New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set, Computers & Mathematics with Applications, vol.35, issue.3, pp.125-129, 1998.
DOI : 10.1016/S0898-1221(97)00283-6

D. Potts, G. Steidl, and M. Tasche, Fast algorithms for discrete polynomial transforms, Mathematics of Computation, vol.67, issue.224, pp.1577-1590, 1998.
DOI : 10.1090/S0025-5718-98-00975-2

S. Roman, The umbral calculus. Dover publications, 2005.

A. Schönhage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

V. Shoup, A New Polynomial Factorization Algorithm and its Implementation, Journal of Symbolic Computation, vol.20, issue.4, pp.363-397, 1995.
DOI : 10.1006/jsco.1995.1055