| Publication | Date of Publication | Type |
|---|
| msolve. A library for solving polynomial systems | 2025-01-20 | Paper |
| Computing the dimension of real algebraic sets | 2025-01-20 | Paper |
| Faster one block quantifier elimination for regular polynomial systems of equations | 2025-01-20 | Paper |
| Algorithms for discrete differential equations of order 1 | 2025-01-17 | Paper |
| Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients | 2025-01-17 | Paper |
| Faster change of order algorithm for Gröbner bases under shape and stability assumptions | 2025-01-17 | Paper |
| Deciding cuspidality of manipulators through computer algebra and algorithms in real algebraic geometry | 2025-01-17 | Paper |
On the degree of varieties of sum of squares
Journal of Pure and Applied Algebra | 2024-03-20 | 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 |
A Direttissimo Algorithm for Equidimensional Decomposition
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Fast Algorithms for Discrete Differential Equations
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Stability analysis of a bacterial growth model through computer algebra
MathematicS In Action | 2023-11-03 | Paper |
Faster real root decision algorithm for symmetric polynomials
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
Journal of Symbolic Computation | 2023-08-10 | Paper |
Computer algebra methods for polynomial system solving at the service of image-based visual servoing
ACM Communications in Computer Algebra | 2023-08-02 | Paper |
Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system
ACM Communications in Computer Algebra | 2023-08-02 | Paper |
A signature-based algorithm for computing the nondegenerate locus of a polynomial system
Journal of Symbolic Computation | 2023-06-29 | Paper |
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
SIAM Journal on Optimization | 2023-03-30 | Paper |
| Algebraic certificates for the truncated moment problem | 2023-02-14 | Paper |
Computing critical points for invariant algebraic systems
Journal of Symbolic Computation | 2022-11-21 | Paper |
Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
Journal of Symbolic Computation | 2022-09-22 | 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 |
Solving parametric systems of polynomial equations over the reals through Hermite matrices
Journal of Symbolic Computation | 2022-03-21 | Paper |
| Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry | 2022-03-09 | 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 |
Complete singularity analysis for the perspective-four-point problem
International Journal of Computer Vision | 2021-12-02 | Paper |
Homotopy techniques for solving sparse column support determinantal polynomial systems
Journal of Complexity | 2021-09-02 | Paper |
On exact Reznick, Hilbert-Artin and Putinar's representations
Journal of Symbolic Computation | 2021-06-03 | Paper |
Polynomial interrupt timed automata: verification and expressiveness
Information and Computation | 2021-04-13 | Paper |
Solving determinantal systems using homotopy techniques
Journal of Symbolic Computation | 2021-02-18 | Paper |
Exact algorithms for semidefinite programs with degenerate feasible set
Journal of Symbolic Computation | 2021-02-18 | Paper |
Computing the real isolated points of an algebraic hypersurface
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Robots, computer algebra and eight connected components
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
| Connectivity in Semi-Algebraic Sets I | 2020-11-04 | Paper |
Computing real radicals and \(S\)-radicals of polynomial systems
Journal of Symbolic Computation | 2020-09-19 | Paper |
Computing the volume of compact semi-algebraic sets
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
On the complexity of computing real radicals of polynomial systems
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
On exact Polya and Putinar's representations
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Real root finding for equivariant semi-algebraic systems
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Exact algorithms for semidefinite programs with degenerate feasible set
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Real root finding for low rank linear matrices
Applicable Algebra in Engineering, Communication and Computing | 2020-04-28 | Paper |
{\textsc{RealCertify}}: a Maple package for certifying non-negativity
ACM Communications in Computer Algebra | 2019-03-29 | Paper |
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
Journal of Symbolic Computation | 2019-03-21 | Paper |
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
Journal of the ACM | 2018-08-02 | Paper |
A lower bound on the positive semidefinite rank of convex bodies
SIAM Journal on Applied Algebra and Geometry | 2018-06-12 | Paper |
Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
Journal of Symbolic Computation | 2018-01-12 | Paper |
Polynomial interrupt timed automata
(available as arXiv preprint) | 2017-10-27 | Paper |
Critical point computations on smooth varieties, degree and complexity bounds
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
On the complexity of computing Gröbner bases for quasi-homogeneous systems
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
On the complexity of computing Gröbner bases for quasi-homogeneous systems
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Computing rational solutions of linear matrix inequalities
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Exact algorithms for linear matrix inequalities
SIAM Journal on Optimization | 2016-11-23 | Paper |
Probabilistic algorithm for computing the dimension of real algebraic sets
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Real root finding for rank defects in linear Hankel matrices
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Optimizing a parametric linear function over a non-compact real algebraic variety
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
On the complexity of computing Gröbner bases for weighted homogeneous systems
Journal of Symbolic Computation | 2016-02-19 | Paper |
Real root finding for determinants of linear matrices
Journal of Symbolic Computation | 2015-12-08 | Paper |
Computing necessary integrability conditions for planar parametrized homogeneous potentials
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Computing necessary integrability conditions for planar parametrized homogeneous potentials
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Global optimization of polynomials using generalized critical values and sums of squares
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Deciding reachability of the infimum of a multivariate polynomial
Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
Critical points and Gröbner bases: the unmixed case
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
A baby step-giant step roadmap algorithm for general algebraic sets
Foundations of Computational Mathematics | 2015-01-16 | Paper |
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
SIAM Journal on Optimization | 2014-12-12 | Paper |
Intrinsic complexity estimates in polynomial optimization
Journal of Complexity | 2014-07-15 | Paper |
On the complexity of the generalized MinRank problem
Journal of Symbolic Computation | 2014-01-08 | Paper |
Variant quantifier elimination
Journal of Symbolic Computation | 2012-05-23 | Paper |
Variant real quantifier elimination: algorithm and application
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
Global optimization of polynomials restricted to a smooth variety using sums of squares
Journal of Symbolic Computation | 2012-05-04 | Paper |
Computing rational points in convex semialgebraic sets and sum of squares decompositions
SIAM Journal on Optimization | 2011-03-21 | Paper |
A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
Discrete & Computational Geometry | 2011-03-10 | Paper |
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
Journal of Symbolic Computation | 2011-03-09 | Paper |
| Computing roadmaps in smooth real algebraic sets | 2010-06-17 | Paper |
On the geometry of polar varieties
Applicable Algebra in Engineering, Communication and Computing | 2010-03-01 | Paper |
The Voronoi diagram of three lines
Discrete & Computational Geometry | 2009-07-06 | Paper |
| The Voronoi diagram of three lines | 2009-02-12 | Paper |
Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
Computer Mathematics | 2009-01-29 | Paper |
Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Computing the global optimum of a multivariate polynomial over the reals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Testing sign conditions on a multivariate polynomial and applications
Mathematics in Computer Science | 2008-01-04 | Paper |
| scientific article; zbMATH DE number 2151204 (Why is no real title available?) | 2005-04-04 | Paper |
Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
Discrete & Computational Geometry | 2005-01-25 | Paper |
Real solving for positive dimensional systems.
Journal of Symbolic Computation | 2003-04-02 | Paper |
Finding at least one point in each connected component of a real algebraic set defined by a single equation
Journal of Complexity | 2003-04-01 | Paper |
| scientific article; zbMATH DE number 1745033 (Why is no real title available?) | 2002-05-23 | Paper |
New structure theorem for subresultants
Journal of Symbolic Computation | 2001-09-12 | Paper |
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
(available as arXiv preprint) | N/A | Paper |
"Optimized Gr\""obner basis algorithms for maximal determinantal ideals and critical point computations"
(available as arXiv preprint) | N/A | Paper |
Solving parameter-dependent semi-algebraic systems
(available as arXiv preprint) | N/A | Paper |
