A uniform approach for the fast computation of matrix-type pade approximants, SIAM J. Matrix Anal. Appl, vol.15, pp.804-823, 1994. ,
Towards mixed Gröbner basis algorithms: The multihomogeneous and sparse case, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, pp.71-78, 2018. ,
Nonbinary BCH decoding, IEEE Trans. Inform. Theory, vol.14, pp.242-242, 1968. ,
Linear algebra for computing gröbner bases of linear recursive multidimensional sequences, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, pp.61-68, 2015. ,
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences, Journal of Symbolic Computation, vol.83, pp.36-67, 2017. ,
Guessing linear recurrence relations of sequence tuplesand p-recursive sequences with linear algebra, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp.95-102, 2016. ,
A polynomial-division-based algorithm for computing linear recurrence relations, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, pp.79-86, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01935229
On a class of error correcting binary group codes, Information and Control, vol.3, pp.90287-90291, 1960. ,
On 3-dimensional lattice walks confined to the positive octant, Annals of Combinatorics, vol.20, pp.661-704, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01063886
Explicit formula for the generating series of diagonal 3D rook paths. Séminaire Lotharingien de Combinatoire B66a, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00780432
Non-D-finite excursions in the quarter plane, J. Combin. Theory Ser. A, vol.121, pp.45-63, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00697386
Walks with small steps in the quarter plane, in: Algorithmic probability and combinatorics, Amer. Math. Soc, vol.520, pp.1-39, 2010. ,
Walks confined in a quadrant are not always d-finite, Theoret. Comput. Sci, vol.307, pp.257-276, 2003. ,
Fast solution of Toeplitz systems of equations and computation of Padé approximants, Journal of Algorithms, vol.1, pp.90013-90022, 1980. ,
On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.28, pp.693-701, 1991. ,
, Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics, 2015.
A new efficient algorithm for computing Gröbner bases (f4), Journal of Pure and Applied Algebra, vol.139, pp.5-5, 1999. ,
A new efficient algorithm for computing Gröbner bases without reduction to zero (f5), Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp.75-83, 2002. ,
Efficient Computation of Zerodimensional Gröbner Bases by Change of Ordering, J. Symbolic Comput, vol.16, pp.329-344, 1993. ,
Fast algorithm for change of ordering of zero-dimensional gröbner bases with sparse multiplication matrices, Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pp.115-122, 2011. ,
Sparse FGLM algorithms, Journal of Symbolic Computation, vol.80, pp.538-569, 2017. ,
Sparse Gröbner bases: The unmixed case, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp.178-185, 2014. ,
Gröbner bases of ideals invariant under a commutative group: The nonmodular case, Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pp.347-354, 2013. ,
Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence, IEEE Trans. Inform. Theory, vol.36, pp.1480-1487, 1990. ,
Codes correcteurs d'erreurs, vol.2, pp.147-156, 1959. ,
Why you should remove zeros from data before guessing, ACM Commun. Comput. Algebra, vol.53, pp.126-129, 2019. ,
An optimal algorithm for constructing the reduced grbner basis of binomial ideals, Journal of Symbolic Computation, vol.28, pp.317-338, 1999. ,
Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory it, vol.15, pp.122-127, 1969. ,
Truncation bounds for differentially finite series, Annales Henri Lebesgue, vol.2, pp.99-148, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01817568
Fast algorithm for border bases of artinian gorenstein algebras, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, pp.333-340, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01515366
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, J. Symbolic Comput, vol.5, pp.80033-80039, 1988. ,
Extension of the Berlekamp-Massey algorithm to N Dimensions, Inform. and Comput, vol.84, pp.207-239, 1990. ,
The bms algorithm, Gröbner Bases, Coding, and Cryptography, pp.143-163, 2009. ,
Grbner bases of symmetric ideals, Journal of Symbolic Computation, vol.54, pp.72-86, 2013. ,