N. Bell and M. Garland, Implementing sparse matrix-vector multiplication on throughput-oriented processors, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, SC '09, pp.1-11, 2009.
DOI : 10.1145/1654059.1654078

A. Buluç, J. T. Fineman, M. Frigo, J. R. Gilbert, and C. E. Leiserson, Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks, SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, pp.233-244, 2009.

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

L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner et al., Efficient matrix preconditioners for black box linear algebra, Linear Algebra and its Applications, vol.343, issue.344, pp.343-344119, 2002.
DOI : 10.1016/S0024-3795(01)00472-4

D. Coppersmith, Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994.
DOI : 10.2307/2153413

J. Dumas, Q-adic transform revisited, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.63-69, 2008.
DOI : 10.1145/1390768.1390780
URL : https://hal.archives-ouvertes.fr/hal-00173894

J. G. Dumas, T. Gautier, and C. Pernet, Finite field linear algebra subroutines, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.63-74, 2002.
DOI : 10.1145/780506.780515

J. Dumas, P. Giorgi, P. Elbaz-vincent, and A. Urba?ska, Parallel computation of the rank of large sparse matrices from algebraic K-theory, Proceedings of the 2007 international workshop on Parallel symbolic computation, PASCO '07, pp.43-52, 2007.
DOI : 10.1145/1278177.1278186
URL : https://hal.archives-ouvertes.fr/hal-00142141

J. Dumas, P. Giorgi, and C. Pernet, Dense Linear Algebra over Word-Size Prime Fields, ACM Transactions on Mathematical Software, vol.35, issue.3, pp.1-42, 2008.
DOI : 10.1145/1391989.1391992
URL : https://hal.archives-ouvertes.fr/hal-00018223

J. V. Gathen and J. Gerhard, Modern Computer Algebra, 1999.

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

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

E. Kaltofen and A. Lobo, Factoring high-degree polynomials by the black box Berlekamp algorithm, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.90-98, 1994.
DOI : 10.1145/190347.190371

E. Kaltofen and B. D. Saunders, On wiedemann's method of solving sparse linear systems, Applied Algebra, Algebraic Algorithms and Error? Correcting Codes (AAECC '91), pp.29-38, 1991.
DOI : 10.1007/3-540-54522-0_93

W. J. Turner, A block Wiedemann rank algorithm, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.332-339, 2006.
DOI : 10.1145/1145768.1145822

P. Tvrdik and I. Simecek, A new approach for accelerating the sparse matrix-vector multiplication. Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, vol.0, pp.156-163, 2006.

F. Vazquez, E. M. Garzon, J. A. Martinez, and J. J. Fernandez, The sparse matrix vector product on GPUs, 2009.

G. Villard, A study of Coppersmith's block Wiedemann algorithm using matrix polynomials, 1997.

R. Vuduc, J. W. Demmel, and K. A. Yelick, OSKI: A library of automatically tuned sparse matrix kernels, Institute of Physics Publishing, 2005.
DOI : 10.1088/1742-6596/16/1/071

R. W. Vuduc and H. Moon, Fast sparse matrix-vector multiplication by exploiting variable block structure

D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137