Mohab Safey El Din

157 papers B 39Journal 113Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A complexity analysis of the F4 Gröbner basis algorithm with tracer data. CoRR Robin Kouba, Vincent Neiger, Mohab Safey El Din
2026	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity. J. Symb. Comput. Rémi Prébet, Mohab Safey El Din, Éric Schost
2026	J	`jnl`	Computing the connected components of real algebraic curves. CoRR Elisabetta Rocchi, Mohab Safey El Din
2025	J	`jnl`	Probabilistic algorithm for computing all local minimizers of Morse functions on a compact domain. CoRR Mohab Safey El Din, Georgy Scholten, Emmanuel Trélat
2025	J	`jnl`	Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set. CoRR Jesse Elliott, Mark Giesbrecht, Edern Gillot, Mohab Safey El Din, Éric Schost
2025	B	`conf`	Solving generic parametric linear matrix inequalities. ISSAC Simone Naldi, Mohab Safey El Din, Adrien Taylor, Weijia Wang
2025	J	`jnl`	Solving generic parametric linear matrix inequalities. CoRR Simone Naldi, Mohab Safey El Din, Adrien Taylor, Weijia Wang
2024	J	`jnl`	Algebraic Proofs of Path Disconnectedness using Time-Dependent Barrier Functions. CoRR Didier Henrion, Jared Miller, Mohab Safey El Din
2024	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results. J. Symb. Comput. Rémi Prébet, Mohab Safey El Din, Éric Schost
2024	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity. CoRR Rémi Prébet, Mohab Safey El Din, Éric Schost
2024	J	`jnl`	Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing. IEEE Trans. Robotics Alessandro Colotti, Jorge García Fontán, Alexandre Goldsztejn, Sébastien Briot, François Chaumette, Olivier Kermorgant, Mohab Safey El Din
2024	B	`conf`	Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. ISSAC Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din
2024	J	`jnl`	Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. CoRR Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din
2024	B	`conf`	Solving parameter-dependent semi-algebraic systems. ISSAC Louis Gaillard, Mohab Safey El Din
2024	J	`jnl`	Solving parameter-dependent semi-algebraic systems. CoRR Louis Gaillard, Mohab Safey El Din
2023	B	`conf`	A Direttissimo Algorithm for Equidimensional Decomposition. ISSAC Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din
2023	J	`jnl`	A Direttissimo Algorithm for Equidimensional Decomposition. CoRR Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din
2023	J	`jnl`	A signature-based algorithm for computing the nondegenerate locus of a polynomial system. J. Symb. Comput. Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din
2023	J	`jnl`	Computing critical points for invariant algebraic systems. J. Symb. Comput. Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2023	B	`conf`	Fast Algorithms for Discrete Differential Equations. ISSAC Alin Bostan, Hadrien Notarantonio, Mohab Safey El Din
2023	J	`jnl`	Fast Algorithms for Discrete Differential Equations. CoRR Alin Bostan, Hadrien Notarantonio, Mohab Safey El Din
2023	B	`conf`	Faster real root decision algorithm for symmetric polynomials. ISSAC George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2023	J	`jnl`	Faster real root decision algorithm for symmetric polynomials. CoRR George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2023	J	`jnl`	Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics. J. Symb. Comput. Jose Capco, Mohab Safey El Din, Josef Schicho
2023	J	`jnl`	Refined $F_5$ Algorithms for Ideals of Minors of Square Matrices. CoRR Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din
2023	B	`conf`	Refined F5 Algorithms for Ideals of Minors of Square Matrices. ISSAC Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din
2023	J	`jnl`	Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. SIAM J. Optim. Victor Magron, Mohab Safey El Din, Trung Hieu Vu
2022	J	`jnl`	A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System. CoRR Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din
2022	B	`conf`	Algorithms for Discrete Differential Equations of Order 1. ISSAC Alin Bostan, Frédéric Chyzak, Hadrien Notarantonio, Mohab Safey El Din
2022	J	`jnl`	Computer algebra methods for polynomial system solving at the service of image-based visual servoing. ACM Commun. Comput. Algebra Jorge García Fontán, Alessandro Colotti, Sébastien Briot, Alexandre Goldsztejn, Mohab Safey El Din
2022	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results. CoRR Rémi Prébet, Mohab Safey El Din, Éric Schost
2022	B	`conf`	Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry. ISSAC Damien Chablat, Rémi Prébet, Mohab Safey El Din, Durgesh Haribhau Salunkhe, Philippe Wenger
2022	J	`jnl`	Deciding cuspidality of manipulators through computer algebra and algorithms in real algebraic geometry. CoRR Damien Chablat, Rémi Prébet, Mohab Safey El Din, Durgesh Haribhau Salunkhe, Philippe Wenger
2022	B	`conf`	Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients. ISSAC Victor Magron, Mohab Safey El Din, Markus Schweighofer, Trung Hieu Vu
2022	J	`jnl`	Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients. CoRR Victor Magron, Mohab Safey El Din, Markus Schweighofer, Trung Hieu Vu
2022	B	`conf`	Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions. ISSAC Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din
2022	J	`jnl`	Faster change of order algorithm for Gröbner bases under shape and stability assumptions. CoRR Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din
2022	J	`jnl`	Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator. IEEE Robotics Autom. Lett. Pavel Trutman, Mohab Safey El Din, Didier Henrion, Tomás Pajdla
2022	J	`jnl`	Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems. CoRR Alin Bostan, Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din
2022	J	`jnl`	Guessing Gröbner bases of structured ideals of relations of sequences. J. Symb. Comput. Jérémy Berthomieu, Mohab Safey El Din
2022	J	`jnl`	New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon). CoRR Jérémy Berthomieu, Christian Eder, Mohab Safey El Din
2022	J	`jnl`	Singularity Analysis for the Perspective-Four and Five-Line Problems. Int. J. Comput. Vis. Jorge García Fontán, Abhilash Nayak, Sébastien Briot, Mohab Safey El Din
2022	J	`jnl`	Solving parametric systems of polynomial equations over the reals through Hermite matrices. J. Symb. Comput. Huu Phuoc Le, Mohab Safey El Din
2022	J	`jnl`	Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system. ACM Commun. Comput. Algebra Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din
2021	J	`jnl`	Complete Singularity Analysis for the Perspective-Four-Point Problem. Int. J. Comput. Vis. Beatriz Pascual-Escudero, Abhilash Nayak, Sébastien Briot, Olivier Kermorgant, Philippe Martinet, Mohab Safey El Din, François Chaumette
2021	J	`jnl`	Computing real radicals and J. Symb. Comput. Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi
2021	B	`conf`	Computing the Dimension of Real Algebraic Sets. ISSAC Pierre Lairez, Mohab Safey El Din
2021	J	`jnl`	Computing the dimension of a real algebraic set. CoRR Pierre Lairez, Mohab Safey El Din
2021	J	`jnl`	Exact algorithms for semidefinite programs with degenerate feasible set. J. Symb. Comput. Didier Henrion, Simone Naldi, Mohab Safey El Din
2021	B	`conf`	Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations. ISSAC Huu Phuoc Le, Mohab Safey El Din
2021	J	`jnl`	Faster one block quantifier elimination for regular polynomial systems of equations. CoRR Huu Phuoc Le, Mohab Safey El Din
2021	J	`jnl`	Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2021	J	`jnl`	On exact Reznick, Hilbert-Artin and Putinar's representations. J. Symb. Comput. Victor Magron, Mohab Safey El Din
2021	J	`jnl`	On the computation of asymptotic critical values of polynomial maps and applications. CoRR Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din
2021	J	`jnl`	Polynomial interrupt timed automata: Verification and expressiveness. Inf. Comput. Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
2021	J	`jnl`	Solving determinantal systems using homotopy techniques. J. Symb. Comput. Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2021	J	`jnl`	Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. CoRR Victor Magron, Mohab Safey El Din, Trung Hieu Vu
2021	B	`conf`	msolve: A Library for Solving Polynomial Systems. ISSAC Jérémy Berthomieu, Christian Eder, Mohab Safey El Din
2021	J	`jnl`	msolve: A Library for Solving Polynomial Systems. CoRR Jérémy Berthomieu, Christian Eder, Mohab Safey El Din
2020	J	`jnl`	Computing critical points for invariant algebraic systems. CoRR Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2020	J	`jnl`	Computing the Real Isolated Points of an Algebraic Hypersurface. CoRR Huu Phuoc Le, Mohab Safey El Din, Timo de Wolff
2020	B	`conf`	Computing the real isolated points of an algebraic hypersurface. ISSAC Huu Phuoc Le, Mohab Safey El Din, Timo de Wolff
2020	J	`jnl`	Connectivity in Semi-Algebraic Sets I. CoRR Hoon Hong, James Rohal, Mohab Safey El Din, Éric Schost
2020	J	`jnl`	Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator. CoRR Pavel Trutman, Mohab Safey El Din, Didier Henrion, Tomás Pajdla
2020	J	`jnl`	Guessing Gr{ö}bner Bases of Structured Ideals of Relations of Sequences. CoRR Jérémy Berthomieu, Mohab Safey El Din
2020	J	`jnl`	Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2020	J	`jnl`	Real root finding for low rank linear matrices. Appl. Algebra Eng. Commun. Comput. Didier Henrion, Simone Naldi, Mohab Safey El Din
2020	B	`conf`	Robots, computer algebra and eight connected components. ISSAC Jose Capco, Mohab Safey El Din, Josef Schicho
2020	J	`jnl`	Robots, computer algebra and eight connected components. CoRR Jose Capco, Mohab Safey El Din, Josef Schicho
2020	J	`jnl`	Solving parametric systems of polynomial equations over the reals through Hermite matrices. CoRR Huu Phuoc Le, Mohab Safey El Din
2020	J	`jnl`	Special Issue on Symbolic and Algebraic Computation: ISSAC 2017. J. Symb. Comput. Mohab Safey El Din, Chee Yap
2020	J	`jnl`	Towards fast one-block quantifier elimination through generalised critical values. ACM Commun. Comput. Algebra Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din
2019	J	`jnl`	Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials. J. Symb. Comput. Victor Magron, Mohab Safey El Din, Markus Schweighofer
2019	B	`conf`	Computing the Volume of Compact Semi-Algebraic Sets. ISSAC Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din
2019	J	`jnl`	Computing the volume of compact semi-algebraic sets. CoRR Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din
2019	J	`jnl`	SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic. Optim. Methods Softw. Didier Henrion, Simone Naldi, Mohab Safey El Din
2018	J	`jnl`	A Lower Bound on the Positive Semidefinite Rank of Convex Bodies. SIAM J. Appl. Algebra Geom. Hamza Fawzi, Mohab Safey El Din
2018	J	`jnl`	Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. J. Symb. Comput. Mohab Safey El Din, Éric Schost
2018	B	`conf`	Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set. ISSAC Didier Henrion, Simone Naldi, Mohab Safey El Din
2018	J	`jnl`	Exact algorithms for semidefinite programs with degenerate feasible set. CoRR Didier Henrion, Simone Naldi, Mohab Safey El Din
2018	B	`conf`	On Exact Polya and Putinar's Representations. ISSAC Victor Magron, Mohab Safey El Din
2018	J	`jnl`	On Exact Polya and Putinar's Representations. CoRR Victor Magron, Mohab Safey El Din
2018	J	`jnl`	On Exact Polya, Hilbert-Artin and Putinar's Representations. CoRR Victor Magron, Mohab Safey El Din
2018	B	`conf`	On the Complexity of Computing Real Radicals of Polynomial Systems. ISSAC Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi
2018	B	`conf`	Real Root Finding for Equivariant Semi-algebraic Systems. ISSAC Cordian Riener, Mohab Safey El Din
2018	J	`jnl`	Real root finding for equivariant semi-algebraic systems. CoRR Cordian Riener, Mohab Safey El Din
2018	J	`jnl`	RealCertify: a Maple package for certifying non-negativity. CoRR Victor Magron, Mohab Safey El Din
2018	J	`jnl`	Realcertify: a maple package for certifying non-negativity. ACM Commun. Comput. Algebra Victor Magron, Mohab Safey El Din
2018	J	`jnl`	Solving determinantal systems using homotopy techniques. CoRR Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2017	J	`jnl`	A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. J. ACM Mohab Safey El Din, Éric Schost
2017	J	`jnl`	A lower bound on the positive semidefinite rank of convex bodies. CoRR Hamza Fawzi, Mohab Safey El Din
2017	J	`jnl`	Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials. CoRR Victor Magron, Mohab Safey El Din, Markus Schweighofer
2017	B	`ed.`	Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017 ISSAC Michael A. Burr, Chee K. Yap, Mohab Safey El Din
2016	J	`jnl`	Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization. CoRR Mohab Safey El Din, Éric Schost
2016	B	`conf`	Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds. ISSAC Mohab Safey El Din, Pierre-Jean Spaenlehauer
2016	J	`jnl`	Critical Point Computations on Smooth Varieties: Degree and Complexity bounds. CoRR Mohab Safey El Din, Pierre-Jean Spaenlehauer
2016	B	`conf`	Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery. ISSAC Bernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron
2016	J	`jnl`	Determinantal sets, singularities and application to optimal control in medical imagery. CoRR Bernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron
2016	J	`jnl`	Exact Algorithms for Linear Matrix Inequalities. SIAM J. Optim. Didier Henrion, Simone Naldi, Mohab Safey El Din
2016	J	`jnl`	On the complexity of computing Gröbner bases for weighted homogeneous systems. J. Symb. Comput. Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron
2016	J	`jnl`	Real root finding for determinants of linear matrices. J. Symb. Comput. Didier Henrion, Simone Naldi, Mohab Safey El Din
2016	J	`jnl`	SPECTRA -a Maple library for solving linear matrix inequalities in exact arithmetic. CoRR Didier Henrion, Simone Naldi, Mohab Safey El Din
2015	J	`jnl`	Exact algorithms for linear matrix inequalities. CoRR Didier Henrion, Simone Naldi, Mohab Safey El Din
2015	B	`conf`	Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety. ISSAC Feng Guo, Mohab Safey El Din, Chu Wang, Lihong Zhi
2015	—	`conf`	Polynomial Interrupt Timed Automata. RP Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
2015	J	`jnl`	Polynomial Interrupt Timed Automata. CoRR Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
2015	B	`conf`	Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets. ISSAC Ivan Bannwarth, Mohab Safey El Din
2015	B	`conf`	Real Root Finding for Rank Defects in Linear Hankel Matrices. ISSAC Didier Henrion, Simone Naldi, Mohab Safey El Din
2015	J	`jnl`	Real root finding for low rank linear matrices. CoRR Didier Henrion, Simone Naldi, Mohab Safey El Din
2015	J	`jnl`	Real root finding for rank defects in linear Hankel matrices. CoRR Didier Henrion, Simone Naldi, Mohab Safey El Din
2014	J	`jnl`	A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. Found. Comput. Math. Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost
2014	B	`conf`	Computing necessary integrability conditions for planar parametrized homogeneous potentials. ISSAC Alin Bostan, Thierry Combot, Mohab Safey El Din
2014	J	`jnl`	Computing necessary integrability conditions for planar parametrized homogeneous potentials. CoRR Alin Bostan, Thierry Combot, Mohab Safey El Din
2014	J	`jnl`	Intrinsic complexity estimates in polynomial optimization. J. Complex. Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din
2014	J	`jnl`	On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems. CoRR Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron
2014	J	`jnl`	Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set. SIAM J. Optim. Aurélien Greuet, Mohab Safey El Din
2014	J	`jnl`	Real root finding for determinants of linear matrices. CoRR Didier Henrion, Simone Naldi, Mohab Safey El Din
2013	J	`jnl`	A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. CoRR Mohab Safey El Din, Éric Schost
2013	J	`jnl`	A probabilistic algorithm to compute the real dimension of a semi-algebraic set CoRR Mohab Safey El Din, Elias P. Tsigaridas
2013	J	`jnl`	Computing Gröbner bases for quasi-homogeneous systems CoRR Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron
2013	B	`conf`	Computing rational solutions of linear matrix inequalities. ISSAC Qingdong Guo, Mohab Safey El Din, Lihong Zhi
2013	B	`conf`	Critical point methods and effective real algebraic geometry: new results and trends. ISSAC Mohab Safey El Din
2013	J	`jnl`	Intrinsic complexity estimates in polynomial optimization CoRR Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din
2013	B	`conf`	On the complexity of computing gröbner bases for quasi-homogeneous systems. ISSAC Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron
2013	J	`jnl`	On the complexity of the generalized MinRank problem. J. Symb. Comput. Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2013	J	`jnl`	Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set. CoRR Aurélien Greuet, Mohab Safey El Din
2012	J	`jnl`	A baby step-giant step roadmap algorithm for general algebraic sets CoRR Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost
2012	J	`jnl`	Critical Points and Gröbner Bases: the Unmixed Case CoRR Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2012	B	`conf`	Critical points and Gröbner bases: the unmixed case. ISSAC Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2012	J	`jnl`	Global optimization of polynomials restricted to a smooth variety using sums of squares. J. Symb. Comput. Aurélien Greuet, Feng Guo, Mohab Safey El Din, Lihong Zhi
2012	J	`jnl`	Variant quantifier elimination. J. Symb. Comput. Hoon Hong, Mohab Safey El Din
2011	J	`jnl`	A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface. Discret. Comput. Geom. Mohab Safey El Din, Éric Schost
2011	B	`conf`	Deciding reachability of the infimum of a multivariate polynomial. ISSAC Aurélien Greuet, Mohab Safey El Din
2011	J	`jnl`	Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. J. Symb. Comput. Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2011	J	`jnl`	On the Complexity of the Generalized MinRank Problem CoRR Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2010	J	`jnl`	Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions. SIAM J. Optim. Mohab Safey El Din, Lihong Zhi
2010	B	`conf`	Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. ISSAC Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2010	B	`conf`	Global optimization of polynomials using generalized critical values and sums of squares. ISSAC Feng Guo, Mohab Safey El Din, Lihong Zhi
2010	J	`jnl`	Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity CoRR Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2010	J	`jnl`	On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput. Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost
2009	J	`jnl`	A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces CoRR Mohab Safey El Din, Éric Schost
2009	J	`jnl`	Computing rational points in convex semi-algebraic sets and SOS decompositions CoRR Mohab Safey El Din, Lihong Zhi
2009	J	`jnl`	The Voronoi Diagram of Three Lines. Discret. Comput. Geom. Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din
2009	B	`conf`	Variant real quantifier elimination: algorithm and application. ISSAC Hoon Hong, Mohab Safey El Din
2008	B	`conf`	Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. ISSAC Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, Mohab Safey El Din
2008	B	`conf`	Computing the global optimum of a multivariate polynomial over the reals. ISSAC Mohab Safey El Din
2007	—	`conf`	POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations. PASCO Mohab Safey El Din, Philippe Trebuchet
2007	—	`conf`	Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping. ASCM Mohab Safey El Din
2007	J	`jnl`	Testing Sign Conditions on a Multivariate Polynomial and Applications. Math. Comput. Sci. Mohab Safey El Din
2007	—	`conf`	The voronoi diagram of three lines. SCG Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din
2006	J	`jnl`	Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry CoRR Mohab Safey El Din, Philippe Trebuchet
2004	J	`jnl`	Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. Discret. Comput. Geom. Mohab Safey El Din, Éric Schost
2003	B	`conf`	Polar varieties and computation of one point in each connected component of a smooth real algebraic set. ISSAC Mohab Safey El Din, Éric Schost
2002	J	`jnl`	Real Solving for Positive Dimensional Systems. J. Symb. Comput. Philippe Aubry, Fabrice Rouillier, Mohab Safey El Din
2000	J	`jnl`	Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation. J. Complex. Fabrice Rouillier, Marie-Françoise Roy, Mohab Safey El Din
2000	J	`jnl`	New Structure Theorem for Subresultants. J. Symb. Comput. Henri Lombardi, Marie-Françoise Roy, Mohab Safey El Din
2000	—	`conf`	Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study. Automated Deduction in Geometry Fabrice Rouillier, Mohab Safey El Din, Éric Schost