S. Abélard, P. Gaudry, and P. Spaenlehauer, Counting points on genus-3 hyperelliptic curves with explicit real multiplication, ANTS-XIII, 2018.

B. Beckermann and G. Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants, SIAM J. Matrix Anal. Appl, vol.15, pp.804-823, 1994.

B. Beckermann and G. Labahn, Fraction-free computation of matrix rational interpolant and matrix gcds, SIAM J. Matrix Anal. Appl, vol.22, pp.114-144, 2000.

B. Beckermann, G. Labahn, and G. Villard, Shifted Normal Forms of Polynomial Matrices, ISSAC'99. ACM, pp.189-196, 1999.

A. Bostan, G. Lecerf, and É. Schost, Tellegen's Principle Into Practice, ISSAC'03. ACM, pp.37-44, 2003.

A. Bostan and É. Schost, Polynomial evaluation and interpolation on special sets of points, J. Complexity, vol.21, pp.420-446, 2005.

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Inform, vol.28, pp.693-701, 1991.

D. Coppersmith, Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Math. Comp, vol.62, pp.333-350, 1994.

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput, vol.9, pp.251-280, 1990.

J. Dixon, Exact solution of linear equations using p-adic expansions, Numer. Math, vol.40, pp.137-141, 1982.

J. Doliskani, P. Giorgi, R. Lebreton, and É. Schost, Simultaneous conversions with the residue number system using linear algebra, ACM Trans. Math. Software, vol.44, pp.1-21, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01415472

J. Dumas, P. Giorgi, and C. Pernet, Dense Linear Algebra over Word-Size Prime Fields: The FFLAS and FFPACK Packages, ACM Trans. Math. Softw, vol.35, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00018223

J. Von-zur-gathen and J. Gerhard, Modern Computer Algebra, 2013.

P. Gaudry and R. Harley, Counting points on hyperelliptic curves over finite fields, ANTS-IV, vol.1838, pp.313-332, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00512403

P. Gaudry and É. Schost, Construction of secure random curves of genus 2 over prime fields, Eurocrypt'04, vol.3027, pp.239-256, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00514121

P. Gaudry and É. Schost, Point-counting in genus 2 over prime fields, J. Symbolic Comput, vol.47, pp.368-400, 2012.

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, ISSAC'03. ACM, pp.135-142, 2003.
URL : https://hal.archives-ouvertes.fr/hal-02101878

P. Giorgi and R. Lebreton, Online order basis algorithm and its impact on the block Wiedemann algorithm, ISSAC'14. ACM, pp.202-209, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01232873

S. Gupta, S. Sarkar, A. Storjohann, and J. Valeriote, Triangular x-basis decompositions and derandomization of linear algebra algorithms over, 2012.

, J. Symbolic Comput, vol.47, pp.422-453, 2012.

G. Hanrot, M. Quercia, and P. Zimmermann, The Middle Product Algorithm, I. Appl. Algebra Engrg. Comm. Comp, vol.14, pp.415-438, 2004.
DOI : 10.1007/s00200-003-0144-2

URL : https://hal.archives-ouvertes.fr/inria-00071921

D. Harvey, A cache-friendly truncated FFT, Theoretical Computer Science, vol.410, pp.2649-2658, 2009.
DOI : 10.1016/j.tcs.2009.03.014

URL : https://doi.org/10.1016/j.tcs.2009.03.014

D. Harvey, Faster arithmetic for number-theoretic transforms, Journal of Symbolic Computation, vol.60, pp.113-119, 2014.
DOI : 10.1016/j.jsc.2013.09.002

URL : http://arxiv.org/pdf/1205.2926

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Faster Polynomial Multiplication over Finite Fields, Article, vol.63, 2017.
DOI : 10.1145/3005344

URL : https://hal.archives-ouvertes.fr/hal-01022757

R. Seung-gyu-hyun, É. Lebreton, and . Schost, Algorithms for structured linear systems solving and their implementation, ISSAC'17, pp.205-212, 2017.

S. G. Hyun, V. Neiger, H. Rahkooy, and É. Schost, Block-Krylov techniques in the context of sparse-FGLM algorithms, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01661690

C. Jeannerod, V. Neiger, É. Schost, and G. Villard, Fast computation of minimal interpolation bases in Popov form for arbitrary shifts, ISSAC'16, pp.295-302, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01265983

C. Jeannerod, V. Neiger, É. Schost, and G. Villard, Computing minimal interpolation bases, J. Symbolic Comput, vol.83, pp.272-314, 2017.
DOI : 10.1016/j.jsc.2016.11.015

