Mohab Safey El Din

	2012
30		Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost: A baby step-giant step roadmap algorithm for general algebraic sets CoRR abs/1201.6439: (2012)
29		Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer: Critical Points and Gröbner Bases: the Unmixed Case CoRR abs/1202.0179: (2012)
28		Aurélien Greuet, Feng Guo, Mohab Safey El Din, Lihong Zhi: Global optimization of polynomials restricted to a smooth variety using sums of squares. J. Symb. Comput. 47(5): 503-518 (2012)
27		Hoon Hong, Mohab Safey El Din: Variant quantifier elimination. J. Symb. Comput. 47(7): 883-901 (2012)
	2011
26		Aurélien Greuet, Mohab Safey El Din: Deciding reachability of the infimum of a multivariate polynomial. ISSAC 2011: 131-138
25		Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer: On the Complexity of the Generalized MinRank Problem CoRR abs/1112.4411: (2011)
24		Mohab Safey El Din, Éric Schost: A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface. Discrete & Computational Geometry 45(1): 181-220 (2011)
23		Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer: Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. J. Symb. Comput. 46(4): 406-437 (2011)
	2010
22		Feng Guo, Mohab Safey El Din, Lihong Zhi: Global optimization of polynomials using generalized critical values and sums of squares. ISSAC 2010: 107-114
21		Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer: Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. ISSAC 2010: 257-264
20		Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost: On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput. 21(1): 33-83 (2010)
19		Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer: Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity CoRR abs/1001.4004: (2010)
18		Mohab Safey El Din, Lihong Zhi: Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions. SIAM Journal on Optimization 20(6): 2876-2889 (2010)
	2009
17		Hoon Hong, Mohab Safey El Din: Variant real quantifier elimination: algorithm and application. ISSAC 2009: 183-190
16		Mohab Safey El Din, Éric Schost: A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces CoRR abs/0902.1612: (2009)
15		Mohab Safey El Din, Lihong Zhi: Computing rational points in convex semi-algebraic sets and SOS decompositions CoRR abs/0910.2973: (2009)
14		Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din: The Voronoi Diagram of Three Lines. Discrete & Computational Geometry 42(1): 94-130 (2009)
	2008
13		Mohab Safey El Din: Computing the global optimum of a multivariate polynomial over the reals. ISSAC 2008: 71-78
12		Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, Mohab Safey El Din: Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. ISSAC 2008: 79-86
	2007
11		Mohab Safey El Din: Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping. ASCM 2007: 42-56
10		Mohab Safey El Din, Philippe Trebuchet: POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations. PASCO 2007: 104-106
9		Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din: The voronoi diagram of three lines. Symposium on Computational Geometry 2007: 255-264
8		Mohab Safey El Din: Testing Sign Conditions on a Multivariate Polynomial and Applications. Mathematics in Computer Science 1(1): 177-207 (2007)
	2006
7		Mohab Safey El Din, Philippe Trebuchet: Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry CoRR abs/cs/0610051: (2006)
	2004
6		Mohab Safey El Din, Éric Schost: Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. Discrete & Computational Geometry 32(3): 417-430 (2004)
	2003
5		Mohab Safey El Din, Éric Schost: Polar varieties and computation of one point in each connected component of a smooth real algebraic set. ISSAC 2003: 224-231
	2002
4		Philippe Aubry, Fabrice Rouillier, Mohab Safey El Din: Real Solving for Positive Dimensional Systems. J. Symb. Comput. 34(6): 543-560 (2002)
	2000
3		Fabrice Rouillier, Mohab Safey El Din, Éric Schost: Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study. Automated Deduction in Geometry 2000: 26-40
2		Fabrice Rouillier, Marie-Françoise Roy, Mohab Safey El Din: Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation. J. Complexity 16(4): 716-750 (2000)
1		Henri Lombardi, Marie-Françoise Roy, Mohab Safey El Din: New Structure Theorem for Subresultants. J. Symb. Comput. 29(4-5): 663-689 (2000)

Coauthor Index

1	Philippe Aubry	[4]
2	Bernd Bank	[20]
3	Saugata Basu	[30]
4	Hazel Everett	[9] [14]
5	Jean-Charles Faugère	[12] [19] [21] [23] [25] [29]
6	Marc Giusti	[20]
7	Aurélien Greuet	[26] [28]
8	Feng Guo	[22] [28]
9	Joos Heintz	[20]
10	Hoon Hong	[17] [27]
11	Daniel Lazard	[9] [14]
12	Sylvain Lazard	[9] [14]
13	Henri Lombardi	[1]
14	Guillaume Moroz	[12]
15	Fabrice Rouillier	[2] [3] [4] [12]
16	Marie-Françoise Roy	[1] [2] [30]
17	Éric Schost	[3] [5] [6] [16] [20] [24] [30]
18	Pierre-Jean Spaenlehauer	[19] [21] [23] [25] [29]
19	Philippe Trebuchet	[7] [10]
20	Lihong Zhi	[15] [18] [22] [28]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page