Publications

Below is a list of research articles published in peer-reviewed journals or conference proceedings; they are available in the open-access archives Hal and arXiv. This page also lists preprints and unpublished research reports.

Preprints, work in progress

  • Faster modular composition
    Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard.
    Work in progress.

International journals

  • Deterministic computation of the characteristic polynomial in the time of matrix multiplication
    Vincent Neiger, Clément Pernet.
    Accepted for publication in Journal of Complexity. hal / arXiv / doi .
  • Interactive Certificates for Polynomial Matrices with Sub-Linear Communication
    David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde.
    Journal of Symbolic Computation, Volume 105, July-August 2021, Pages 165-198. hal / arXiv / doi .
  • Computing syzygies in finite dimension using fast linear algebra
    Vincent Neiger, Éric Schost.
    Journal of Complexity, Volume 60, October 2020, 101502. hal / arXiv / doi .
  • Block-Krylov techniques in the context of sparse-FGLM algorithms
    Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost.
    Journal of Symbolic Computation: volume 98, May-June 2020, pages 163-191. hal / arXiv / doi .
  • Fast computation of approximant bases in canonical form
    Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard.
    Journal of Symbolic Computation: volume 98, May-June 2020, pages 192-224. hal / arXiv / doi .
  • Two-point Codes for the Generalized GK Curve
    Élise Barelli, Peter Beelen, Mrinmoy Datta, Vincent Neiger, Johan Rosenkilde.
    IEEE Transactions on Information Theory: vol. 64, issue 9, September 2018. hal / arXiv / doi.
  • Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
    George Labahn, Vincent Neiger, Wei Zhou.
    Journal of Complexity, Volume 42, October 2017, pp. 44-71. hal / arXiv / doi.
  • Computing minimal interpolation bases
    Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard.
    Journal of Symbolic Computation: vol. 83, Nov.-Dec. 2017, pp. 272-314. hal / doi.
  • Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations
    Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard.
    IEEE Transactions on Information Theory: vol. 61, issue 5, May 2015. hal / doi .

Proceedings of international conferences

  • Algorithms for Linearly Recurrent Sequences of Truncated Polynomials
    Seung Gyu Hyun, Vincent Neiger, Éric Schost.
    Proceedings ISSAC 2021. arXiv / doi .
  • Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
    Vincent Neiger, Johan Rosenkilde, Grigory Solomatov.
    Proceedings ISSAC 2020. hal / arXiv / doi.
  • A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension
    Simone Naldi, Vincent Neiger.
    Proceedings ISSAC 2020. hal / arXiv / doi.
  • An Algebraic Attack on Rank Metric Code-Based Cryptosystems
    Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, Jean-Pierre Tillich.
    Proceedings Eurocrypt 2020. hal / arXiv / doi .
  • Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
    Seung Gyu Hyun, Vincent Neiger, Éric Schost.
    Proceedings of ISSAC 2019. hal / arXiv / doi .
  • Computing Popov and Hermite forms of rectangular matrices
    Vincent Neiger, Johan Rosenkilde, Grigory Solomatov.
    Proceedings of ISSAC 2018. hal / arXiv / doi .
  • Certification of minimal approximant bases
    Pascal Giorgi, Vincent Neiger.
    Proceedings of ISSAC 2018. hal / arXiv / doi .
  • Algorithms for zero-dimensional ideals using linear recurrent sequences
    Vincent Neiger, Hamid Rahkooy, Éric Schost.
    Proceedings of CASC 2017. hal / arXiv / doi .
  • Computing canonical bases of modules of univariate relations
    Vincent Neiger, Vu Thi Xuan.
    Proceedings of ISSAC 2017 conference. hal / arXiv / doi
    ++ Vu Thi Xuan received the SIGSAM ISSAC 2017 distinguished student author award ++
  • Fast computation of the roots of polynomials over the ring of power series
    Vincent Neiger, Johan Rosenkilde, Éric Schost.
    Proceedings of ISSAC 2017 conference. hal / arXiv / doi
  • Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
    Vincent Neiger.
    Proceedings of ISSAC 2016 conference. hal / doi .
  • Fast computation of minimal interpolation bases in Popov form for arbitrary shifts
    Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard.
    Proceedings of ISSAC 2016 conference. hal / doi .
  • On the Structure of Changes in Dynamic Contact Networks
    Vincent Neiger, Christophe Crespelle, Éric Fleury,
    Proceedings SITIS 2012, Workshop on Complex Networks and their Applications. hal / doi.

Unpublished reports

  • Reading course on Ideals, Varieties, and Algorithms by Cox, Little, O’Shea,
    supervised by Éric Schost at University of Western Ontario. The report focuses on Chapter 9 — The Dimension of a Variety (Summer 2014). Report pdf.
    The oral presentation gives a selective overview of the book (30 minutes, Fall 2014). Slides pdf.
  • Handwritten digits recognition using OpenCV,
    report for the final project of the course CS9840: Machine Learning and Computer Vision at University of Western Ontario, Fall 2014. pdf.
  • Fast Coppersmith method over the polynomials: finding a reduced basis via approximation,
    Notes for a talk at the Lattice and crypto meeting at ENS de Lyon, March 3, 2016. pdf.