-
On the Algorithms of Guruswami-Sudan List Decoding over Finite Rings
This thesis studies the algorithmic techniques of list decoding, first proposed by Guruswami and Sudan in 1998, in the context of Reed-Solomon codes over finite rings.... -
Automatic computation of Stokes matrices
International audience -
Stokes phenomenon for the prolate spheroidal wave equation
Special Issue: Approximation and extrapolation of convergent and divergent sequences and series (CIRM, Luminy - France, 2009) -
Computing Closed-Form Solutions of Integrable Connections
International audience -
Proving formally the implementation of an efficient gcd algorithm for polynom...
Last version published in the proceedings of IJCAR 06, part of FLOC 06. -
A Reduced Form for Linear Differential Systems and its Application to Integra...
International audience -
Solving Parametric Polynomial Systems
We present a new algorithm for solving basic parametric constructible or semi-algebraic systems like $\mathcal{C} = \{ x \in \Cp_1 ( x ) = 0, \ldots, p_s ( x ) = 0,... -
Comparison of XL and Gröbner basis algorithms over Finite Fields
This paper compares the XL algorithm with Gröbner basis algorithm. We explain the link between XL computation result and Gröbner basis with the well-known notion of... -
The complete Generating Function for Gessel Walks is Algebraic
Gessel walks are lattice walks in the quarter plane $\set N^2$ which start at the origin $(0,0)\in\set N^2$ and consist only of steps chosen from the set... -
Mathemagix User Guide
101 pages -
Réseaux de Pétri stochastiques comportant une seule place 1ere partie: régime...
Le formalisme des systèmes de réactions chimiques (de manière équivalente des réseaux de Pétri stochastiques) est très souvent utilisé en bilogie, en sûreté de... -
Computing representations for radicals of finitely generated differential ideals
International audience -
Rational Univariate Representations of Bivariate Systems and Applications
We address the problem of solving systems of two bivariate polynomials of total degree at most $d$ with integer coefficients of maximum bitsize $\tau$. It is known... -
Complexity reduction of C-algorithm
International audience -
Polynomial Optimization and Polar Varieties: theory, algorithms and implement...
Computing the global infimum $f^*$ of a multivariate polynomial subject to some constraints is a central question since it appears in many areas of engineering... -
Effective methods in differential Galois theory and applications to integrabi...
Mes recherches portent essentiellement sur l''elaboration de m'ethodes de calcul formel pour l''etude constructive des 'equations diff'erentielles lin'eaires, plus... -
Separating linear forms for bivariate systems
We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the... -
Real Root Counting For some Robotics problems
Contribution à un ouvrage. -
Faster relaxed multiplication
In previous work, we have introduced several fast algorithms for relaxed power series multiplication (also known under the name on-line multiplication) up till a given... -
Design of regular nonseparable bidimensional wavelets using Grobner basis tec...
Article dans revue scientifique avec comité de lecture.
