Mohab Safey El Din
Orcid: 0000-0001-9463-1257Affiliations:
- LIP6, Paris
According to our database1,
Mohab Safey El Din
authored at least 105 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing.
IEEE Trans. Robotics, 2024
J. Symb. Comput., 2024
CoRR, 2024
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity.
CoRR, 2024
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
2023
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients.
SIAM J. Optim., March, 2023
A signature-based algorithm for computing the nondegenerate locus of a polynomial system.
J. Symb. Comput., 2023
Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics.
J. Symb. Comput., 2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
2022
IEEE Robotics Autom. Lett., 2022
Solving parametric systems of polynomial equations over the reals through Hermite matrices.
J. Symb. Comput., 2022
J. Symb. Comput., 2022
Int. J. Comput. Vis., 2022
Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems.
CoRR, 2022
New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon).
CoRR, 2022
Computer algebra methods for polynomial system solving at the service of image-based visual servoing.
ACM Commun. Comput. Algebra, 2022
Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system.
ACM Commun. Comput. Algebra, 2022
Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022
Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022
2021
J. Symb. Comput., 2021
J. Symb. Comput., 2021
J. Symb. Comput., 2021
Homotopy techniques for solving sparse column support determinantal polynomial systems.
J. Complex., 2021
Int. J. Comput. Vis., 2021
Inf. Comput., 2021
On the computation of asymptotic critical values of polynomial maps and applications.
CoRR, 2021
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021
2020
J. Symb. Comput., 2020
ACM Commun. Comput. Algebra, 2020
Appl. Algebra Eng. Commun. Comput., 2020
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020
2019
SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic.
Optim. Methods Softw., 2019
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials.
J. Symb. Comput., 2019
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019
2018
SIAM J. Appl. Algebra Geom., 2018
Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization.
J. Symb. Comput., 2018
ACM Commun. Comput. Algebra, 2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
2017
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets.
J. ACM, 2017
Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials.
CoRR, 2017
2016
J. Symb. Comput., 2016
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016
Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016
2015
Proceedings of the Reachability Problems - 9th International Workshop, 2015
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015
2014
SIAM J. Optim., 2014
Found. Comput. Math., 2014
CoRR, 2014
Computing necessary integrability conditions for planar parametrized homogeneous potentials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014
2013
CoRR, 2013
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
Critical point methods and effective real algebraic geometry: new results and trends.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
2012
Global optimization of polynomials restricted to a smooth variety using sums of squares.
J. Symb. Comput., 2012
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity.
J. Symb. Comput., 2011
A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface.
Discret. Comput. Geom., 2011
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011
2010
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions.
SIAM J. Optim., 2010
Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity
CoRR, 2010
Global optimization of polynomials using generalized critical values and sums of squares.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
2009
CoRR, 2009
A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces
CoRR, 2009
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009
2008
Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
2007
Math. Comput. Sci., 2007
POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations.
Proceedings of the Parallel Symbolic Computation, 2007
Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping.
Proceedings of the Computer Mathematics, 8th Asian Symposium, 2007
2006
Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry
CoRR, 2006
2004
Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set.
Discret. Comput. Geom., 2004
2003
Polar varieties and computation of one point in each connected component of a smooth real algebraic set.
Proceedings of the Symbolic and Algebraic Computation, 2003
2002
2000
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation.
J. Complex., 2000
Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study.
Proceedings of the Automated Deduction in Geometry, Third International Workshop, 2000