Vincent Neiger
Orcid: 0000-0002-8311-9490
According to our database1,
Vincent Neiger
authored at least 34 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
2022
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
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021
2020
J. Symb. Comput., 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
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
CoRR, 2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
2017
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix.
J. Complex., 2017
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017
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
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
Proceedings of the Eighth International Conference on Signal Image Technology and Internet Based Systems, 2012