Mohab Safey El Din

Author Info

Name	Affiliation	Papers
MOHAB SAFEY EL DIN	INRIA, Paris-Rocquencourt, SALSA Project, UPMC, Univ Paris 06, LIP6 CNRS, UMR 7606, LIP6 UFR Ingéniérie 919, LIP6 Passy-Kennedy Case 169, 4, Place Jussieu, F-75252 Paris, France	67
Collaborators	Citations	PageRank
64	450	35.64
Referers	Referees	References
318	483	828

Search Limit

100483

Publications (67 rows)

Collaborators (64 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics	0	0.34	2023
Solving parametric systems of polynomial equations over the reals through Hermite matrices	0	0.34	2022
Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator	0	0.34	2022
Complete Singularity Analysis For The Perspective-Four-Point Problem	2	0.38	2021
Computing real radicals and S-radicals of polynomial systems	0	0.34	2021
Exact algorithms for semidefinite programs with degenerate feasible set	0	0.34	2021
Homotopy techniques for solving sparse column support determinantal polynomial systems	0	0.34	2021
On exact Reznick, Hilbert-Artin and Putinar's representations	0	0.34	2021
Special Issue on Symbolic and Algebraic Computation: ISSAC 2017.	0	0.34	2020
Real root finding for low rank linear matrices	2	0.37	2020
Computing the volume of compact semi-algebraic sets.	1	0.35	2019
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials	2	0.41	2019
SPECTRA -a Maple library for solving linear matrix inequalities in exact arithmetic.	0	0.34	2019
Exact Algorithms For Semidefinite Programs With Degenerate Feasible Set	0	0.34	2018
On Exact Polya, Hilbert-Artin and Putinar's Representations.	0	0.34	2018
RealCertify: a Maple package for certifying non-negativity.	1	0.36	2018
On Exact Polya And Putinar'S Representations	1	0.36	2018
Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization.	3	0.38	2018
Real Root Finding For Equivariant Semi-Algebraic Systems	0	0.34	2018
On The Complexity Of Computing Real Radicals Of Polynomial Systems	1	0.35	2018
Solving determinantal systems using homotopy techniques	0	0.34	2018
A Lower Bound On The Positive Semidefinite Rank Of Convex Bodies	0	0.34	2017
On the complexity of computing Gröbner bases for weighted homogeneous systems	0	0.34	2016
Determinantal sets, singularities and application to optimal control in medical imagery.	1	0.35	2016
Real root finding for determinants of linear matrices.	3	0.39	2016
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds.	3	0.39	2016
Exact algorithms for linear matrix inequalities	9	0.53	2015
Polynomial Interrupt Timed Automata.	0	0.34	2015
Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety	0	0.34	2015
Real root finding for rank defects in linear Hankel matrices.	3	0.39	2015
Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets	2	0.37	2015
On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems.	0	0.34	2014
Critical point methods and effective real algebraic geometry: new results and trends	1	0.38	2013
A probabilistic algorithm to compute the real dimension of a semi-algebraic set	0	0.34	2013
Intrinsic complexity estimates in polynomial optimization.	7	0.44	2013
On the complexity of the generalized MinRank problem.	15	0.72	2013
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set.	17	0.63	2013
A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets.	8	0.50	2013
On the complexity of computing gröbner bases for quasi-homogeneous systems	6	0.47	2013
Computing Gröbner bases for quasi-homogeneous systems	0	0.34	2013
A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets	9	0.51	2012
Global optimization of polynomials restricted to a smooth variety using sums of squares	11	0.58	2012
Variant quantifier elimination	12	0.64	2012
Critical points and Gröbner bases: the unmixed case	12	0.57	2012
A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface	15	0.86	2011
Deciding reachability of the infimum of a multivariate polynomial	11	0.53	2011
On the geometry of polar varieties	31	1.26	2010
Connectivity in Semi-algebraic Sets	0	0.34	2010
Global optimization of polynomials using generalized critical values and sums of squares	11	0.65	2010
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology	25	1.24	2010

1
2
50 / page