B. Beckermann and G. Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Pad?? Approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.804-823, 1994.
DOI : 10.1137/S0895479892230031

P. Bürgisser, M. Clausen, and M. Shokrollahi, Algebraic Complexity Theory, Grundlehren der mathematischen Wissenschaften, 1997.
DOI : 10.1007/978-3-662-03338-8

X. Chang, D. Stehlé, and G. Villard, Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction, Mathematics of Computation, vol.81, issue.279
DOI : 10.1090/S0025-5718-2012-02545-2
URL : https://hal.archives-ouvertes.fr/ensl-00529425

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.135-142, 2003.
DOI : 10.1145/860854.860889

S. Gupta, S. Sarkar, A. Storjohann, and J. Valeriote, Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x], J. Symbolic Comput

J. Hastad, B. Just, J. Lagarias, and C. Schnorr, Polynomial Time Algorithms for Finding Integer Relations among Real Numbers, SIAM Journal on Computing, vol.18, issue.5, pp.859-881, 1989.
DOI : 10.1137/0218059

M. Van-hoeij and A. Novocin, Gradual sub-lattice reduction and a new complexity for factoring polynomials, Proc. LATIN 2010, pp.539-553, 2010.
URL : https://hal.archives-ouvertes.fr/ensl-00452881

C. Jeannerod and G. Villard, Asymptotically fast polynomial matrix algorithms for multivariable systems, International Journal of Control, vol.36, issue.11, pp.1359-1367, 2006.
DOI : 10.1007/BF00289520
URL : http://arxiv.org/abs/cs/0508113

T. Kailath, Linear systems, 1980.

E. Kaltofen and G. Villard, On the complexity of computing determinants, computational complexity, vol.13, issue.3-4, pp.91-130, 2005.
DOI : 10.1007/s00037-004-0185-3

D. Knuth, The analysis of algorithms, Proc. International Congress of Mathematicians, pp.269-274, 1970.

D. Lehmer, Euclid's Algorithm for Large Numbers, The American Mathematical Monthly, vol.45, issue.4, pp.227-233, 1938.
DOI : 10.2307/2302607

A. Lenstra, H. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454

L. Lovász, An algorithmic theory of numbers, graphs and convexity, CBMS-NSF Regional Conferences Series in Applied Mathematics, SIAM, 1986.
DOI : 10.1137/1.9781611970203

A. Novocin, D. Stehlé, and G. Villard, An LLL-reduction algorithm with quasi-linear time complexity, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, 2011.
DOI : 10.1145/1993636.1993691
URL : https://hal.archives-ouvertes.fr/ensl-00534899

S. Radziszowski and D. Kreher, Solving subset sum problems with the L 3 algorithm, J. Combin. Math. Combin. Comput, vol.3, pp.49-63, 1988.

A. Schönhage, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, vol.1, issue.2, pp.139-144, 1971.
DOI : 10.1007/BF00289520

A. Schönhage, Fast reduction and composition of binary quadratic forms, Proceedings of the 1991 international symposium on Symbolic and algebraic computation , ISSAC '91, pp.128-133, 1991.
DOI : 10.1145/120694.120711

A. Storjohann, The shifted number system for fast linear algebra on integer matrices, Journal of Complexity, vol.21, issue.4, pp.609-650, 2005.
DOI : 10.1016/j.jco.2005.04.002

A. Storjohann, On the complexity of inverting integer and polynomial matrices, computational complexity, vol.66, issue.4
DOI : 10.1007/s00037-015-0106-7

C. K. Yap, Fast unimodular reduction: planar integer lattices, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.437-446, 1992.
DOI : 10.1109/SFCS.1992.267808