Gilles VILLARD    Directeur de recherche CNRS/Sciences Informatiques
Pascaline project-team

Laboratoire LIP   [CNRS  ENSL  INRIA  UCBL  U. Lyon ]
  46, Allée d'Italie F69364   Lyon   Cedex 07



PUBLICATIONS    Detailed list.

Selected:

  • V. Neiger, B. Salvy, É. Schost, G. Villard. Faster modular composition using two relation matrices, ISSAC'26, Oldenburg, Germany, 2026, pdf/doi.
  • V. Neiger, C. Pernet, G. Villard. Computing Krylov iterates in the time of matrix multiplication, ISSAC'24, Raleigh, NC, USA, 2024, pdf/doi.
  • G. Villard. Bivariate polynomial reduction and elimination ideal over finite fields, Journal of Symbolic Computation, 127, 2025, pdf/doi.
  • V. Neiger, B. Salvy, É. Schost, G. Villard. Faster modular composition, Journal of the ACM, 71(2)-11, 2024, pdf/doi.
  • C. Pernet, H. Signargout, G. Villard. High-order lifting for polynomial Sylvester matrices, Journal of Complexity, 2023, pdf/doi.
  • C. Pernet, H. Signargout, G. Villard. Exact computations with quasiseparable matrices. ISSAC'23, Tromsø, Norway, 2023, pdf/doi.
  • G. Villard. On computing the resultant of generic bivariate polynomials. ISSAC'18, New York, USA, 2018, pdf/doi, and maple worksheets.
  • C.-P. Jeannerod, V. Neiger, É. Schost, G. Villard. Computing minimal interpolation bases, J. of Symbolic Computation, 83:272-314, 2017, pdf/doi.
  • X.-W. Chang, D. Stehlé, G. Villard. Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction, Mathematics of Computation, 81(279):1487-1511, 2012, pdf/doi.
  • A. Novocin, D. Stehlé, G. Villard. An LLL-reduction algorithm with quasi-linear time complexity, STOC, San Jose, California, 2011, pdf/doi.
  • E. Kaltofen, G. Villard. On the complexity of computing determinants. Computational Complexity, 13:91-130, 2005, pdf/doi.

  • pml/ mapml library: exact matrix polynomials and polynomial matrices, in C and a Maple interface.

  • LinBox Team GitHub.
  • Givaro, a C++ library for computer algebra.

  •         Computer Algebra Seminars - GT Calcul Formel GdR IFM

            CASC 2026, Computer Algebra in Scientific Computing, Bath, UK, Aug. 31 - Sept. 4 2026.
            ALBATROSS 2026, Algebraic Methods for Polynomial System Solving, Sorbonne Université, Paris, 1-4 September 2026.
            STOP 2026, Structured Optimization for Inverse and Learning Problems, Lyon, 29 sept. - 1 oct. 2026.
            CoA 2026, Workshop Complexity and Algorithms, Lyon, 5-7 oct. 2026.
            JNCF 2027, Journée Nationales de Calcul Formel, CIRM, Luminy, 1-5 mars 2027.

    International Linear Algebra Society         GdR CNRS Informatique Fondamentale et ses Mathématiques

    PAST

    Conference archives

    Teaching: Modern algorithms for symbolic summation and integration, M2 ENS de Lyon.