| Publication | Date of Publication | Type |
|---|
| Local polynomial factorisation. Improving the montes algorithm | 2025-01-17 | Paper |
| Fast integral bases computation | 2025-01-10 | Paper |
Algorithm for Connectivity Queries on Real Algebraic Curves
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Validated Root Enclosures for Interval Polynomials with Multiplicities
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
| Polynomial factorization over henselian fields | 2022-07-05 | Paper |
A quasi-linear irreducibility test in \(\mathbb{K}x[y\)]
Computational Complexity | 2022-06-27 | Paper |
| Decoupling multivariate fractions | 2022-03-24 | Paper |
Computing Puiseux series: a fast divide and conquer algorithm
Annales Henri Lebesgue | 2022-02-24 | Paper |
A short contribution to the theory of regular chains
Mathematics in Computer Science | 2021-06-25 | Paper |
Computing the equisingularity type of a pseudo-irreducible polynomial
Applicable Algebra in Engineering, Communication and Computing | 2021-05-14 | Paper |
A symbolic computation approach towards the asymptotic stability analysis of differential systems with commensurate delays
Delays and Interconnections: Methodology, Algorithms and Applications | 2020-07-03 | Paper |
| Using approximate roots for irreducibility and equi-singularity issues in Kx[y] | 2019-03-30 | Paper |
An equivalence theorem for regular differential chains
Journal of Symbolic Computation | 2019-03-21 | Paper |
| Symbolic-numeric methods for nonlinear integro-differential modeling | 2018-10-23 | Paper |
Death of Marc Rybowicz, aged 52
ACM Communications in Computer Algebra | 2017-06-21 | Paper |
Continuations and monodromy on random Riemann surfaces
Proceedings of the 2009 conference on Symbolic numeric computation | 2017-02-03 | Paper |
Improving complexity bounds for the computation of Puiseux series over finite fields
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Almost linear time operations with triangular sets
ACM Communications in Computer Algebra | 2015-02-20 | Paper |
Connectivity queries on curves in Rn
ACM Communications in Computer Algebra | 2015-02-20 | Paper |
An algorithm for converting nonlinear differential equations to integral equations with an application to parameter estimation from noisy data
Computer Algebra in Scientific Computing | 2014-09-08 | Paper |
Modular composition modulo triangular sets and applications
Computational Complexity | 2013-09-30 | Paper |
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation | 2013-01-10 | Paper |
Approximate implicitization of space curves
Texts & Monographs in Symbolic Computation | 2012-09-14 | Paper |
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
Applicable Algebra in Engineering, Communication and Computing | 2012-06-20 | Paper |
Good reduction of Puiseux series and applications
Journal of Symbolic Computation | 2011-12-21 | Paper |
Computing monodromy via continuation methods on random Riemann surfaces
Theoretical Computer Science | 2011-03-29 | Paper |
Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
