W. Zhou and G. Labahn, Efficient algorithms for order basis computation, Journal of Symbolic Computation, vol.47, issue.7, pp.793-819, 2012.
DOI : 10.1016/j.jsc.2011.12.009

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

W. Zhou, G. Labahn, and A. Storjohann, Computing minimal nullspace bases, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.366-373, 2012.
DOI : 10.1145/2442829.2442881

W. J. Turner, Black Box Linear Algebra with the LinBox Library, 2002.

M. J. Fischer and L. J. Stockmeyer, Fast on-line integer multiplication, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.317-331, 1974.
DOI : 10.1145/800125.804037

E. Kaltofen and G. Yuhasz, On the matrix berlekamp-massey algorithm, ACM Transactions on Algorithms, vol.9, issue.4, 2013.
DOI : 10.1145/2500122