– Direction des ´etudes de la Licence Math´ematiques-Informatique de l’Universit´e Pierre et Marie Curie.
– Responsable de Groupe de Travail “Math´ematiques pour l’Informatique et Algorithmique” (charg´e de refonder l’offre p´edagogique dans le cadre du renouvellement de l’habilitation 2009 de la licence d’infor-matique).
– Responsable de l’Unit´e d’Enseignement “Calculabilit´e-D´ecidabilit´e”.
– Responsable du cours de Bases de donn´ees `a l’Institut de Statistique de l’Universit´e de Paris 6 (ISUP).
– Responsable de l’Unit´e d’Enseignement Calcul Formel du Master d’Informatique.
J’ai enseign´e
1. l’algorithmique ; 2. le calcul formel ;
3. la th´eorie des automates et les mod`eles de complexit´e ; 4. la programmation concurrente et r´eactive ;
5. la programmation orient´ee objet ;
6. la programmation fonctionnelle et imp´erative ; 7. les bases de donn´ees ;
8. les r´eseaux de neurones.
R´ ef´ erences
[1] P. Aubry, F. Rouillier, and M. Safey El Din. Real solving for positive dimensional systems. Journal of Symbolic Computation, 34(6) :543–560, 2002. Cited at pages6.
[2] B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. Polar varieties and efficient real equation solving : the hypersurface case. Journal of Complexity, 13(1) :5–27, 1997. Cited at pages 6.
[3] B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. Polar varieties and efficient real elimination.
Mathematische Zeitschrift, 238(1) :115–144, 2001. Cited at pages6.
[4] B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. Generalized polar varieties and efficient real elimination procedure. Kybernetika, 40(5) :519–550, 2004. Cited at pages 6.
[5] B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. Generalized polar varieties : Geometry and algorithms.
Journal of complexity, 2005. Cited at pages 6.
[6] S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of ACM, 43(6) :1002–1045, 1996. Cited at pages4.
[7] S. Basu, R. Pollack, and M.-F. Roy. A new algorithm to find a point in every cell defined by a family of polynomials. In Quantifier elimination and cylindrical algebraic decomposition. Springer-Verlag, 1998.
Cited at pages4.
[8] S. Basu, R. Pollack, and M-F Roy. Computing roadmaps of semi-algebraic sets on a variety. Journal of the AMS, 3(1) :55–82, 1999. Cited at pages13.
[9] S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag, second edition, 2006. Cited at pages 13.
[10] D. Bernstein and A. Zelevinsky. Combinatorics of maximal minors.Journal of Algebraic Combinatorics, 2(2) :111–121, 1993. Cited at pages11.
[11] J. Canny. The complexity of robot motion planning. MIT Press, 1987. Cited at pages3,4,5,8.
[12] J. Canny. Some algebraic and geometric problems in pspace. In Proceedings STOC, pages 460–467, 1988. Cited at pages 4.
[13] J. Canny. Computing roadmaps in general semi-algebraic sets. The Computer Journal, 1993. Cited at pages 4,8,12,14,15.
[14] D. Castro, L. M. Pardo, and J. San Martin. Systems of rational polynomial equations have polynomial size approximate zeros on the average. Journal of Complexity, 19(2) :161 – 209, 2003. Cited at pages 11.
[15] G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition.
Lecture notes in computer science, 33 :515–532, 1975. Cited at pages4.
[16] A. Conca. Gr¨obner bases of powers of ideals of maximal minors. Journal of Pure and Applied Algebra, 121(3) :223–231, 1997. Cited at pages 11.
[17] A. Conca and J. Herzog. On the Hilbert Function of Determinants Rings and their Canonical Module.
Americal Mathematical Society, 122(3), 1994. Cited at pages11.
[18] H. Everett, D. Lazard, S. Lazard, and M. Safey El Din. The Voronoi diagram of three lines inR3. In SoCG ’07 : Proceedings of the 23-rd annual symposium on computational geometry, pages 255–264, 6 2007. Cited at pages 3,5.
[19] H. Everett, D. Lazard, S. Lazard, and M. Safey El Din. The Voronoi diagram of three lines. Discrete and Computational Geometry, 42(1) :94–130, 2009. Cited at pages3,5.
[20] J.-C. Faug`ere, F. Moreau de Saint Martin, and F. Rouillier. Design of regular nonseparable bidimen-sional wavelets using groebner basis techniques. IEEE SP Transactions, Special Issue on Theory and Applications of Filter Banks and Wavelets, 46(4) :845–856, April 1998. Cited at pages 3.
[21] J.-C. Faug`ere, G. Moroz, F. Rouillier, and M. Safey El Din. Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. In Proceedings of ISSAC 2008, pages 79–86, 2008. Cited at pages3,5.
[22] J.-C. Faug`ere, M. Safey El Din, and P.-J. Spaenlehauer. Computing loci of rank defects of linear matrices using grbner bases and applications to cryptology. In Proceedings of ISSAC 2010, pages 257–264. ACM, 2010. Cited at pages 11.
[23] J.-C. Faug`ere, M. Safey El Din, and P.-J. Spaenlehauer. On the Complexity of the Generalized MinRank Problem. under preparation, 2010. Cited at pages 11.
[24] J.C. Faug`ere, M. Hering, and J. Phan. The membrane inclusions curvature equations. Advances in Applied Mathematics, 31(4) :643–658, 2003. Cited at pages3.
[25] J.C. Faug`ere, M. Safey El Din, and P.J. Spaenlehauer. Gr¨obner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1) : Algorithms and complexity. Journal of Symbolic Computation, 2010.
Cited at pages11.
[26] X.-S. Gao, X. Hou, J. Tang, and Hang-Fei Cheng. Complete solution classification for the perspective-three-point problem. IEEE Trans. Pattern Anal. Mach. Intell, 25(8) :930–943, 2003. Cited at pages 3.
[27] L. Gournay and J.-J. Risler. Construction of roadmaps in semi-algebraic sets. Applicable Algebra in Engineering, Communication and Computing, 4(4) :239–252, 1993. Cited at pages4.
[28] D. Grigoriev and N. Vorobjov. Solving systems of polynomials inequalities in subexponential time.
Journal of Symbolic Computation, 5 :37–64, 1988. Cited at pages 4.
[29] F. Guo, M. Safey El Din, and L. Zhi. Global optimization of polynomials using generalized critical values and sums of squares. InProceedings of ISSAC 2010, pages 107–114, New York, NY, USA, 2010.
ACM. Cited at pages 14.
[30] J. Heintz, M.-F. Roy, and P. Solern`o. On the complexity of semi-algebraic sets. InProceedings IFIP’89 San Francisco, North-Holland, 1989. Cited at pages4.
[31] J. Heintz, M.-F. Roy, and P. Solern`o. On the theoretical and practical complexity of the existential theory of the reals. The Computer Journal, 36(5) :427–431, 1993. Cited at pages 4.
[32] M. Hochster and J.A. Eagon. A class of perfect determinantal ideals. Bull. Amer. Math. Soc, 76 :1026–
1029, 1970. Cited at pages 11.
[33] H. Hong, R. Liska, and S. Steinberg. Testing stability by quantifier elimination. Journal of Symbolic Computation, 24(2) :161–187, 1997. Cited at pages3.
[34] H. Hong and M. Safey El Din. Variant real quantifier elimination : algorithm and application. In ISSAC ’09 : Proceedings of the 2009 international symposium on Symbolic and algebraic computation, pages 183–190, New York, NY, USA, 2009. ACM. Cited at pages 3,6,9,12,14,15.
[35] H. Hong and M. Safey El Din. Variant quantifier elimination. Journal of Symbolic Computation, 2010.
Submitted. Cited at pages 3,6,9,12,14,15.
[36] K. Kurdyka, P. Orro, and S. Simon. Semialgebraic Sard theorem for generalized critical value. Journal of differential geometry, 56(1) :67–92, 2000. Cited at pages 6,7,12,15.
[37] D. Lazard. Stewart platform and Gr¨obner bases. In Parenti-Castelli V. and Lenaric J., editors, Proceedings of the third international workshop on advances of robot kinematics, pages 136–142. Ferrare, 1992. Cited at pages 3.
[38] C. Le Guernic, F. Rouillier, and M. Safey El Din. On the practical computation of one point in each connected component of a semi-algebraic set defined by a polynomial system of equations and non-strict inequalities. In L. Gonzalez-Vega and T. Recio, editors, Proceedings of EACA’04 Conference, 2004. Cited at pages 3,5,7.
[39] G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. Journal of Complexity, 19(4) :564–596, 2003. Cited at pages4.
[40] R. Liska and S. Steinberg. Applying quantifier elimination to stability analysis of difference schemes.
Comput. J., 36(5) :497–503, 1993. Cited at pages3.
[41] M. Mezzarobba and M. Safey El Din. Computing roadmaps in smooth real algebraic sets. InProceedings of Transgressive Computing, pages 327–338, 2006. Cited at pages 5.
[42] M. Mezzarobba and M. Safey El Din. Computing roadmaps in smooth real algebraic sets. In J.-G.
Dumas, editor,Proceedings of Transgressive Computing 2006, pages 327–338, 2006. isbn : 84-689-8381-0. Cited at pages8.
[43] J. Milnor. On the Betti numbers of real varieties. Proceedings of the American Mathematical Society, 15(2) :275–280, 1964. Cited at pages4.
[44] A. Mosig. Efficient algorithms for shape and pattern matching. PhD thesis, Bonn University, 2004.
Cited at pages3.
[45] A. Mosig and M. Clausen. Approximately matching polygonal curves with respect to the Fr´echet distance. Computational Geometry, 30(2) :113–127, 2005. Cited at pages3.
[46] J. Nie, J. Demmel, and B. Sturmfels. Minimizing polynomials via sum of squares over the gradient ideal. Math. Program., 106(3) :587–606, 2006. Cited at pages 14.
[47] J. Nie and K. Ranestad. Algebraic degree of polynomial optimization.SIAM Journal on Optimization, 20(1) :485–502, 2009. Cited at pages10.
[48] S. Petitjean. Algebraic geometry and computer vision : Polynomial systems, real and complex roots.
Journal of Mathematical Imaging and Vision, 10(3) :191–220, 1999. Cited at pages3.
[49] J. Renegar. On the computational complexity and geometry of the first order theory of the reals.
Journal of Symbolic Computation, 13(3) :255–352, 1992. Cited at pages 4.
[50] F. Rouillier, M.-F. Roy, and M. Safey El Din. Finding at least one point in each connected component of a real algebraic set defined by a single equation. Journal of Complexity, 16 :716–750, 2000. Cited at pages 6.
[51] M. Safey El Din. Finding sampling points on real hypersurfaces in easier in singular situations. In MEGA, 2005. Cited at pages 5,7,9,12,15.
[52] M. Safey El Din. RAGLib (Real Algebraic Geometry Library), Maple package. http://www-salsa.
lip6.fr/~safey/RAGLib, 2007. Cited at pages6.
[53] M. Safey El Din. Testing sign conditions on a multivariate polynomial and applications. Mathematics in Computer Science, 1(1) :177–207, 2007. Cited at pages5,7,12.
[54] M. Safey El Din. Computing the global optimum of a multivariate polynomial over the reals. In Proceedings of ISSAC 2008, pages 71–78, 2008. Cited at pages 5,6,9,14.
[55] M. Safey El Din. Practical and theoretical issues for the computation of generalized critical values of a polynomial mapping. In Computer Mathematics : ASCM 2007, Revised and Invited Papers, pages 42–56. Springer-Verlag, Berlin, Heidelberg, 2008. Cited at pages 5.
[56] M. Safey El Din and ´E. Schost. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In J.R. Sendra, editor, Proceedings of ISSAC 2003, pages 224–231. ACM Press, aug 2003. Cited at pages 5,7,12,13.
[57] M. Safey El Din and ´E. Schost. Properness defects of projections and computation of one point in each connected component of a real algebraic set. Discrete and Computational Geometry, 32(3) :417–430, 2004. Cited at pages 5,6,7.
[58] M. Safey El Din and ´E. Schost. A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface. Discrete and Computational Geometry, 2010. DOI 10.1007/s00454-009-9239-2. Cited at pages5,8,13.
[59] M. Safey El Din and L. Zhi. Computing rational points in convex semi-algebraic sets and SOS decom-positions. SIAM Journal on Optimization, 20(6) :2876–2889, 2010. to appear. Cited at pages 6, 9, 10.
[60] ´E. Schost. Computing parametric geometric resolutions. Applicable Algebra in Engineering, Commu-nication and Computing, 13(5) :349–393, 2003. Cited at pages15.
[61] J. T. Schwartz and M. Sharir. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds. Adv. in Appl. Math., 4(3) :298–351, 1983. Cited at pages 3.
[62] M. Schweighofer. Global optimization of polynomials using gradient tentacles and sums of squares.
SIAM Journal on Optimization, 17(3) :920–942, 2006. Cited at pages14.
[63] M. Shub and S. Smale. Complexity of B´ezout’s theorem II : volumes and probabilities. Computational Algebraic Geometry, 109 :267–285, 1993. Cited at pages 11.
[64] A.J. Sommese, C.W. Wampler, and C.W. Wampler. The Numerical solution of systems of polynomials arising in engineering and science. World Scientific Pub Co Inc, 2005. Cited at pages 3.
[65] T. Sturm and A. Weber. Investigating generic methods to solve hopf bifurcation problems in algebraic biology. Algebraic Biology, pages 200–215, 2008. Cited at pages3.
[66] B. Sturmfels and A. Zelevinsky. Maximal minors and their leading terms. Advances in mathematics, 98(1) :65–112, 1993. Cited at pages11.
[67] R. Thom. Sur l’Homologie des Vari´et´es Alg´ebriques R´eelles. Differential and combinatorial topology, pages 255–265, 1965. Cited at pages 4.
[68] A. Tiwari. Theory of reals for verification and synthesis of hybrid dynamical systems. InProceedings of ISSAC 2010, pages 5–6, New York, NY, USA, 2010. ACM. Cited at pages 3.