| Publication | Date of Publication | Type |
|---|
| Computing generic fibers of polynomial ideals with FGLM and hensel lifting | 2025-02-03 | Paper |
| msolve. A library for solving polynomial systems | 2025-01-20 | Paper |
| Faster change of order algorithm for Gröbner bases under shape and stability assumptions | 2025-01-17 | Paper |
Modular matrix multiplication on GPU for polynomial system solving
ACM Communications in Computer Algebra | 2024-05-13 | Paper |
Towards fast one-block quantifier elimination through generalised critical values
ACM Communications in Computer Algebra | 2022-09-06 | Paper |
Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems
Journal of Algebra | 2022-04-28 | Paper |
| New efficient algorithms for computing Gr\"obner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon) | 2022-02-27 | Paper |
| Faster change of order algorithm for Gr\"obner bases under shape and stability assumptions | 2022-02-18 | Paper |
Guessing Gröbner bases of structured ideals of relations of sequences
Journal of Symbolic Computation | 2022-01-17 | Paper |
Polynomial-division-based algorithms for computing linear recurrence relations
Journal of Symbolic Computation | 2021-09-29 | Paper |
A polynomial-division-based algorithm for computing linear recurrence relations
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
Journal of Symbolic Computation | 2020-06-15 | Paper |
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
Journal of Symbolic Computation | 2017-06-01 | Paper |
Guessing linear recurrence relations of sequence tuplesand P-recursive sequences with linear algebra
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
Journal of Complexity | 2015-06-16 | Paper |
Relaxed \(p\)-adic Hensel lifting for algebraic systems
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation?
ACM Communications in Computer Algebra | 2015-02-20 | Paper |
Polynomial root finding over local rings and application to error correcting codes
Applicable Algebra in Engineering, Communication and Computing | 2014-03-24 | Paper |
Relaxed algorithms for \(p\)-adic numbers
Journal de Théorie des Nombres de Bordeaux | 2012-08-31 | Paper |
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
Mathematics of Computation | 2012-06-29 | Paper |
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
Journal of Complexity | 2012-05-30 | Paper |
| Computing Hironaka's invariants: ridge and directrix | 2011-01-03 | Paper |
Computing Generic Fibres of Polynomial Ideals with FGLM and Hensel Lifting
(available as arXiv preprint) | N/A | Paper |
