1. 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]
  2. 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]
  3. 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]
  4. Alin Bostan, Thomas Cluzeau, and Bruno Salvy, Fast algorithms for polynomial solutions of linear differential equations, ISSAC'05: Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2005, pp. 45–52 (electronic).[MR]
  5. 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]
  6. Marc Giusti, Grégoire Lecerf, and Bruno Salvy, A Gröbner free alternative for polynomial system solving, J. Complexity 17 (2001), no. 1, 154–211.[MR]