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.

Selected:

  • G. Villard. On computing the resultant of generic bivariate polynomials. ISSAC'18, New York, USA, 2018, pdf and maple worksheets.
  • C.-P. Jeannerod, V. Neiger, G. Villard. Fast computation of approximant bases in canonical form, arXiv:1801.04553, 2018.
  • 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.

    SOFTWARE

  • Hplll software library home page,  GitHub repository.
  • LinBox joint CNRS/NSF project home page.
  • 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

            ISSAC 2018, 43rd International Symposium on Symbolic and Algebraic Computation, New York, USA, July 16-19, 2018.
            ICMS 2018, The 6th International Congress on Mathematical Software, University of Notre Dame, Ind USA, July 24-27, 2018.
            SCAN 2018, The 18th International Symposium on Scientific Computing, Computer Arithmetic, and Verified Numerical Computations, Tokyo, Japan, Sept. 10-15, 2018.
            FOCS 2018, 59th Annual IEEE Symposium on Foundations of Computer Science, Paris, France, October 7-9, 2018.
            PARI/GP 2019, Atelier PARI/GP, January 14-18, 2019, U. Bordeaux.
            MEGA 2019, Effective Methods in Algebraic Geometry, Madrid, Spain, Universidad Complutense, June 17-21, 2019.

    Archives