| Publication | Date of Publication | Type |
|---|
| Algorithms for linearly recurrent sequences of truncated polynomials | 2025-01-20 | Paper |
| Rank-sensitive computation of the rank profile of a polynomial matrix | 2025-01-17 | Paper |
| Faster change of order algorithm for Gröbner bases under shape and stability assumptions | 2025-01-17 | Paper |
Refined F5 Algorithms for Ideals of Minors of Square Matrices
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Beating binary powering for polynomial matrices
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Sparse FGLM using the block Wiedemann algorithm
ACM Communications in Computer Algebra | 2023-03-03 | Paper |
| Faster change of order algorithm for Gr\"obner bases under shape and stability assumptions | 2022-02-18 | Paper |
| Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix | 2022-02-18 | Paper |
An algebraic attack on rank metric code-based cryptosystems
(available as arXiv preprint) | 2021-12-01 | 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 |
A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Fast computation of the roots of polynomials over the ring of power series
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Fast computation of the roots of polynomials over the ring of power series
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Computing canonical bases of modules of univariate relations
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Computing canonical bases of modules of univariate relations
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Certification of minimal approximant bases
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Certification of minimal approximant bases
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Computing Popov and Hermite forms of rectangular polynomial matrices
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Computing Popov and Hermite forms of rectangular polynomial matrices
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Computing syzygies in finite dimension using fast linear algebra
Journal of Complexity | 2020-08-17 | Paper |
Fast computation of approximant bases in canonical form
Journal of Symbolic Computation | 2020-01-15 | Paper |
Block-Krylov techniques in the context of sparse-FGLM algorithms
Journal of Symbolic Computation | 2020-01-15 | Paper |
Two-Point Codes for the Generalized GK Curve
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Algorithms for zero-dimensional ideals using linear recurrent sequences
(available as arXiv preprint) | 2018-02-23 | Paper |
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
Journal of Complexity | 2017-09-07 | Paper |
Computing minimal interpolation bases
Journal of Symbolic Computation | 2017-06-01 | Paper |
Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
"Optimized Gr\""obner basis algorithms for maximal determinantal ideals and critical point computations"
(available as arXiv preprint) | N/A | Paper |
