Vincent Neiger

Orcid: 0000-0002-8311-9490

According to our database1, Vincent Neiger authored at least 34 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Faster Modular Composition.
J. ACM, April, 2024

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations.
CoRR, 2024

Computing Krylov iterates in the time of matrix multiplication.
CoRR, 2024

2023
Faster List Decoding of AG Codes.
CoRR, 2023

Refined $F_5$ Algorithms for Ideals of Minors of Square Matrices.
CoRR, 2023

Refined F5 Algorithms for Ideals of Minors of Square Matrices.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Beating binary powering for polynomial matrices.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
Verification protocols with sub-linear communication for polynomial matrix operations.
J. Symb. Comput., 2021

Deterministic computation of the characteristic polynomial in the time of matrix multiplication.
J. Complex., 2021

Algorithms for Linearly Recurrent Sequences of Truncated Polynomials.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Fast computation of approximant bases in canonical form.
J. Symb. Comput., 2020

Block-Krylov techniques in the context of sparse-FGLM algorithms.
J. Symb. Comput., 2020

Computing syzygies in finite dimension using fast linear algebra.
J. Complex., 2020

Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

An Algebraic Attack on Rank Metric Code-Based Cryptosystems.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Two-Point Codes for the Generalized GK Curve.
IEEE Trans. Inf. Theory, 2018

Interactive Certificates for Polynomial Matrices with Sub-Linear Communication.
CoRR, 2018

Sparse FGLM using the block Wiedemann algorithm.
ACM Commun. Comput. Algebra, 2018

Computing Popov and Hermite Forms of Rectangular Polynomial Matrices.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Certification of Minimal Approximant Bases.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
Computing minimal interpolation bases.
J. Symb. Comput., 2017

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix.
J. Complex., 2017

Computing Canonical Bases of Modules of Univariate Relations.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Fast Computation of the Roots of Polynomials Over the Ring of Power Series.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences.
Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017

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).
PhD thesis, 2016

Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations.
IEEE Trans. Inf. Theory, 2015

2012
On the Structure of Changes in Dynamic Contact Networks.
Proceedings of the Eighth International Conference on Signal Image Technology and Internet Based Systems, 2012


  Loading...