URL : https://hal.archives-ouvertes.fr/hal-01241781

C. Jeannerod, V. Neiger, and G. Villard, Fast computation of approximant bases in canonical form, Journal of Symbolic Computation, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01683632

T. Kailath, Linear Systems, 1980.

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp, vol.64, pp.777-806, 1995.

M. Kaminski, D. G. Kirkpatrick, and N. H. Bshouty, Addition requirements for matrix and transposed matrix products, J. Algorithms, vol.9, pp.354-364, 1988.
DOI : 10.1016/0196-6774(88)90026-0

URL : http://www.cpsc.ucalgary.ca/~bshouty/PAPERS/Addition_Reqirements_for_Matrix_and_Transpose_Matrix_Products.ps

G. Labahn, D. K. Choi, and S. Cabay, The inverses of block Hankel and block Toeplitz matrices, SIAM J. Comput, vol.19, pp.98-123, 1990.

G. Labahn, V. Neiger, and W. Zhou, Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, J. Complexity, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01345627

F. and L. Gall, Powers of Tensors and Fast Matrix Multiplication, ISSAC'14. ACM, pp.296-303, 2014.

F. , L. Gall, and F. Urrutia, Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor, SODA '18. SIAM, pp.1029-1046, 2018.

P. L. Montgomery, Five, six, and seven-term Karatsuba-like formulae, IEEE Trans. Comput, vol.54, pp.362-369, 2005.
DOI : 10.1109/tc.2005.49

URL : http://www.csd.uwo.ca/%7Eeschost/Exam/Montgomery--Five_six_and_seven_terms_Karatsuba-like_formulae.pdf

V. Neiger, J. Rosenkilde, and G. Solomatov, Computing Popov and Hermite Forms of Rectangular Polynomial Matrices, ISSAC'18, pp.295-302, 2018.
DOI : 10.1145/3208976.3208988

URL : https://hal.archives-ouvertes.fr/hal-01701867

V. Neiger, B. Salvy, É. Schost, and G. Villard, , 2019.

J. S. Nielsen and P. Beelen, Sub-quadratic decoding of one-point Hermitian codes, IEEE Trans. Inf. Theory, vol.61, pp.3225-3240, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01245062

. Victor-pan, Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations, Inform. Process. Lett, vol.28, pp.71-75, 1988.

D. Reischert, Asymptotically fast computation of subresultants, ISSAC'97. ACM, pp.233-240, 1997.

G. Schulz, Iterative Berechung der reziproken Matrix, Zeitschrift für Angewandte Mathematik und Mechanik, vol.13, pp.57-59, 1933.

V. Shoup, Fast construction of irreducible polynomials over finite fields, J. Symbolic Comput, vol.17, pp.371-391, 1994.

V. Shoup, NTL: A Library for doing Number Theory, 2018.

A. Storjohann, High-order lifting and integrality certification, J. Symbolic Comput, vol.36, pp.613-648, 2003.

A. Storjohann, Notes on computing minimal approximant bases, Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings), 2006.

V. Strassen, Gaussian elimination is not optimal, Numer. Math, vol.13, pp.354-356, 1969.

C. The and . Team, CADO-NFS, An implementation of the number field sieve algorithm, 2017.

F. The and . Group, FFLAS-FFPACK: Finite Field Linear Algebra Subroutines / Package, 2019.

, LinBox: Linear algebra over black-box matrices, 2018.

M. Van-barel and A. Bultheel, A general module theoretic framework for vector M-Padé and matrix rational interpolation, Numer. Algorithms, vol.3, pp.451-462, 1992.

G. Villard, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems, ISSAC'97. ACM, pp.32-39, 1997.

G. Villard, On computing the resultant of generic bivariate polynomials, ISSAC'18. ACM, pp.391-398, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01921369

A. Waksman, On Winograd's Algorithm for Inner Products, IEEE Transactions On Computers C, vol.19, pp.360-361, 1970.

S. Winograd, A New Algorithm for Inner Product, IEEE Trans. Comput. C, vol.17, pp.693-694, 1968.

S. Winograd, On multiplication of 2 × 2 matrices, Linear Algebra Appl, vol.4, pp.381-388, 1971.

W. Zhou and G. Labahn, Efficient Algorithms for Order Basis Computation, J. Symbolic Comput, vol.47, pp.793-819, 2012.

W. Zhou, G. Labahn, and A. Storjohann, Computing Minimal Nullspace Bases, ISSAC'12. ACM, pp.366-373, 2012.