Gilles VILLARD    Directeur de recherche CNRS/INS2I
AriC project-team

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

PUBLICATIONS    Detailed list / co-authors.


  • 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, G. Villard. Fast computation of approximant bases in canonical form. Journal of Symbolic Computation, 2019, pdf/doi.
  • J.-G. Dumas, E.Kaltofen, G.Villard, L. Zhi. Polynomial time interactive proofs for linear algebra with exponential matrix dimensions and scalars given by polynomial time circuits. ISSAC'17, Kaiserslautern, Germany, 2017, pdf/doi.
  • C.-P. Jeannerod, V. Neiger, É. Schost, G. Villard. Computing minimal interpolation bases, J. of Symbolic Computation, 83:272-314, 2017, pdf/doi.
  • Saruchi, I. Morel, D. Stehlé, G. Villard. LLL reducing with the most significant bits. ISSAC'14, Kobe, Japan, 2014, pdf/doi.
  • J. Chen, D. Stehlé, G. Villard. A new view on HJLS and PSLQ: sums and projections of lattices. ISSAC'13, Boston, USA, 2013, 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.
  • G. Villard. Recent progress in linear algebra and lattice basis reduction. ISSAC'11, San Jose, California, 2011, invited, 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.


  • Extended precision floating-point benchmarks.
  • Hplll software library home page,  GitHub repository.
  • LinBox joint CNRS/NSF project LinBox Team GitHub (
  • The Givaro page, a C++ library for computer algebra.
  • TO SEE

    International Linear Algebra Society         GDR CNRS Informatique Mathématique - GT Arithmétique - GT Calcul Formel

            Journées Nationales de Calcul Formel, March 2-6, 2020, CIRM, Marseille.
            STACS 2020, 37th International Symposium on Theoretical Aspects of Computer Science, March 10-13, 2020, Montpellier.
            Journées Nationales du GDR IM, March 24-27, Paris, 2020.
            LATIN 2020, The 14th Latin American Theoretical Informatics Symposium, São Paulo, Brazil, 25-29 May, 2020.
            CIMPA Structured 2020, School on Structure and Geometry in Matrix Analysis and Computations, Tunis, Tunisia, May 26th-June 4th, 2020.
            ARITH 2020, 27th IEEE Symposium on Computer Arithmetic, June 7-10, 2020, Portland, OR, USA.
            Seymour is seventy, A conference honouring the seventieth birthday of Paul Seymour, Lyon, June 15-19, 2020.
            FoCM 2020, Foundations of Computational Mathematics, Simon Fraser University, Vancouver, Canada, June 15-24, 2020.
            WAIFI 2020, International Workshop on the Arithmetic of Finite Fields, Rennes, July 6-8, 2020.
            ICALP 2020, 47th International Colloquium on Automata, Languages and Programming, July 8-11 2020, Saarbrücken, Germany.
            ICMS 2020, The International Congress on Mathematical Software, Braunschweig, Germany, July 13-16, 2020.
            ACA 2020, 26th International Conference on Applications of Computer Algebra, Athens, Greece, July 15-18, 2020.
            ISSAC 2020, 45rd International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, 20-23 July 2020.