| Publication | Date of Publication | Type |
|---|
Hermite interpolation with error correction. Fields of zero or large characteristic and large error rate
| 2025-01-20 | Paper |
Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices
| 2025-01-20 | Paper |
Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
| 2024-03-14 | Paper |
High-order lifting for polynomial Sylvester matrices
Journal of Complexity | 2024-02-05 | Paper |
Exact computations with quasiseparable matrices
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Hermite rational function interpolation with error correction
| 2022-12-21 | Paper |
Some fast algorithms multiplying a matrix by its adjoint
Journal of Symbolic Computation | 2022-09-22 | Paper |
Deterministic computation of the characteristic polynomial in the time of matrix multiplication
Journal of Complexity | 2021-11-02 | Paper |
Verification protocols with sub-linear communication for polynomial matrix operations
Journal of Symbolic Computation | 2021-02-18 | Paper |
On fast multiplication of a matrix by its transpose
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
LU factorization with errors
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Certificates for triangular equivalence and rank profiles
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Early termination in parametric linear system solving and rational function vector recovery with error correction
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Symmetric indefinite triangular factorization revealing the rank profile matrix
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Elimination-based certificates for triangular equivalence and rank profiles
Journal of Symbolic Computation | 2020-01-15 | Paper |
Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
SIAM Journal on Matrix Analysis and Applications | 2019-12-09 | Paper |
Computational mathematics with SageMath. Translated from the 2013 French original by the authors
| 2019-04-09 | Paper |
Time and space efficient generators for quasiseparable matrices
Journal of Symbolic Computation | 2017-10-10 | Paper |
Fast computation of the rank profile matrix and the generalized Bruhat decomposition
Journal of Symbolic Computation | 2017-06-01 | Paper |
Computing with quasiseparable matrices
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Simultaneous computation of the row and column rank profiles
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Computing the rank profile matrix
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Output-sensitive decoding for redundant residue systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Efficient computation of the characteristic polynomial
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
Elements of design for containers and solutions in the LinBox library (extended abstract)
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
Journal of Symbolic Computation | 2014-03-03 | Paper |
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
On finding multiplicities of characteristic polynomial factors of black-box matrices
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements
| 2011-11-28 | Paper |
LinBox founding scope allocation, parallel building blocks, and separate compilation
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
Faster algorithms for the characteristic polynomial
| 2009-01-20 | Paper |
scientific article; zbMATH DE number 2151219 (Why is no real title available?)
| 2005-04-04 | Paper |
FFPACK
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
Strassen's algorithm is not optimally accurate
| N/A | Paper |
