D. J. Bernstein, Composing power series over a nite ring in essentially linear time, J. Symbolic Comput, vol.26, issue.3, p.339341, 1998.

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

R. P. Brent and H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, p.581595, 1978.
DOI : 10.1145/322092.322099
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5030

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory, of Grundlehren der Mathematischen Wissenschaften, 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, p.693701, 1991.
DOI : 10.1007/BF01178683
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.570

X. Dahan, M. Moreno-maza, É. Schost, and Y. Xie, On the complexity of the D5 principle, Proceedings of Transgressive Computing 2006: a conference in honor of Jean Della Dora, p.149168, 2006.
DOI : 10.1145/1113439.1113457

J. , D. Dora, C. Dicrescenzo, and D. Duval, A new method for computing in algebraic number elds, Lect. Notes in Comp. Science, vol.85, issue.174, p.321326, 1985.

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

B. Grenet, J. Van-der-hoeven, and G. Lecerf, Deterministic root nding over nite elds using Graee transforms, Appl. Alg. Eng. Comm. Comp, vol.27, issue.3, p.237257, 2016.
DOI : 10.1007/s00200-015-0280-5

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Faster polynomial multiplication over nite elds, J. ACM, vol.63, issue.6, p.2017
DOI : 10.1145/3005344
URL : http://arxiv.org/abs/1407.3361

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, p.479542, 2002.
DOI : 10.1006/jsco.2002.0562

J. Van-der-hoeven, Fast composition of numeric power series, 2008.

J. Van-der-hoeven and G. Lecerf, Modular composition via factorization, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01457074

X. Huang and V. Y. Pan, Fast Rectangular Matrix Multiplication and Applications, Journal of Complexity, vol.14, issue.2, p.257299, 1998.
DOI : 10.1006/jcom.1998.0476
URL : http://doi.org/10.1006/jcom.1998.0476

E. Kaltofen and V. Shoup, Fast polynomial factorization over high algebraic extensions of nite elds, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation , ISSAC '97, p.184188, 1997.

E. Kaltofen and V. Shoup, Subquadratic-time factoring of polynomials over nite elds, Math. Comp, vol.67, issue.223, p.11791197, 1998.

K. S. Kedlaya and C. Umans, Fast Modular Composition in any Characteristic, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, p.146155, 2008.
DOI : 10.1109/FOCS.2008.13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.204

K. S. Kedlaya and C. Umans, Fast Polynomial Factorization and Modular Composition, SIAM Journal on Computing, vol.40, issue.6, p.17671802, 2011.
DOI : 10.1137/08073408X
URL : http://authors.library.caltech.edu/28972/1/Kedlaya2011p16787Siam_J_Comput.pdf

F. and L. Gall, Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, p.296303, 2014.
DOI : 10.1145/2608628.2608664

G. Lecerf, On the complexity of the Lickteig-Roy subresultant algorithm, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01450869

M. S. Paterson and L. J. Stockmeyer, On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials, SIAM Journal on Computing, vol.2, issue.1, p.6066, 1973.
DOI : 10.1137/0202007

P. Ritzmann, A fast numerical algorithm for the composition of power series with complex coecients, Theoret. Comput. Sci, vol.44, p.116, 1986.