1. Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, and Eric Schost, On the geometry of polar varieties, Appl. Algebra Engrg. Comm. Comput. 21 (2010), no. 1, 33–83.[MR/doi]
  2. A. Bostan, F. Chyzak, F. Ollivier, B. Salvy, É. Schost, and A. Sedoglavic, Fast computation of power series solutions of systems of differential equations, in SODA '07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2007, pp. 1012–1021.[arXiv]
  3. A. Bostan, G. Lecerf, B. Salvy, É. Schost, and B. Wiebelt, Complexity issues in bivariate polynomial factorization, in ISSAC '04: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, NY, USA, 2004, pp. 42–49.[doi]
  4. Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, and Éric Schost, Differential equations for algebraic functions, ISSAC 2007, ACM, New York, 2007, pp. 25–32.[MR/arXiv]
  5. Alin Bostan, Pierrick Gaudry, and Éric Schost, Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves, Finite Fields and Applications, Lecture Notes in Comput. Sci., vol. 2948, Springer, Berlin, 2004, pp. 40–58.[MR]
  6. Alin Bostan, Bruno Salvy, and Éric Schost, Fast algorithms for zero-dimensional polynomial systems using duality, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 4, 239–272.[MR]
  7. Akpodigha Filatei, Xin Li, Marc Moreno Maza, and Éric Schost, Implementation techniques for fast polynomial arithmetic in a high-level programming environment, in ISSAC '06: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, NY, USA, 2006, pp. 93–100.[doi]
  8. P. Gaudry and É. Schost, On the invariants of the quotients of the Jacobian of a curve of genus 2, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Melbourne, 2001), Lecture Notes in Comput. Sci., vol. 2227, Springer, Berlin, 2001, pp. 373–386.[MR]
  9. P. Gaudry and É. Schost, Modular equations for hyperelliptic curves, Math. Comp. 74 (2005), no. 249, 429–454 (electronic).[MR]
  10. Pierrick Gaudry and Éric Schost, A low-memory parallel version of Matsuo, Chao, and Tsujii's algorithm, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 208–222.[MR]
  11. Pierrick Gaudry and Éric Schost, Construction of secure random curves of genus 2 over prime fields, Advances in Cryptology—EuroCrypt 2004, Lecture Notes in Comput. Sci., vol. 3027, Springer, Berlin, 2004, pp. 239–256.[MR]
  12. Marc Giusti and Éric Schost, Solving some overdetermined polynomial systems, in ISSAC '99: Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (Vancouver, BC), ACM, New York, 1999, pp. 1–8 (electronic).[MR]
  13. L. Kulesz, G. Matera, and É. Schost, Uniform bounds on the number of rational points of a family of curves of genus 2, J. Number Theory 108 (2004), no. 2, 241–267.[MR]
  14. Xin Li, Marc Moreno Maza, Raqeeb Rasheed, and Eric Schost, High-performance symbolic computation in a hybrid compiled-interpreted programming environment, International Conference on Computational Sciences and Its Applications. ICCSA. June 30- July 3, 2008, 2008, pp. 331–341.
  15. Xin Li, Marc Moreno Maza, and Éric Schost, Fast arithmetic for triangular sets: from theory to practice, ISSAC 2007, ACM, New York, 2007, pp. 269–276.[MR]
  16. Xin Li, Marc Moreno Maza, and Éric Schost, On the virtues of generic programming for symbolic computation, Computational Science - ICCS 2007, Lecture Notes in Computer Science, vol. 4488/2007, Springer Berlin / Heidelberg, 2007, pp. 379–596.
  17. Xin Li, Marc Moreno Maza, and Éric Schost, Fast arithmetic for triangular sets: from theory to practice, J. Symbolic Comput. 44 (2009), no. 7, 891–907.[MR]
  18. Fabrice Rouillier, Mohab Safey El Din, and Éric Schost, Solving the Birkhoff interpolation problem via the critical point method: an experimental study, ADG '00: Revised Papers from the Third International Workshop on Automated Deduction in Geometry (Zurich, 2000), Lecture Notes in Computer Science, vol. 2061, Springer-Verlag, Berlin, 2001, pp. viii+325.[MR]
  19. Mohab Safey El Din and Éric Schost, Properness defects of projections and computation of at least one point in each connected component of a real algebraic set, Discrete Comput. Geom. 32 (2004), no. 3, 417–430.[MR]
  20. Éric Schost, Degree bounds and lifting techniques for triangular sets, in Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2002, pp. 238–245 (electronic).[MR]
  21. Éric Schost, Complexity results for triangular sets, J. Symbolic Comput. 36 (2003), no. 3-4, 555–594.[MR]
  22. Éric Schost, Computing parametric geometric resolutions, Appl. Algebra Engrg. Comm. Comput. 13 (2003), no. 5, 349–393.[MR]