The Design and Analysis of Computer Algorithms, 1974. ,
The M4RI Library ? Version 20100817. The M4RI Team, 2010. ,
The M4RIE library for dense linear algebra over small fields with even characteristic, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.28-34, 2012. ,
DOI : 10.1145/2442829.2442838
URL : https://hal.archives-ouvertes.fr/hal-01113282
Efficient dense Gaussian elimination over the finite field with two elements, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00796873
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.55-62, 2009. ,
DOI : 10.1145/1576702.1576713
Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, vol.28, issue.125, pp.231-236, 1974. ,
DOI : 10.1090/S0025-5718-1974-0331751-8
Algebraic Complexity Theory. volume 315 of Grundlehren der mathematischen Wissenschaften, 1997. ,
Gaussian Elimination: A case study in efficient genericity with MetaOCaml, Science of Computer Programming, vol.62, issue.1, pp.3-24, 2004. ,
DOI : 10.1016/j.scico.2005.10.012
The Turing factorization of a rectangular matrix, ACM SIGSAM Bulletin, vol.31, issue.3, pp.20-30, 1997. ,
DOI : 10.1145/271130.271135
A set of level 3 basic linear algebra subprograms, ACM Transactions on Mathematical Software, vol.16, issue.1, pp.1-17, 1990. ,
DOI : 10.1145/77626.79170
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
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
A new efficient algorithm for computing Gr??bner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-88, 1999. ,
DOI : 10.1016/S0022-4049(99)00005-5
Modern Computer Algebra, 2003. ,
DOI : 10.1017/CBO9781139856065
Strassen's Algorithm for Matrix Multiplication : Modeling Analysis, and Implementation, 1996. ,
A generalization of the fast LUP matrix decomposition algorithm and applications, Journal of Algorithms, vol.3, issue.1, pp.45-56, 1982. ,
DOI : 10.1016/0196-6774(82)90007-4
LSP matrix decomposition revisited, Research Report, vol.28, 2006. ,
LU factoring of non-invertible matrices, ACM SIGSAM Bulletin, vol.44, issue.1/2, pp.1-8, 2010. ,
DOI : 10.1145/1838599.1838602
Fast algorithms for the characteristics polynomial, Theoretical Computer Science, vol.36, pp.309-317, 1985. ,
DOI : 10.1016/0304-3975(85)90049-0
Unit???re Transformationen gro???er Matrizen, Numerische Mathematik, vol.13, issue.5, pp.409-417, 1973. ,
DOI : 10.1007/BF01402563
Modular forms, a computational approach. Graduate studies in mathematics, 2007. ,
Algorithms for Matrix Canonical Forms, 2000. ,
Fast Algorithms for Linear Algebra Modulo N, Algorithms ? ESA'98, pp.139-150, 1998. ,
DOI : 10.1007/3-540-68530-8_12
Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969. ,
DOI : 10.1007/BF02165411
URL : http://www.digizeitschriften.de/download/PPN362160546_0013/PPN362160546_0013___log38.pdf
The FFLAS-FFPACK Library, 2011. ,
The LinBox Library (Version 1.2.1), 2011. ,
ROUNDING-OFF ERRORS IN MATRIX PROCESSES, The Quarterly Journal of Mechanics and Applied Mathematics, vol.1, issue.1, pp.287-308, 1948. ,
DOI : 10.1093/qjmam/1.1.287
Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.887-898, 2012. ,
DOI : 10.1145/2213977.2214056
On multiplication of 2 ?? 2 matrices, Linear Algebra and its Applications, vol.4, issue.4, pp.381-388, 1971. ,
DOI : 10.1016/0024-3795(71)90009-7