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, Power series composition and change of basis, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, 2008.
DOI : 10.1145/1390768.1390806
URL : https://hal.archives-ouvertes.fr/inria-00273385

P. Bürgisser, M. Clausen, and A. M. Shokrollahi, Algebraic complexity theory, of Grundlehren Math. Wiss, 1997.
DOI : 10.1007/978-3-662-03338-8

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

T. S. Chihara, An introduction to orthogonal polynomials. Gordon and Breach Science Publishers, Mathematics and its Applications, vol.13, 1978.

J. R. Driscoll, J. D. Healy, and D. N. Rockmore, Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs, SIAM Journal on Computing, vol.26, issue.4, pp.1066-1099, 1997.
DOI : 10.1137/S0097539792240121

J. Favard, Sur les polynômes de Tchebicheff. Comptes-Rendus de l, Acadmie des Sciences, vol.200, pp.2052-2053, 1935.

P. Flajolet, Combinatorial aspects of continued fractions, Discrete Mathematics, vol.32, issue.3, pp.125-161, 1980.
DOI : 10.1016/0012-365X(80)90248-4

M. Frumkin, A fast algorithm for expansion over spherical harmonics, Applicable Algebra in Engineering, Communication and Computing, vol.25, issue.3, pp.333-343, 1995.
DOI : 10.1007/BF01198013

J. Zur-gathen and J. Gerhard, Modern computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

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. 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

P. M. Kogge and H. S. Stone, A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations, IEEE Transactions on Computers, vol.22, issue.8, pp.786-793, 1973.
DOI : 10.1109/TC.1973.5009159

G. Leibon, D. Rockmore, and G. Chirikjian, A fast Hermite transform with applications to protein structure determination, SNC '07: Proceedings of the 2007 international workshop on Symbolic-numeric computation, pp.117-124, 2007.

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

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

J. Shohat, The Relation of the Classical Orthogonal Polynomials to the Polynomials of Appell, American Journal of Mathematics, vol.58, issue.3, pp.453-464, 1936.
DOI : 10.2307/2370962

H. S. Stone, An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations, Journal of the ACM, vol.20, issue.1, pp.27-38, 1973.
DOI : 10.1145/321738.321741