On the Structure of Changes in Dynamic Contact Networks. - Vincent Neiger; Christophe Crespelle; Eric Fleury (SITIS, 2012)

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 Trans. Inf. Theory, 2015)

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. - Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (ISSAC, 2016)

Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations. - Vincent Neiger (ISSAC, 2016)

Bases of relations in one or several variables: fast algorithms and applications. (Bases de relations en une ou plusieurs variables : algorithmes rapides et applications). - Vincent Neiger (2016)

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. - Vincent Neiger; Hamid Rahkooy; Éric Schost (CASC, 2017)

Fast Computation of the Roots of Polynomials Over the Ring of Power Series. - Vincent Neiger; Johan Rosenkilde; Éric Schost (ISSAC, 2017)

Computing Canonical Bases of Modules of Univariate Relations. - Vincent Neiger; Thi Xuan Vu (ISSAC, 2017)

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. - George Labahn; Vincent Neiger; Wei Zhou 029 (J. Complex., 2017)

Computing minimal interpolation bases. - Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (J. Symb. Comput., 2017)

Certification of Minimal Approximant Bases. - Pascal Giorgi; Vincent Neiger (ISSAC, 2018)

Computing Popov and Hermite Forms of Rectangular Polynomial Matrices. - Vincent Neiger; Johan Rosenkilde; Grigory Solomatov (ISSAC, 2018)

Sparse FGLM using the block Wiedemann algorithm. - Seung Gyu Hyun; Vincent Neiger; Hamid Rahkooy; Éric Schost (ACM Commun. Comput. Algebra, 2018)

Interactive Certificates for Polynomial Matrices with Sub-Linear Communication. - David Lucas 001; Vincent Neiger; Clément Pernet; Daniel S. Roche; Johan Rosenkilde (CoRR, 2018)

Two-Point Codes for the Generalized GK Curve. - Elise Barelli; Peter Beelen; Mrinmoy Datta; Vincent Neiger; Johan Rosenkilde (IEEE Trans. Inf. Theory, 2018)

Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. - Seung Gyu Hyun; Vincent Neiger; Éric Schost (ISSAC, 2019)

An Algebraic Attack on Rank Metric Code-Based Cryptosystems. - Magali Bardet; Pierre Briaud; Maxime Bros; Philippe Gaborit; Vincent Neiger; Olivier Ruatta; Jean-Pierre Tillich (EUROCRYPT (3), 2020)

A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension. - Simone Naldi; Vincent Neiger (ISSAC, 2020)

Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation. - Vincent Neiger; Johan Rosenkilde; Grigory Solomatov (ISSAC, 2020)

Computing syzygies in finite dimension using fast linear algebra. - Vincent Neiger; Éric Schost (J. Complex., 2020)

Block-Krylov techniques in the context of sparse-FGLM algorithms. - Seung Gyu Hyun; Vincent Neiger; Hamid Rahkooy; Éric Schost (J. Symb. Comput., 2020)

Fast computation of approximant bases in canonical form. - Claude-Pierre Jeannerod; Vincent Neiger; Gilles Villard (J. Symb. Comput., 2020)

Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. - Seung Gyu Hyun; Vincent Neiger; Éric Schost (ISSAC, 2021)

Deterministic computation of the characteristic polynomial in the time of matrix multiplication. - Vincent Neiger; Clément Pernet (J. Complex., 2021)

Verification protocols with sub-linear communication for polynomial matrix operations. - David Lucas 001; Vincent Neiger; Clément Pernet; Daniel S. Roche; Johan Rosenkilde (J. Symb. Comput., 2021)

Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions. - Jérémy Berthomieu; Vincent Neiger; Mohab Safey El Din (ISSAC, 2022)

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. - George Labahn; Vincent Neiger; Thi Xuan Vu; Wei Zhou 029 (ISSAC, 2022)

Beating binary powering for polynomial matrices. - Alin Bostan; Vincent Neiger; Sergey Yurkevich (ISSAC, 2023)

Refined F5 Algorithms for Ideals of Minors of Square Matrices. - Sriram Gopalakrishnan; Vincent Neiger; Mohab Safey El Din (ISSAC, 2023)

Refined $F_5$ Algorithms for Ideals of Minors of Square Matrices. - Sriram Gopalakrishnan; Vincent Neiger; Mohab Safey El Din (CoRR, 2023)

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. - Sriram Gopalakrishnan; Vincent Neiger; Mohab Safey El Din (ISSAC, 2024)

Computing Krylov iterates in the time of matrix multiplication. - Vincent Neiger; Clément Pernet; Gilles Villard (ISSAC, 2024)

Faster Modular Composition. - Vincent Neiger; Bruno Salvy; Éric Schost; Gilles Villard (J. ACM, 2024)

Faster List Decoding of AG Codes. - Peter Beelen; Vincent Neiger (IEEE Trans. Inf. Theory, 2025)