Fast deterministic computation of determinants of dense matrices, Proc. ISSAC, 1999. ,
A uniform approach for the fast computation of matrix-type Padé approximants, SIAM J. Math. Anal. Appl, vol.15, p.3, 1994. ,
Polynomial and matrix computations, 1994. ,
Asymptotically fast solution of Toeplitz and related systems of linear equations, Linear Algebra Appl, vol.34, 1980. ,
Fast computation of special resultants, J. Symbolic Computation, vol.41, p.1, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00000960
On matrices with displacement structure: generalized operators and faster algorithms, SIAM J. Math. Anal. Appl, vol.38, p.3, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01588552
Fast algorithms for manipulating formal power series, J. ACM, vol.25, p.4, 1978. ,
On Euclids algorithm and the computation of polynomial greatest common divisors, J. ACM, vol.18, p.4, 1971. ,
On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.28, 1991. ,
The Calculation of Multivariate Polynomial Resultants, J. ACM, vol.18, p.4, 1971. ,
Rectangular matrix multiplication revisited, J. Complexity, vol.13, 1997. ,
Matrix multiplication via arithmetic progressions, J. Symbolic Computation, vol.9, p.3, 1990. ,
Using Algebraic Geometry, 1998. ,
A two-pronged progress in structured dense matrix vector multiplication, Proc. ACM-SIAM SODA, 2018. ,
Computing the determinant and Smith form of an integer matrix, Proc. FOCS, 2000. ,
, Modern Computer Algebra, 1999.
, Subresultants revisited. Theoretical Computer Science, vol.297, pp.1-3, 2003.
Algebraic solution of systems of polynomial equations using Gröbner bases, Proc. AAECC, vol.536, 1987. ,
On the complexity of polynomial matrix computations, Proc. ISSAC, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-02101878
Hermite forms of polynomial matrices, 2011. ,
Algebraic Methods for Toeplitz-like Matrices and Operator, 1984. ,
Fast rectangular matrix multiplication and applications, J. of Complexity, vol.14, 1998. ,
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts, Proc. ISSAC, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01265983
Linear Systems, 1980. ,
Displacement ranks of matrices and linear equations, J. Mathematical Analysis and Applications, vol.68, 1979. ,
On computing determinants without divisions, Proc. ISSAC, 1992. ,
Asymptotically fast solution of Toeplitz-like singular linear systems, Proc. ISSAC, 1994. ,
Challenges of symbolic computation: my favorite open problems, J. Symbolic Computation, vol.29, 2000. ,
On the complexity of computing determinants, Computational Complexity, vol.13, p.3, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-02102099
The analysis of algorithms, Tome 3. Gauthier-Villars, pp.269-274, 1970. ,
Inversion components of block Hankel-like matrices, Linear Algebra Appl, vol.177, 1992. ,
Fast deterministic computation of the Hermite normal form and determinant of a polynomial matrix, J. Complexity, vol.42, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01345627
On p-adic differential equations with separation of variables, Proc. ISSAC, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01265226
Powers of Tensors and Fast Matrix Multiplication, Proc. ISSAC, 2014. ,
Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor, Proc. ACM-SIAM SODA, 2018. ,
On the complexity of the Lickteig-Roy subresultant algorithm, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01450869
Generalized Bezoutian and the inversion problem for block matrices I. General scheme approximants, Integral Equations and Operator Theory, vol.9, p.6, 1986. ,
, Cauchy index computation. Calcolo, vol.33, pp.3-4, 1996.
Fast computation of GCDs, Proc. STOC, 1973. ,
A fast algorithm for computing the truncated resultant, Proc. ISSAC, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01366386
Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations, Inf. Process. Lett, vol.28, 1988. ,
Parametrization of Newtons iteration for computations with structured matrices and applications, Comp. Math. Appl, vol.24, p.3, 1992. ,
Asymptotically fast computation of subresultants, Proc. ISSAC, 1997. ,
Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields, Proc. AAECC, vol.539, 1991. ,
Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, vol.1, 1971. ,
Fast construction of irreducible polynomials over finite fields, J. Symbolic Computation, vol.17, p.5, 1994. ,
A New Polynomial Factorization Algorithm and its Implementation, J. Symbolic Computation, vol.20, p.4, 1995. ,
High-order lifting and integrality certification, J. Symbolic Computation, vol.36, pp.3-4, 2003. ,
The shifted number system for fast linear algebra on integer matrices, J. Complexity, vol.21, p.4, 2005. ,
Note for computing the minimun polynomial of elements in large finite fields, Proc. Coding Theo. App, vol.388, 1989. ,
Further analysis of Coppersmiths block Wiedemann algorithm for the solution of sparse linear systems, Proc. ISSAC, 1997. ,
A study of Coppersmith's block Wiedemann algorithm using matrix polynomials, RR 975 IM IMAG Grenoble, 1997. ,
Solving sparse linear equations over finite fields, IEEE Trans. Information Theory, vol.32, p.1, 1986. ,
Efficient Algorithms for Order Basis Computation, J. Symbolic Computation, vol.47, p.7, 2012. ,