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/doi, 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

  • Extended precision floating-point benchmarks.
  • Hplll software library home page,  GitHub repository.
  • LinBox joint CNRS/NSF project LinBox Team GitHub (linalg.org).
  • 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 du GDR IM, 11-14 mars 2019, Orléans.
            Mathematical foundations of asymetric cryptography, March 17-22, 2019, Aussois.
            ARITH, i26th IEEE Symposium on Computer Arithmetic, June 10-12, 2019, Kyoto, Japan.
            MEGA, Effective Methods in Algebraic Geometry, Madrid, Spain, Universidad Complutense, June 17-21, 2019.
            STOC, 51st Annual ACM Symposium on the Theory of Computing June 23-26, 2019 in Phoenix, AZ.
            ICALP, 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 8-12 July 2019.
            ISSAC, 44rd International Symposium on Symbolic and Algebraic Computation, Beihang University, Beijing, China, July 15-18, 2019.
            SIAMAG, SIAM Conference on Applied Algebraic Geometry, 9-13 July 2019, Bern, Switzerland.
            ACA, Applications of Computer Algebra 2019, July 16-20, 2019, Montréal, Canada.
            Maple Conference, October 15-17, 2019, Waterloo, Ontario, Canada.

    Archives