default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Neiger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Vincent Neiger
, Bruno Salvy, Éric Schost, Gilles Villard:
Faster Modular Composition. J. ACM 71(2): 11:1-11:79 (2024)- [c19]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. ISSAC 2024: 400-409 - [c18]Vincent Neiger, Clément Pernet, Gilles Villard:
Computing Krylov iterates in the time of matrix multiplication. ISSAC 2024: 419-428 - [i29]Vincent Neiger, Clément Pernet, Gilles Villard:
Computing Krylov iterates in the time of matrix multiplication. CoRR abs/2402.07345 (2024) - [i28]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. CoRR abs/2402.07353 (2024) - 2023
- [c17]Alin Bostan, Vincent Neiger, Sergey Yurkevich:
Beating binary powering for polynomial matrices. ISSAC 2023: 70-79 - [c16]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Refined F5 Algorithms for Ideals of Minors of Square Matrices. ISSAC 2023: 270-279 - [i27]Alin Bostan, Vincent Neiger, Sergey Yurkevich:
Beating binary powering for polynomial matrices. CoRR abs/2302.04299 (2023) - [i26]Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din:
Refined $F_5$ Algorithms for Ideals of Minors of Square Matrices. CoRR abs/2302.05375 (2023) - [i25]Peter Beelen, Vincent Neiger:
Faster List Decoding of AG Codes. CoRR abs/2304.07083 (2023) - 2022
- [c15]George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou:
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. ISSAC 2022: 351-360 - [c14]Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din:
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions. ISSAC 2022: 409-418 - [i24]Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din:
Faster change of order algorithm for Gröbner bases under shape and stability assumptions. CoRR abs/2202.09226 (2022) - [i23]George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou:
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. CoRR abs/2202.09329 (2022) - 2021
- [j10]Vincent Neiger, Clément Pernet:
Deterministic computation of the characteristic polynomial in the time of matrix multiplication. J. Complex. 67: 101572 (2021) - [j9]David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde:
Verification protocols with sub-linear communication for polynomial matrix operations. J. Symb. Comput. 105: 165-198 (2021) - [c13]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. ISSAC 2021: 201-208 - [i22]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. CoRR abs/2102.03583 (2021) - [i21]Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard:
Faster Modular Composition. CoRR abs/2110.08354 (2021) - 2020
- [j8]Vincent Neiger, Éric Schost:
Computing syzygies in finite dimension using fast linear algebra. J. Complex. 60: 101502 (2020) - [j7]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Block-Krylov techniques in the context of sparse-FGLM algorithms. J. Symb. Comput. 98: 163-191 (2020) - [j6]Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard:
Fast computation of approximant bases in canonical form. J. Symb. Comput. 98: 192-224 (2020) - [c12]Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, Jean-Pierre Tillich:
An Algebraic Attack on Rank Metric Code-Based Cryptosystems. EUROCRYPT (3) 2020: 64-93 - [c11]Simone Naldi, Vincent Neiger:
A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension. ISSAC 2020: 380-387 - [c10]Vincent Neiger, Johan Rosenkilde, Grigory Solomatov:
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation. ISSAC 2020: 388-395 - [i20]Simone Naldi, Vincent Neiger:
A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension. CoRR abs/2002.06404 (2020) - [i19]Vincent Neiger, Johan Rosenkilde, Grigory Solomatov:
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation. CoRR abs/2003.12468 (2020) - [i18]Vincent Neiger, Clément Pernet:
Deterministic computation of the characteristic polynomial in the time of matrix multiplication. CoRR abs/2010.04662 (2020)
2010 – 2019
- 2019
- [c9]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. ISSAC 2019: 235-242 - [i17]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. CoRR abs/1905.04356 (2019) - [i16]Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, Jean-Pierre Tillich:
An Algebraic Attack on Rank Metric Code-Based Cryptosystems. CoRR abs/1910.00810 (2019) - [i15]Vincent Neiger, Éric Schost:
Computing syzygies in finite dimension using fast linear algebra. CoRR abs/1912.01848 (2019) - 2018
- [j5]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Sparse FGLM using the block Wiedemann algorithm. ACM Commun. Comput. Algebra 52(4): 123-125 (2018) - [j4]Elise Barelli, Peter Beelen, Mrinmoy Datta, Vincent Neiger, Johan Rosenkilde:
Two-Point Codes for the Generalized GK Curve. IEEE Trans. Inf. Theory 64(9): 6268-6276 (2018) - [c8]Pascal Giorgi, Vincent Neiger:
Certification of Minimal Approximant Bases. ISSAC 2018: 167-174 - [c7]Vincent Neiger, Johan Rosenkilde, Grigory Solomatov:
Computing Popov and Hermite Forms of Rectangular Polynomial Matrices. ISSAC 2018: 295-302 - [i14]Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard:
Fast computation of approximant bases in canonical form. CoRR abs/1801.04553 (2018) - [i13]Pascal Giorgi, Vincent Neiger:
Certification of minimal approximant bases. CoRR abs/1802.01920 (2018) - [i12]Vincent Neiger, Johan Rosenkilde, Grigory Solomatov:
Computing Popov and Hermite forms of rectangular polynomial matrices. CoRR abs/1802.01928 (2018) - [i11]David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde:
Interactive Certificates for Polynomial Matrices with Sub-Linear Communication. CoRR abs/1807.01272 (2018) - 2017
- [j3]George Labahn, Vincent Neiger, Wei Zhou:
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. J. Complex. 42: 44-71 (2017) - [j2]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. J. Symb. Comput. 83: 272-314 (2017) - [c6]Vincent Neiger, Hamid Rahkooy, Éric Schost:
Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. CASC 2017: 313-328 - [c5]Vincent Neiger, Johan Rosenkilde, Éric Schost:
Fast Computation of the Roots of Polynomials Over the Ring of Power Series. ISSAC 2017: 349-356 - [c4]Vincent Neiger, Thi Xuan Vu:
Computing Canonical Bases of Modules of Univariate Relations. ISSAC 2017: 357-364 - [i10]Vincent Neiger, Thi Xuan Vu:
Computing Canonical Bases of Modules of Univariate Relations. CoRR abs/1705.10649 (2017) - [i9]Vincent Neiger, Johan Rosenkilde, Éric Schost:
Fast Computation of the Roots of Polynomials Over the Ring of Power Series. CoRR abs/1705.10658 (2017) - [i8]Elise Barelli, Peter Beelen, Mrinmoy Datta, Vincent Neiger, Johan Rosenkilde:
Two-Point Codes for the Generalized GK curve. CoRR abs/1706.00800 (2017) - [i7]Vincent Neiger, Hamid Rahkooy, Éric Schost:
Algorithms for zero-dimensional ideals using linear recurrent sequences. CoRR abs/1707.01971 (2017) - [i6]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Block-Krylov techniques in the context of sparse-FGLM algorithms. CoRR abs/1712.04177 (2017) - 2016
- [b1]Vincent Neiger:
Bases of relations in one or several variables: fast algorithms and applications. (Bases de relations en une ou plusieurs variables : algorithmes rapides et applications). École normale supérieure de Lyon, France, 2016 - [c3]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. ISSAC 2016: 295-302 - [c2]Vincent Neiger:
Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations. ISSAC 2016: 365-372 - [i5]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. CoRR abs/1602.00651 (2016) - [i4]Vincent Neiger:
Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations. CoRR abs/1602.00710 (2016) - [i3]George Labahn, Vincent Neiger, Wei Zhou:
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. CoRR abs/1607.04176 (2016) - 2015
- [j1]Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations. IEEE Trans. Inf. Theory 61(5): 2370-2387 (2015) - [i2]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. CoRR abs/1512.03503 (2015) - 2014
- [i1]Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations. CoRR abs/1402.0643 (2014) - 2012
- [c1]Vincent Neiger, Christophe Crespelle, Eric Fleury:
On the Structure of Changes in Dynamic Contact Networks. SITIS 2012: 731-738
Coauthor Index
aka: Johan Rosenkilde
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
