Mohab Safey El Din

Orcid: 0000-0001-9463-1257

Affiliations:
  • LIP6, Paris


According to our database1, Mohab Safey El Din authored at least 105 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing.
IEEE Trans. Robotics, 2024

Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results.
J. Symb. Comput., 2024

Algebraic Proofs of Path Disconnectedness using Time-Dependent Barrier Functions.
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

Solving parameter-dependent semi-algebraic systems.
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

Computing critical points for invariant algebraic systems.
J. Symb. Comput., 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

Refined $F_5$ Algorithms for Ideals of Minors of Square Matrices.
CoRR, 2023

Faster real root decision algorithm for symmetric polynomials.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Refined F5 Algorithms for Ideals of Minors of Square Matrices.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

A Direttissimo Algorithm for Equidimensional Decomposition.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Fast Algorithms for Discrete Differential Equations.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator.
IEEE Robotics Autom. Lett., 2022

Solving parametric systems of polynomial equations over the reals through Hermite matrices.
J. Symb. Comput., 2022

Guessing Gröbner bases of structured ideals of relations of sequences.
J. Symb. Comput., 2022

Singularity Analysis for the Perspective-Four and Five-Line Problems.
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

Algorithms for Discrete Differential Equations of Order 1.
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
On exact Reznick, Hilbert-Artin and Putinar's representations.
J. Symb. Comput., 2021

Exact algorithms for semidefinite programs with degenerate feasible set.
J. Symb. Comput., 2021

Solving determinantal systems using homotopy techniques.
J. Symb. Comput., 2021

Computing real radicals and <i>S</i>-radicals of polynomial systems.
J. Symb. Comput., 2021

Homotopy techniques for solving sparse column support determinantal polynomial systems.
J. Complex., 2021

Complete Singularity Analysis for the Perspective-Four-Point Problem.
Int. J. Comput. Vis., 2021

Polynomial interrupt timed automata: Verification and expressiveness.
Inf. Comput., 2021

Computing the dimension of a real algebraic set.
CoRR, 2021

On the computation of asymptotic critical values of polynomial maps and applications.
CoRR, 2021

Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Computing the Dimension of Real Algebraic Sets.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

msolve: A Library for Solving Polynomial Systems.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Special Issue on Symbolic and Algebraic Computation: ISSAC 2017.
J. Symb. Comput., 2020

Connectivity in Semi-Algebraic Sets I.
CoRR, 2020

Guessing Gr{ö}bner Bases of Structured Ideals of Relations of Sequences.
CoRR, 2020

Towards fast one-block quantifier elimination through generalised critical values.
ACM Commun. Comput. Algebra, 2020

Real root finding for low rank linear matrices.
Appl. Algebra Eng. Commun. Comput., 2020

Computing the real isolated points of an algebraic hypersurface.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Robots, computer algebra and eight connected components.
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

Computing the Volume of Compact Semi-Algebraic Sets.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
A Lower Bound on the Positive Semidefinite Rank of Convex Bodies.
SIAM J. Appl. Algebra Geom., 2018

Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization.
J. Symb. Comput., 2018

On Exact Polya, Hilbert-Artin and Putinar's Representations.
CoRR, 2018

Realcertify: a maple package for certifying non-negativity.
ACM Commun. Comput. Algebra, 2018

Real Root Finding for Equivariant Semi-algebraic Systems.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

On Exact Polya and Putinar's Representations.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

On the Complexity of Computing Real Radicals of Polynomial Systems.
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
Exact Algorithms for Linear Matrix Inequalities.
SIAM J. Optim., 2016

Real root finding for determinants of linear matrices.
J. Symb. Comput., 2016

On the complexity of computing Gröbner bases for weighted homogeneous systems.
J. Symb. Comput., 2016

Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds.
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
Polynomial Interrupt Timed Automata.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

Real Root Finding for Rank Defects in Linear Hankel Matrices.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

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, 2015

Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set.
SIAM J. Optim., 2014

Intrinsic complexity estimates in polynomial optimization.
J. Complex., 2014

A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets.
Found. Comput. Math., 2014

On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems.
CoRR, 2014

Computing necessary integrability conditions for planar parametrized homogeneous potentials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
On the complexity of the generalized MinRank problem.
J. Symb. Comput., 2013

A probabilistic algorithm to compute the real dimension of a semi-algebraic set
CoRR, 2013

Computing Gröbner bases for quasi-homogeneous systems
CoRR, 2013

Computing rational solutions of linear matrix inequalities.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

On the complexity of computing gröbner bases for quasi-homogeneous systems.
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
Variant quantifier elimination.
J. Symb. Comput., 2012

Global optimization of polynomials restricted to a smooth variety using sums of squares.
J. Symb. Comput., 2012

Critical points and Gröbner bases: the unmixed case.
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

Deciding reachability of the infimum of a multivariate polynomial.
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

On the geometry of polar varieties.
Appl. Algebra Eng. Commun. Comput., 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
The Voronoi Diagram of Three Lines.
Discret. Comput. Geom., 2009

Computing rational points in convex semi-algebraic sets and SOS decompositions
CoRR, 2009

A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces
CoRR, 2009

Variant real quantifier elimination: algorithm and application.
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

Computing the global optimum of a multivariate polynomial over the reals.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Testing Sign Conditions on a Multivariate Polynomial and Applications.
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
Real Solving for Positive Dimensional Systems.
J. Symb. Comput., 2002

2000
New Structure Theorem for Subresultants.
J. Symb. Comput., 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


  Loading...