| Polar varieties and computation of one point in each connected component of a smooth real algebraic set M Safey El Din, E Schost Proceedings of the 2003 international symposium on Symbolic and algebraic …, 2003 | 161 | 2003 |
| Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology JC Faugere, MS El Din, PJ Spaenlehauer Proceedings of the 2010 International Symposium on Symbolic and Algebraic …, 2010 | 121 | 2010 |
| Finding at least one point in each connected component of a real algebraic set defined by a single equation F Rouillier, MF Roy, MS El Din Journal of Complexity 16 (4), 716-750, 2000 | 113 | 2000 |
| Real solving for positive dimensional systems P Aubry, F Rouillier, MS El Din Journal of Symbolic Computation 34 (6), 543-560, 2002 | 112 | 2002 |
| Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity JC Faugere, MS El Din, PJ Spaenlehauer Journal of Symbolic Computation 46 (4), 406-437, 2011 | 110 | 2011 |
| A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets MSE Din, É Schost Journal of the ACM (JACM) 63 (6), 1-37, 2017 | 84 | 2017 |
| Properness defects of projections and computation of at least one point in each connected component of a real algebraic set MS El Din, E Schost Discrete & Computational Geometry 32, 417-430, 2004 | 81 | 2004 |
| On the geometry of polar varieties B Bank, M Giusti, J Heintz, M Safey El Din, E Schost Applicable Algebra in Engineering, Communication and Computing 21 (1), 33-83, 2010 | 78 | 2010 |
| The Voronoi diagram of three lines H Everett, S Lazard, D Lazard, MS El Din Proceedings of the twenty-third annual symposium on Computational geometry …, 2007 | 76 | 2007 |
| Variant quantifier elimination H Hong, MS El Din Journal of Symbolic Computation 47 (7), 883-901, 2012 | 67 | 2012 |
| On the complexity of the generalized MinRank problem JC Faugère, MS El Din, PJ Spaenlehauer Journal of Symbolic Computation 55, 30-58, 2013 | 64 | 2013 |
| Exact algorithms for linear matrix inequalities D Henrion, S Naldi, MS El Din SIAM Journal on Optimization 26 (4), 2512-2539, 2016 | 62 | 2016 |
| New structure theorem for subresultants H Lombardi, MF Roy, MS El Din Journal of symbolic computation 29 (4-5), 663-690, 2000 | 61 | 2000 |
| Testing sign conditions on a multivariate polynomial and applications M Safey El Din Mathematics in Computer Science 1 (1), 177-207, 2007 | 58 | 2007 |
| Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities JC Faugère, G Moroz, F Rouillier, MS El Din Proceedings of the twenty-first international symposium on Symbolic and …, 2008 | 56 | 2008 |
| Probabilistic algorithm for polynomial optimization over a real algebraic set A Greuet, M Safey El Din SIAM Journal on Optimization 24 (3), 1313-1343, 2014 | 55 | 2014 |
| Computing the global optimum of a multivariate polynomial over the reals MS El Din Proceedings of the twenty-first international symposium on Symbolic and …, 2008 | 55 | 2008 |
| A baby step–giant step roadmap algorithm for general algebraic sets S Basu, MF Roy, MS El Din, É Schost Foundations of Computational Mathematics 14, 1117-1172, 2014 | 54 | 2014 |
| A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces MS El Din, E Schost Discrete and Computational Geometry 45 (1), 181-220, 2011 | 48 | 2011 |
| Msolve: A library for solving polynomial systems J Berthomieu, C Eder, M Safey El Din Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …, 2021 | 39 | 2021 |
Eric SchostUniversity of WaterlooVerified email at uwaterloo.ca
