default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohab Safey El Din
Person information
- affiliation: LIP6, Paris
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j47]Rémi Prébet
, Mohab Safey El Din, Éric Schost:
Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results. J. Symb. Comput. 120: 102234 (2024)- [j46]Alessandro Colotti, Jorge García Fontán, Alexandre Goldsztejn, Sébastien Briot, François Chaumette, Olivier Kermorgant, Mohab Safey El Din:
Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing. IEEE Trans. Robotics 40: 3406-3424 (2024) - [c42]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. ISSAC 2024: 400-409 - [c41]Louis Gaillard, Mohab Safey El Din:
Solving parameter-dependent semi-algebraic systems. ISSAC 2024: 447-456 - [i60]Rémi Prébet, Mohab Safey El Din, Éric Schost:
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity. CoRR abs/2402.03111 (2024) - [i59]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. CoRR abs/2402.07353 (2024) - [i58]Louis Gaillard, Mohab Safey El Din:
Solving parameter-dependent semi-algebraic systems. CoRR abs/2402.07782 (2024) - [i57]Didier Henrion, Jared Miller, Mohab Safey El Din:
Algebraic Proofs of Path Disconnectedness using Time-Dependent Barrier Functions. CoRR abs/2404.06985 (2024) - 2023
- [j45]Jose Capco, Mohab Safey El Din, Josef Schicho:
Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics. J. Symb. Comput. 115: 320-345 (2023) - [j44]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. J. Symb. Comput. 116: 365-399 (2023) - [j43]Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din:
A signature-based algorithm for computing the nondegenerate locus of a polynomial system. J. Symb. Comput. 119: 1-21 (2023) - [j42]Victor Magron, Mohab Safey El Din, Trung Hieu Vu:
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. SIAM J. Optim. 33(1): 63-88 (2023) - [c40]Alin Bostan, Hadrien Notarantonio, Mohab Safey El Din:
Fast Algorithms for Discrete Differential Equations. ISSAC 2023: 80-89 - [c39]Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din:
A Direttissimo Algorithm for Equidimensional Decomposition. ISSAC 2023: 260-269 - [c38]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Refined F5 Algorithms for Ideals of Minors of Square Matrices. ISSAC 2023: 270-279 - [c37]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. ISSAC 2023: 452-460 - [i56]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Refined $F_5$ Algorithms for Ideals of Minors of Square Matrices. CoRR abs/2302.05375 (2023) - [i55]Alin Bostan, Hadrien Notarantonio, Mohab Safey El Din:
Fast Algorithms for Discrete Differential Equations. CoRR abs/2302.06203 (2023) - [i54]Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din:
A Direttissimo Algorithm for Equidimensional Decomposition. CoRR abs/2302.08174 (2023) - [i53]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. CoRR abs/2306.03855 (2023) - 2022
- [j41]Jorge García Fontán, Alessandro Colotti, Sébastien Briot, Alexandre Goldsztejn, Mohab Safey El Din:
Computer algebra methods for polynomial system solving at the service of image-based visual servoing. ACM Commun. Comput. Algebra 56(2): 36-40 (2022) - [j40]Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din:
Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system. ACM Commun. Comput. Algebra 56(2): 41-45 (2022) - [j39]Jorge García Fontán, Abhilash Nayak, Sébastien Briot, Mohab Safey El Din:
Singularity Analysis for the Perspective-Four and Five-Line Problems. Int. J. Comput. Vis. 130(4): 909-932 (2022) - [j38]Jérémy Berthomieu, Mohab Safey El Din:
Guessing Gröbner bases of structured ideals of relations of sequences. J. Symb. Comput. 111: 1-26 (2022) - [j37]Huu Phuoc Le, Mohab Safey El Din:
Solving parametric systems of polynomial equations over the reals through Hermite matrices. J. Symb. Comput. 112: 25-61 (2022) - [j36]Pavel Trutman, Mohab Safey El Din, Didier Henrion, Tomás Pajdla:
Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator. IEEE Robotics Autom. Lett. 7(3): 6012-6019 (2022) - [c36]Alin Bostan, Frédéric Chyzak, Hadrien Notarantonio, Mohab Safey El Din:
Algorithms for Discrete Differential Equations of Order 1. ISSAC 2022: 101-110 - [c35]Victor Magron, Mohab Safey El Din, Markus Schweighofer, Trung Hieu Vu:
Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients. ISSAC 2022: 325-332 - [c34]Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din:
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions. ISSAC 2022: 409-418 - [c33]Damien Chablat, Rémi Prébet, Mohab Safey El Din, Durgesh Haribhau Salunkhe, Philippe Wenger:
Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry. ISSAC 2022: 439-448 - [i52]Victor Magron, Mohab Safey El Din, Markus Schweighofer, Trung Hieu Vu:
Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients. CoRR abs/2202.06544 (2022) - [i51]Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din:
Faster change of order algorithm for Gröbner bases under shape and stability assumptions. CoRR abs/2202.09226 (2022) - [i50]Jérémy Berthomieu, Christian Eder, Mohab Safey El Din:
New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon). CoRR abs/2202.13387 (2022) - [i49]Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din:
A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System. CoRR abs/2202.13784 (2022) - [i48]Rémi Prébet, Mohab Safey El Din, Éric Schost:
Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results. CoRR abs/2203.03961 (2022) - [i47]Damien Chablat, Rémi Prébet, Mohab Safey El Din, Durgesh Haribhau Salunkhe, Philippe Wenger:
Deciding cuspidality of manipulators through computer algebra and algorithms in real algebraic geometry. CoRR abs/2203.04578 (2022) - [i46]Alin Bostan, Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems. CoRR abs/2203.10021 (2022) - 2021
- [j35]Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas:
Polynomial interrupt timed automata: Verification and expressiveness. Inf. Comput. 277: 104580 (2021) - [j34]Beatriz Pascual-Escudero, Abhilash Nayak, Sébastien Briot, Olivier Kermorgant, Philippe Martinet, Mohab Safey El Din, François Chaumette:
Complete Singularity Analysis for the Perspective-Four-Point Problem. Int. J. Comput. Vis. 129(4): 1217-1237 (2021) - [j33]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. 66: 101557 (2021) - [j32]Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi:
Computing real radicals and S-radicals of polynomial systems. J. Symb. Comput. 102: 259-278 (2021) - [j31]Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Solving determinantal systems using homotopy techniques. J. Symb. Comput. 104: 754-804 (2021) - [j30]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Exact algorithms for semidefinite programs with degenerate feasible set. J. Symb. Comput. 104: 942-959 (2021) - [j29]Victor Magron, Mohab Safey El Din:
On exact Reznick, Hilbert-Artin and Putinar's representations. J. Symb. Comput. 107: 221-250 (2021) - [c32]Jérémy Berthomieu, Christian Eder, Mohab Safey El Din:
msolve: A Library for Solving Polynomial Systems. ISSAC 2021: 51-58 - [c31]Pierre Lairez, Mohab Safey El Din:
Computing the Dimension of Real Algebraic Sets. ISSAC 2021: 257-264 - [c30]Huu Phuoc Le, Mohab Safey El Din:
Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations. ISSAC 2021: 265-272 - [i45]Huu Phuoc Le, Mohab Safey El Din:
Faster one block quantifier elimination for regular polynomial systems of equations. CoRR abs/2103.13735 (2021) - [i44]Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
On the computation of asymptotic critical values of polynomial maps and applications. CoRR abs/2104.00913 (2021) - [i43]Jérémy Berthomieu, Christian Eder, Mohab Safey El Din:
msolve: A Library for Solving Polynomial Systems. CoRR abs/2104.03572 (2021) - [i42]Pierre Lairez, Mohab Safey El Din:
Computing the dimension of a real algebraic set. CoRR abs/2105.10255 (2021) - [i41]Victor Magron, Mohab Safey El Din, Trung Hieu Vu:
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. CoRR abs/2107.11825 (2021) - 2020
- [j28]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real root finding for low rank linear matrices. Appl. Algebra Eng. Commun. Comput. 31(2): 101-133 (2020) - [j27]Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
Towards fast one-block quantifier elimination through generalised critical values. ACM Commun. Comput. Algebra 54(3): 109-113 (2020) - [j26]Mohab Safey El Din, Chee Yap:
Special Issue on Symbolic and Algebraic Computation: ISSAC 2017. J. Symb. Comput. 98: 1-2 (2020) - [c29]Jose Capco, Mohab Safey El Din, Josef Schicho:
Robots, computer algebra and eight connected components. ISSAC 2020: 62-69 - [c28]Huu Phuoc Le, Mohab Safey El Din, Timo de Wolff:
Computing the real isolated points of an algebraic hypersurface. ISSAC 2020: 297-304 - [i40]Pavel Trutman, Mohab Safey El Din, Didier Henrion, Tomás Pajdla:
Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator. CoRR abs/2007.12550 (2020) - [i39]Huu Phuoc Le, Mohab Safey El Din, Timo de Wolff:
Computing the Real Isolated Points of an Algebraic Hypersurface. CoRR abs/2008.10331 (2020) - [i38]Jose Capco, Mohab Safey El Din, Josef Schicho:
Robots, computer algebra and eight connected components. CoRR abs/2008.13392 (2020) - [i37]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR abs/2009.00844 (2020) - [i36]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. CoRR abs/2009.00847 (2020) - [i35]Jérémy Berthomieu, Mohab Safey El Din:
Guessing Gr{ö}bner Bases of Structured Ideals of Relations of Sequences. CoRR abs/2009.05248 (2020) - [i34]Hoon Hong, James Rohal, Mohab Safey El Din, Éric Schost:
Connectivity in Semi-Algebraic Sets I. CoRR abs/2011.02162 (2020) - [i33]Huu Phuoc Le, Mohab Safey El Din:
Solving parametric systems of polynomial equations over the reals through Hermite matrices. CoRR abs/2011.14136 (2020)
2010 – 2019
- 2019
- [j25]Victor Magron, Mohab Safey El Din, Markus Schweighofer:
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials. J. Symb. Comput. 93: 200-220 (2019) - [j24]Didier Henrion, Simone Naldi, Mohab Safey El Din:
SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic. Optim. Methods Softw. 34(1): 62-78 (2019) - [c27]Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din:
Computing the Volume of Compact Semi-Algebraic Sets. ISSAC 2019: 259-266 - [i32]Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din:
Computing the volume of compact semi-algebraic sets. CoRR abs/1904.11705 (2019) - 2018
- [j23]Victor Magron, Mohab Safey El Din:
Realcertify: a maple package for certifying non-negativity. ACM Commun. Comput. Algebra 52(2): 34-37 (2018) - [j22]Mohab Safey El Din, Éric Schost:
Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. J. Symb. Comput. 87: 176-206 (2018) - [j21]Hamza Fawzi, Mohab Safey El Din:
A Lower Bound on the Positive Semidefinite Rank of Convex Bodies. SIAM J. Appl. Algebra Geom. 2(1): 126-139 (2018) - [c26]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set. ISSAC 2018: 191-198 - [c25]Victor Magron, Mohab Safey El Din:
On Exact Polya and Putinar's Representations. ISSAC 2018: 279-286 - [c24]Cordian Riener, Mohab Safey El Din:
Real Root Finding for Equivariant Semi-algebraic Systems. ISSAC 2018: 335-342 - [c23]Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi:
On the Complexity of Computing Real Radicals of Polynomial Systems. ISSAC 2018: 351-358 - [i31]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Exact algorithms for semidefinite programs with degenerate feasible set. CoRR abs/1802.02834 (2018) - [i30]Victor Magron, Mohab Safey El Din:
On Exact Polya and Putinar's Representations. CoRR abs/1802.10339 (2018) - [i29]Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Solving determinantal systems using homotopy techniques. CoRR abs/1802.10409 (2018) - [i28]Victor Magron, Mohab Safey El Din:
RealCertify: a Maple package for certifying non-negativity. CoRR abs/1805.02201 (2018) - [i27]Cordian Riener, Mohab Safey El Din:
Real root finding for equivariant semi-algebraic systems. CoRR abs/1806.08121 (2018) - [i26]Victor Magron, Mohab Safey El Din:
On Exact Polya, Hilbert-Artin and Putinar's Representations. CoRR abs/1811.10062 (2018) - 2017
- [j20]Mohab Safey El Din, Éric Schost:
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. J. ACM 63(6): 48:1-48:37 (2017) - [e1]Michael A. Burr, Chee K. Yap, Mohab Safey El Din:
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. ACM 2017, ISBN 978-1-4503-5064-8 [contents] - [i25]Hamza Fawzi, Mohab Safey El Din:
A lower bound on the positive semidefinite rank of convex bodies. CoRR abs/1705.06996 (2017) - [i24]Victor Magron, Mohab Safey El Din, Markus Schweighofer:
Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials. CoRR abs/1706.03941 (2017) - 2016
- [j19]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real root finding for determinants of linear matrices. J. Symb. Comput. 74: 205-238 (2016) - [j18]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
On the complexity of computing Gröbner bases for weighted homogeneous systems. J. Symb. Comput. 76: 107-141 (2016) - [j17]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Exact Algorithms for Linear Matrix Inequalities. SIAM J. Optim. 26(4): 2512-2539 (2016) - [c22]Bernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron:
Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery. ISSAC 2016: 103-110 - [c21]Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds. ISSAC 2016: 183-190 - [i23]Bernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron:
Determinantal sets, singularities and application to optimal control in medical imagery. CoRR abs/1605.00887 (2016) - [i22]Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds. CoRR abs/1605.02518 (2016) - [i21]Mohab Safey El Din, Éric Schost:
Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization. CoRR abs/1605.07433 (2016) - [i20]Didier Henrion, Simone Naldi, Mohab Safey El Din:
SPECTRA -a Maple library for solving linear matrix inequalities in exact arithmetic. CoRR abs/1611.01947 (2016) - 2015
- [c20]Ivan Bannwarth, Mohab Safey El Din:
Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets. ISSAC 2015: 37-44 - [c19]Feng Guo, Mohab Safey El Din, Chu Wang, Lihong Zhi:
Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety. ISSAC 2015: 205-212 - [c18]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real Root Finding for Rank Defects in Linear Hankel Matrices. ISSAC 2015: 221-228 - [c17]Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas:
Polynomial Interrupt Timed Automata. RP 2015: 20-32 - [i19]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real root finding for rank defects in linear Hankel matrices. CoRR abs/1502.02473 (2015) - [i18]Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas:
Polynomial Interrupt Timed Automata. CoRR abs/1504.04541 (2015) - [i17]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real root finding for low rank linear matrices. CoRR abs/1506.05897 (2015) - [i16]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Exact algorithms for linear matrix inequalities. CoRR abs/1508.03715 (2015) - 2014
- [j16]Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost:
A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. Found. Comput. Math. 14(6): 1117-1172 (2014) - [j15]Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din:
Intrinsic complexity estimates in polynomial optimization. J. Complex. 30(4): 430-443 (2014) - [j14]Aurélien Greuet, Mohab Safey El Din:
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set. SIAM J. Optim. 24(3): 1313-1343 (2014) - [c16]Alin Bostan, Thierry Combot, Mohab Safey El Din:
Computing necessary integrability conditions for planar parametrized homogeneous potentials. ISSAC 2014: 67-74 - [i15]Alin Bostan, Thierry Combot, Mohab Safey El Din:
Computing necessary integrability conditions for planar parametrized homogeneous potentials. CoRR abs/1405.5342 (2014) - [i14]Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real root finding for determinants of linear matrices. CoRR abs/1412.5873 (2014) - [i13]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems. CoRR abs/1412.7547 (2014) - 2013
- [j13]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
On the complexity of the generalized MinRank problem. J. Symb. Comput. 55: 30-58 (2013) - [c15]Mohab Safey El Din:
Critical point methods and effective real algebraic geometry: new results and trends. ISSAC 2013: 5-6 - [c14]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
On the complexity of computing gröbner bases for quasi-homogeneous systems. ISSAC 2013: 189-196 - [c13]Qingdong Guo, Mohab Safey El Din, Lihong Zhi:
Computing rational solutions of linear matrix inequalities. ISSAC 2013: 197-204 - [i12]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
Computing Gröbner bases for quasi-homogeneous systems. CoRR abs/1301.5612 (2013) - [i11]Mohab Safey El Din, Elias P. Tsigaridas:
A probabilistic algorithm to compute the real dimension of a semi-algebraic set. CoRR abs/1304.1928 (2013) - [i10]Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din:
Intrinsic complexity estimates in polynomial optimization. CoRR abs/1304.5214 (2013) - [i9]Mohab Safey El Din, Éric Schost:
A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. CoRR abs/1307.7836 (2013) - [i8]Aurélien Greuet, Mohab Safey El Din:
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set. CoRR abs/1307.8281 (2013) - 2012
- [j12]