Counting points on genus-3 hyperelliptic curves with explicit real multiplication, ANTS-XIII, 2018. ,
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants, SIAM J. Matrix Anal. Appl, vol.15, pp.804-823, 1994. ,
Fraction-free computation of matrix rational interpolant and matrix gcds, SIAM J. Matrix Anal. Appl, vol.22, pp.114-144, 2000. ,
Shifted Normal Forms of Polynomial Matrices, ISSAC'99. ACM, pp.189-196, 1999. ,
Tellegen's Principle Into Practice, ISSAC'03. ACM, pp.37-44, 2003. ,
Polynomial evaluation and interpolation on special sets of points, J. Complexity, vol.21, pp.420-446, 2005. ,
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Math. Comp, vol.62, pp.333-350, 1994. ,
Matrix multiplication via arithmetic progressions, J. Symbolic Comput, vol.9, pp.251-280, 1990. ,
Exact solution of linear equations using p-adic expansions, Numer. Math, vol.40, pp.137-141, 1982. ,
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
, Modern Computer Algebra, 2013.
Counting points on hyperelliptic curves over finite fields, ANTS-IV, vol.1838, pp.313-332, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00512403
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
Point-counting in genus 2 over prime fields, J. Symbolic Comput, vol.47, pp.368-400, 2012. ,
On the complexity of polynomial matrix computations, ISSAC'03. ACM, pp.135-142, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-02101878
Triangular x -basis decompositions and derandomization of linear algebra algorithms over, 2012. ,
, J. Symbolic Comput, vol.47, pp.422-453, 2012.
The Middle Product Algorithm, I. Appl. Algebra Engrg. Comm. Comp, vol.14, pp.415-438, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00071921
FLINT: Fast Library for Number Theory, 2015. ,
A cache-friendly truncated FFT, Theoretical Computer Science, vol.410, pp.2649-2658, 2009. ,
Faster arithmetic for number-theoretic transforms, Journal of Symbolic Computation, vol.60, pp.113-119, 2014. ,
Algorithms for structured linear systems solving and their implementation, ISSAC'17, pp.205-212, 2017. ,
Block-Krylov techniques in the context of sparse-FGLM algorithms, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01661690
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
Computing minimal interpolation bases, J. Symbolic Comput, vol.83, pp.272-314, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01241781
Fast computation of approximant bases in canonical form, Journal of Symbolic Computation, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01683632
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp, vol.64, pp.777-806, 1995. ,
Addition requirements for matrix and transposed matrix products, J. Algorithms, vol.9, pp.354-364, 1988. ,
The inverses of block Hankel and block Toeplitz matrices, SIAM J. Comput, vol.19, pp.98-123, 1990. ,
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
Powers of Tensors and Fast Matrix Multiplication, ISSAC'14. ACM, pp.296-303, 2014. ,
Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor, SODA '18. SIAM, pp.1029-1046, 2018. ,
Five, six, and seven-term Karatsuba-like formulae, IEEE Trans. Comput, vol.54, pp.362-369, 2005. ,
Computing Popov and Hermite Forms of Rectangular Polynomial Matrices, ISSAC'18, pp.295-302, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01701867
, , 2019.
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
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. ,
Asymptotically fast computation of subresultants, ISSAC'97. ACM, pp.233-240, 1997. ,
Iterative Berechung der reziproken Matrix, Zeitschrift für Angewandte Mathematik und Mechanik, vol.13, pp.57-59, 1933. ,
Fast construction of irreducible polynomials over finite fields, J. Symbolic Comput, vol.17, pp.371-391, 1994. ,
NTL: A Library for doing Number Theory, 2018. ,
High-order lifting and integrality certification, J. Symbolic Comput, vol.36, pp.613-648, 2003. ,
Notes on computing minimal approximant bases, Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings), 2006. ,
Gaussian elimination is not optimal, Numer. Math, vol.13, pp.354-356, 1969. ,
CADO-NFS, An implementation of the number field sieve algorithm, 2017. ,
FFLAS-FFPACK: Finite Field Linear Algebra Subroutines / Package, 2019. ,
, LinBox: Linear algebra over black-box matrices, 2018.
A general module theoretic framework for vector M-Padé and matrix rational interpolation, Numer. Algorithms, vol.3, pp.451-462, 1992. ,
Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems, ISSAC'97. ACM, pp.32-39, 1997. ,
On computing the resultant of generic bivariate polynomials, ISSAC'18. ACM, pp.391-398, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01921369
On Winograd's Algorithm for Inner Products, IEEE Transactions On Computers C, vol.19, pp.360-361, 1970. ,
A New Algorithm for Inner Product, IEEE Trans. Comput. C, vol.17, pp.693-694, 1968. ,
On multiplication of 2 × 2 matrices, Linear Algebra Appl, vol.4, pp.381-388, 1971. ,
Efficient Algorithms for Order Basis Computation, J. Symbolic Comput, vol.47, pp.793-819, 2012. ,
Computing Minimal Nullspace Bases, ISSAC'12. ACM, pp.366-373, 2012. ,