The Big Mother of all Dualities: Möller Algorithm, Communications in Algebra, vol.31, pp.783-818, 2003. ,
A reliable method for computing M-Padé approximants on arbitrary staircases, J. Comput. Appl. Math, vol.40, pp.19-42, 1992. ,
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants, SIAM J. Matrix Anal. Appl, vol.15, pp.804-823, 1994. ,
Recursiveness in matrix rational interpolation problems, J. Comput. Appl. Math, vol.77, issue.96, pp.120-123, 1997. ,
Syzygies, finite length modules, and random curves, Commutative Algebra and Noncommutative Algebraic Geometry. Mathematical Sciences Research Institute Publications, vol.67, pp.25-52, 2015. ,
A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations, Proceedings ISSAC 2018. 79-86, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01935229
, Fundamental Algorithms, vol.1, 1994.
, Combinatorics of ideals of points: a Cerlienco-Mureddu-like approach for an iterative lex game, 2018.
From algebraic sets to monomial linear bases by means of combinatorial algorithms, Discrete Mathematics, vol.139, pp.73-87, 1995. ,
Matrix multiplication via arithmetic progressions, J. Symb. Comput, vol.9, issue.08, pp.80013-80015, 1990. ,
Using Algebraic Geometry, 2005. ,
, Ideals, Varieties, and Algorithms, 2007.
Commutative Algebra: with a View Toward Algebraic Geometry, 1995. ,
Computing Gröbner bases for vanishing ideals of finite sets of points, International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, pp.118-127, 2006. ,
The lex game and some applications, J. Symb. Comput, vol.41, issue.6, pp.663-681, 2006. ,
Solving a Multivariable Congruence by Change of Term Order, J. Symb. Comput, vol.24, pp.575-589, 1997. ,
A Gröbner basis technique for Padé approximation, J. Symb. Comput, vol.13, issue.08, pp.80087-80096, 1992. ,
Algorithms for Analytic Approximation (to a Formal Powerseries), 1973. ,
On the complexity of polynomial matrix computations, ISSAC'03, pp.135-142, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-02101878
Sur les systèmes d'équations aux dérivées partielles, J. Math. Pures Appl, vol.170, pp.65-152, 1920. ,
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts, ISSAC'16, pp.295-302, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01265983
Computing minimal interpolation bases, J. Symb. Comput, vol.83, pp.272-314, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01241781
Fast computation of approximant bases in canonical form, J. Symb. Comput, vol.98, pp.192-224, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-01683632
Powers of Tensors and Fast Matrix Multiplication, ISSAC'14, pp.296-303, 2014. ,
Gröbner bases of ideals defined by functionals with an application to ideals of projective points, Appl. Algebra Engrg. Comm. Comput, vol.4, pp.103-145, 1993. ,
The Construction of Multivariate Polynomials with Preassigned Zeros, EUROCAM'82, vol.144, pp.24-31, 1982. ,
The FGLM Problem and Möller's Algorithm on Zero-dimensional Ideals, Gröbner Bases, Coding, and, pp.27-45, 2009. ,
Bases of relations in one or several variables: fast algorithms and applications, 2016. ,
URL : https://hal.archives-ouvertes.fr/tel-01431413
Computing syzygies in finite dimension using fast linear algebra, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02392488
Gröbner basis solutions of constrained interpolation problems, Linear Algebra Appl, vol.351, pp.533-551, 2002. ,
Die Berechnung von Syzygien mit dem verallgemeinerten Weierstraßschen Divisionssatz, 1980. ,
Notes on computing minimal approximant bases, Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings, 2006. ,
A general module theoretic framework for vector M-Padé and matrix rational interpolation, Numer. Algorithms, vol.3, pp.451-462, 1992. ,
The Rational Approximation of Functions which are Formally Defined by a Power Series Expansion, Math. Comp, vol.14, pp.147-186, 1960. ,
Efficient Algorithms for Order Basis Computation, J. Symb. Comput, vol.47, pp.793-819, 2012. ,