- Linear recurrences with polynomial coe#cients and application to integer factorization and CartierManin
- Fast Multivariate Power Series Multiplication in Characteristic Zero
- Solving Toeplitz and Vandermondelike Linear Systems with Large Displacement Rank
- Construction of Secure Random Curves of Genus 2 over Prime Fields
- Multi-point evaluation in higher dimensions Joris van der Hoeven
- Optimization Techniques for Small Matrix Multiplication
- transalpyne: a language for automatic transposition Luca De Feo
- The modpn Library: Bringing Fast Polynomial Arithmetic into Maple
- Please cite this article in press as: Roy, M.J., et al., Analytical solution of the tooling/workpiece contact interface shape during a flow forming operation. J. Mater. Process. Tech. (2010), doi:10.1016/j.jmatprotec.2010.07.011
- On the geometry of polar varieties1 , M. Giusti 3
- Code generation for polynomial multiplication and Eric Schost2
- Interpolation of polynomials given by straight-line programs
- Fast Arithmetics in Artin-Schreier Towers over Finite Fields Luca De Feo
- Evaluation properties of invariant polynomials Xavier Dahan a Eric Schost b
- High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment
- Fast Conversion Algorithms for Orthogonal Polynomials
- Change of order for regular chains in positive Xavier Dahan a
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000000
- Modular equations for hyperelliptic curves P. Gaudry and E. Schost
- Fast computation of power series solutions of systems of differential equations
- Primary decomposition of zero-dimensional ideals: Putting Monico's algorithm into practice
- Evaluation properties of symmetric polynomials Pierrick Gaudry, LIX, Ecole polytechnique
- Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator
- Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality
- Uniform bounds on the number of rational points of a family of curves of genus 2
- Solving the Birkhoff Interpolation Problem via the Critical Point Method: an Experimental Study
- Fast Computation of Special Resultants Alin Bostan a
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real
- Linear recurrences with polynomial coecients and computation of the Cartier-Manin operator
- Multivariate Power Series Multiplication Eric Schost, LIX,
- On the complexity of the D5 principle Xavier Dahan Marc Moreno Maza
- Properness defects of projections and computation of one point in each connected
- Fast Arithmetic for Triangular Sets: from Theory to Practice
- Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set
- Solving the Birkho Interpolation Problem via the Critical Point Method: an Experimental Study
- Fast computation of power series solutions of systems of di#erential equations #
- Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin
- On the complexity of the D5 principle Xavier Dahan Marc Moreno Maza Eric Schost Yuzhen Xie
- Complexity Issues in Bivariate Polynomial Factorization Laboratoire STIX
- Primary decomposition of zerodimensional ideals: Putting Monico's algorithm into practice
- Properness defects of projections and computation of one point in each connected
- Computing Parametric Geometric Resolutions Eric Schost
- Fast Computation of Special Resultants Alin Bostan a Philippe Flajolet a Bruno Salvy a
- Change Of Order For Bivariate Triangular Sets Cyril Pascal
- Evaluation properties of symmetric polynomials Pierrick Gaudry, LIX,
- Bit-size estimates for triangular sets in positive Xavier Dahan
- Implementation Techniques for Fast Polynomial Arithmetic in a High-level Programming Environment
- Trinomial bases and Chinese remaindering for modular polynomial multiplication
- Polynomial evaluation and interpolation on special sets of points
- Solving structured linear systems with large displacement rank
- Differential Equations for Algebraic Functions Alin Bostan, Frdric Chyzak, Bruno Salvy
- Uniform bounds for the number of rational points of families of curves of genus 2
- Sharp Estimates for Triangular Sets Xavier Dahan
- Power Series Composition and Change of Basis Alin Bostan
- Fast Multivariate Power Series Multiplication in Characteristic Zero
- Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set
- Tellegen's Principle into Practice Laboratoire STIX
- A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm
- Change Of Order For Bivariate Triangular Sets Cyril Pascal
- Some known results on polynomial factorization over towers of field extensions
- Degree bounds and lifting techniques for triangular sets Eric Schost, Laboratoire GAGE,
- Uniform bounds for the number of rational points of families of curves of genus 2 ?
- Complexity Results for Triangular Sets Eric Schost
- Polynomial evaluation and interpolation on special sets of points
- Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts
- Degree bounds and lifting techniques for triangular sets Eric Schost, Laboratoire GAGE, Ecole polytechnique
- Complexity Results for Triangular Sets Eric Schost
- On the complexities of multipoint evaluation and interpolation
- Sur la r esolution des syst emes polynomiaux a param etres
- There is no reverse derivation mode for discrete derivatives
- Fast arithmetic for triangular sets: from theory to practice
- Multivariate Power Series Multiplication Eric Schost, LIX, Ecole polytechnique
- Solving Toeplitz-and Vandermonde-like Linear Systems with Large Displacement Rank
- Construction of Secure Random Curves of Genus 2 over Prime Fields
- On the invariants of the quotients of the Jacobian of a curve of genus 2
- Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality
- Uniform bounds on the number of rational points of a family of curves of genus 2
- Computing Parametric Geometric Resolutions Eric Schost
- Homotopy techniques for multiplication modulo triangular sets
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000--000
- Change of order for regular chains in positive Xavier Dahan a Xin Jin b Marc Moreno Maza b
- Computing the eigenvalue in the SchoofElkiesAtkin algorithm using Abelian lifts
- Implementation Techniques for Fast Polynomial Arithmetic in a Highlevel Programming Environment
- Properness defects of projections and computation of one point in each connected
- Uniform bounds on the number of rational points of a family of curves of genus 2*
- Solving the Birkhoff Interpolation Problem via the Critical Point Method: an Experimental Study
- Complexity Results for Triangular Sets E'ric Schost
- Tellegen's Principle into Practice A. Bostan G. Lecerf 'E. Schost
- Sharp Estimates for Triangular Sets Xavier Dahan
- Fast algorithms for differential equations in positive characteristic
- There is no reverse derivation mode for discrete derivatives
- Modular equations for hyperelliptic curves P. Gaudry and
- On the complexities of multipoint evaluation and interpolation
- Solving some overdetermined polynomial systems Marc Giusti, 'Eric Schost
- Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator
- Fast Multivariate Power Series Multiplication in Characteristic Zero
- Modular equations for hyperelliptic curves P. Gaudry and 'E. Schost
- Computing Parametric Geometric Resolutions E'ric Schost
- Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set
- Uniform bounds for the number of rational points of families of curves of genus 2?
- Degree bounds and lifting techniques for triangular sets 'Eric Schost, Laboratoire GAGE, 'Ecole polytechnique
- Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality
- Modular composition modulo triangular sets and applications
- Taking Roots over High Extensions of Finite Fields
- Genus 2 point counting over prime fields Pierrick Gaudry
- On the complexity of computing with zero-dimensional triangular sets
- Fast Arithmetics in Artin-Schreier Towers over Finite Fields