Staff directory

NEIGER Vincent

Associate Professor, Sorbonne Université
Team : PolSys

Sorbonne Université - LIP6

+33 1 44 27 87 59
Vincent.Neiger (at) nulllip6.fr
https://lip6.fr/Vincent.Neiger

Two PhD Students (Supervision / Co-supervision)

KHICHANE Sara : Fast algorithms for structured algebraic relations.
PASSE Hugo : Algorithmes pour le calcul de bases lexicographiques d'idéaux polynomiaux: plus grande généralité et meilleure complexité.

2022-2026 Publications

All Articles Communications Other publications

2026
- J. Berthomieu, V. Neiger, H. Passe : “Computing submatrices of the Hermite normal form of a structured polynomial matrix”, Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation, Oldenburg, Germany (2026)
- V. Neiger, B. Salvy, E. Schost, G. Villard : “Faster Modular Composition Using Two Relation Matrices”, ISSAC '26: Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation, Oldenburg, Germany, pp. 315-324, (Association for Computing Machinery), (ISBN: 979-8-4007-2595-1) (2026)
- R. Kouba, V. Neiger, M. Safey El Din : “A complexity analysis of the F4 Gröbner basis algorithm with tracer data”, (2026)
2025
- P. Beelen, V. Neiger : “Faster List Decoding of AG Codes”, IEEE Transactions on Information Theory, vol. 71 (5), pp. 3397-3408, (Institute of Electrical and Electronics Engineers) (2025)
2024
- V. Neiger, C. Pernet, G. Villard : “Computing Krylov iterates in the time of matrix multiplication”, Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, ISSAC '24, Raleigh, NC, United States, pp. 419–428, (ACM), (ISBN: 9798400706967) (2024)
- S. Gopalakrishnan, V. Neiger, M. Safey El Din : “Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations”, Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, ISSAC '24, Raleigh, NC, United States, pp. 400–409, (ACM), (ISBN: 9798400706967) (2024)
- V. Neiger, B. Salvy, E. Schost, G. Villard : “Faster Modular Composition”, Journal of the ACM (JACM), vol. 71 (2), pp. 1-79, (Association for Computing Machinery) (2024)
- V. Neiger : “Designing and exploiting fast algorithms for univariate polynomial matrices”, (2024)
2023
- A. Bostan, V. Neiger, S. Yurkevich : “Beating binary powering for polynomial matrices”, ISSAC 2023 - 48^th International Symposium on Symbolic and Algebraic Computation, Tromso, Norway (2023)
- S. Gopalakrishnan, V. Neiger, M. Safey El Din : “Refined F5 Algorithms for Ideals of Minors of Square Matrices”, ISSAC '23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, Tromsø, Norway (2023)
2022
- J. Berthomieu, V. Neiger, M. Safey El Din : “Faster change of order algorithm for Gröbner bases under shape and stability assumptions”, 47^th International Symposium on Symbolic and Algebraic Computation, Lille, France (2022)
- G. Labahn, V. Neiger, Th. Vu, W. Zhou : “Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix”, ISSAC 2022, Villeneuve-d'Ascq, France (2022)