Vincent Neiger
Vincent Neiger
Bestätigte E-Mail-Adresse bei unilim.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations
MFI Chowdhury, CP Jeannerod, V Neiger, É Schost, G Villard
IEEE Transactions on Information Theory 61 (5), 2370-2387, 2015
272015
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts
CP Jeannerod, V Neiger, É Schost, G Villard
Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016
202016
Computing minimal interpolation bases
CP Jeannerod, V Neiger, É Schost, G Villard
Journal of Symbolic Computation 83, 272-314, 2017
192017
Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
V Neiger
Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016
162016
On the structure of changes in dynamic contact networks
V Neiger, C Crespelle, E Fleury
2012 Eighth International Conference on Signal Image Technology and Internet …, 2012
122012
Bases of relations in one or several variables: fast algorithms and applications
V Neiger
École Normale Supérieure de Lyon-University of Waterloo, 2016
112016
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
G Labahn, V Neiger, W Zhou
Journal of Complexity 42, 44-71, 2017
102017
Fast computation of the roots of polynomials over the ring of power series
V Neiger, J Rosenkilde, É Schost
Proceedings of the 2017 ACM on International Symposium on Symbolic and …, 2017
82017
Computing canonical bases of modules of univariate relations
V Neiger, VT Xuan
Proceedings of the 2017 ACM on International Symposium on Symbolic and …, 2017
72017
Fast computation of approximant bases in canonical form
CP Jeannerod, V Neiger, G Villard
Journal of Symbolic Computation 98, 192-224, 2020
52020
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
SG Hyun, V Neiger, É Schost
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019
42019
Computing Popov and Hermite forms of rectangular polynomial matrices
V Neiger, J Rosenkilde, G Solomatov
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
42018
Certification of minimal approximant bases
P Giorgi, V Neiger
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
32018
Two-point codes for the generalized GK curve
E Barelli, P Beelen, M Datta, V Neiger, J Rosenkilde
IEEE Transactions on Information Theory 64 (9), 6268-6276, 2017
32017
Algorithms for zero-dimensional ideals using linear recurrent sequences
V Neiger, H Rahkooy, É Schost
International Workshop on Computer Algebra in Scientific Computing, 313-328, 2017
22017
Interactive Certificates for Polynomial Matrices with Sub-Linear Communication
D Lucas, V Neiger, C Pernet, DS Roche, J Rosenkilde
arXiv preprint arXiv:1807.01272, 2018
12018
On the complexity of multivariate interpolation with multiplicities and of simultaneous polynomial approximations
MFI Chowdhury, CP Jeannerod, V Neiger, É Schost, G Villard
10th Asian Symposium on Computer Mathematics (ASCM), Beijing, China, 2012
12012
Block-Krylov techniques in the context of sparse-FGLM algorithms
SG Hyun, V Neiger, H Rahkooy, É Schost
Journal of Symbolic Computation 98, 163-191, 2020
2020
Sparse FGLM using the block Wiedemann algorithm
SG Hyun, V Neiger, H Rahkooy, É Schost
ACM Communications in Computer Algebra 52 (4), 123-125, 2019
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–19