Solving Some Overdetermined Polynomial Systems. - Marc Giusti; Éric Schost (ISSAC, 1999)

Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study. - Fabrice Rouillier; Mohab Safey El Din; Éric Schost (Automated Deduction in Geometry, 2000)

On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. - Pierrick Gaudry; Éric Schost (AAECC, 2001)

Degree bounds and lifting techniques for triangular sets. - Éric Schost (ISSAC, 2002)

Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves. - Alin Bostan; Pierrick Gaudry; Éric Schost (International Conference on Finite Fields and Applications, 2003)

Tellegen's principle into practice. - Alin Bostan; Grégoire Lecerf; Éric Schost (ISSAC, 2003)

Polar varieties and computation of one point in each connected component of a smooth real algebraic set. - Mohab Safey El Din; Éric Schost (ISSAC, 2003)

Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality. - Alin Bostan; Bruno Salvy; Éric Schost (Appl. Algebra Eng. Commun. Comput., 2003)

Computing Parametric Geometric Resolutions. - Éric Schost (Appl. Algebra Eng. Commun. Comput., 2003)

Complexity results for triangular sets. - Éric Schost (J. Symb. Comput., 2003)

A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm. - Pierrick Gaudry; Éric Schost (ANTS, 2004)

Construction of Secure Random Curves of Genus 2 over Prime Fields. - Pierrick Gaudry; Éric Schost (EUROCRYPT, 2004)

Complexity issues in bivariate polynomial factorization. - Alin Bostan; Grégoire Lecerf; Bruno Salvy; Éric Schost; B. Wiebelt (ISSAC, 2004)

Sharp estimates for triangular sets. - Xavier Dahan; Éric Schost (ISSAC, 2004)

Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. - Mohab Safey El Din; Éric Schost (Discret. Comput. Geom., 2004)

On the complexities of multipoint evaluation and interpolation. - Alin Bostan; Éric Schost (Theor. Comput. Sci., 2004)

Lifting techniques for triangular decompositions. - Xavier Dahan; Marc Moreno Maza; Éric Schost; Wenyuan Wu; Yuzhen Xie (ISSAC, 2005)

Multivariate power series multiplication. - Éric Schost (ISSAC, 2005)

On the complexity of the D5 principle. - Xavier Dahan; Éric Schost; Marc Moreno Maza; Wenyuan Wu; Yuzhen Xie (SIGSAM Bull., 2005)

Polynomial evaluation and interpolation on special sets of points. - Alin Bostan; Éric Schost (J. Complex., 2005)

Modular equations for hyperelliptic curves. - Pierrick Gaudry; Éric Schost (Math. Comput., 2005)

There is no efficient reverse derivation mode for discrete derivatives. - Éric Schost (Theor. Comput. Sci., 2005)

Using fast matrix multiplication to solve structured linear systems. - Éric Schost; Alin Bostan; Claude-Pierre Jeannerod (Challenges in Symbolic Computation Software, 2006)

Implementation techniques for fast polynomial arithmetic in a high-level programming environment. - Akpodigha Filatei; Xin Li 009; Marc Moreno Maza; Éric Schost (ISSAC, 2006)

Change of order for bivariate triangular sets. - Cyril Pascal; Éric Schost (ISSAC, 2006)

Evaluation Properties of Symmetric Polynomials. - Pierrick Gaudry; Éric Schost; Nicolas M. Thiéry (Int. J. Algebra Comput., 2006)

Fast computation of special resultants. - Alin Bostan; Philippe Flajolet; Bruno Salvy; Éric Schost (J. Symb. Comput., 2006)

On the Virtues of Generic Programming for Symbolic Computation. - Xin Li 009; Marc Moreno Maza; Éric Schost (International Conference on Computational Science (2), 2007)

Differential equations for algebraic functions. - Alin Bostan; Frédéric Chyzak; Bruno Salvy; Grégoire Lecerf; Éric Schost (ISSAC, 2007)

Solving toeplitz- and vandermonde-like linear systems with large displacement rank. - Alin Bostan; Claude-Pierre Jeannerod; Éric Schost (ISSAC, 2007)

Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. - P. Mihailescu; François Morain; Éric Schost (ISSAC, 2007)

Fast computation of power series solutions of systems of differential equations. - Alin Bostan; Frédéric Chyzak; François Ollivier; Bruno Salvy; Éric Schost; Alexandre Sedoglavic (SODA, 2007)

Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator. - Alin Bostan; Pierrick Gaudry; Éric Schost (SIAM J. Comput., 2007)

High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment. - Xin Li 009; Marc Moreno Maza; Raqeeb Rasheed; Éric Schost (ICCSA Workshops, 2008)

Power series composition and change of basis. - Alin Bostan; Bruno Salvy; Éric Schost (ISSAC, 2008)

Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering. - Éric Schost; Arash Hariri (Selected Areas in Cryptography, 2008)

The modpn library: bringing fast polynomial arithmetic into MAPLE. - Xin Li 009; Marc Moreno Maza; Raqeeb Rasheed; Éric Schost (ACM Commun. Comput. Algebra, 2008)

Fast Conversion Algorithms for Orthogonal Polynomials - Alin Bostan; Bruno Salvy; Éric Schost (CoRR, 2008)

Fast algorithms for computing isogenies between elliptic curves. - Alin Bostan; François Morain; Bruno Salvy; Éric Schost (Math. Comput., 2008)

Solving structured linear systems with large displacement rank. - Alin Bostan; Claude-Pierre Jeannerod; Éric Schost (Theor. Comput. Sci., 2008)

Change of order for regular chains in positive dimension. - Xavier Dahan; Xin Jin; Marc Moreno Maza; Éric Schost (Theor. Comput. Sci., 2008)

Code Generation for Polynomial Multiplication. - Ling Ding; Éric Schost (CASC, 2009)

Fast algorithms for differential equations in positive characteristic. - Alin Bostan; Éric Schost (ISSAC, 2009)

Homotopy methods for multiplication modulo triangular sets - Alin Bostan; Muhammad F. I. Chowdhury; Joris van der Hoeven; Éric Schost (CoRR, 2009)

A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces - Mohab Safey El Din; Éric Schost (CoRR, 2009)

A simple and fast algorithm for computing exponentials of power series. - Alin Bostan; Éric Schost (Inf. Process. Lett., 2009)

Evaluation properties of invariant polynomials. - Xavier Dahan; Éric Schost; Jie Wu 015 (J. Symb. Comput., 2009)

Fast arithmetic for triangular sets: From theory to practice. - Xin Li 009; Marc Moreno Maza; Éric Schost (J. Symb. Comput., 2009)

Interpolation of polynomials given by straight-line programs. - Sanchit Garg; Éric Schost (Theor. Comput. Sci., 2009)

On the geometry of polar varieties. - Bernd Bank; Marc Giusti; Joos Heintz; Mohab Safey El Din; Éric Schost (Appl. Algebra Eng. Commun. Comput., 2010)

Complexity and performance results for non FFT-based univariate polynomial multiplication. - Muhammad F. I. Chowdhury; Marc Moreno Maza; Wei Pan 001; Éric Schost (ACM Commun. Comput. Algebra, 2010)

Almost linear time operations with triangular sets. - Xavier Dahan; Marc Moreno Maza; Éric Schost; Adrien Poteaux (ACM Commun. Comput. Algebra, 2010)

transalpyne: a language for automatic transposition. - Luca De Feo; Éric Schost (ACM Commun. Comput. Algebra, 2010)

A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface. - Mohab Safey El Din; Éric Schost (Discret. Comput. Geom., 2011)

Homotopy techniques for multiplication modulo triangular sets. - Alin Bostan; Muhammad F. I. Chowdhury; Joris van der Hoeven; Éric Schost (J. Symb. Comput., 2011)

Optimization techniques for small matrix multiplication. - Charles-Éric Drevet; Md. Nazrul Islam; Éric Schost (Theor. Comput. Sci., 2011)

Inversion Modulo Zero-Dimensional Regular Chains. - Marc Moreno Maza; Éric Schost; Paul Vrbik (CASC, 2012)

Power series solutions of singular (q)-differential equations. - Alin Bostan; Bruno Salvy; Muhammad F. I. Chowdhury; Éric Schost; Romain Lebreton (ISSAC, 2012)

Algorithms for the universal decomposition algebra. - Romain Lebreton; Éric Schost (ISSAC, 2012)

On the complexity of computing certain resultants. - Romain Lebreton; Esmaeil Mehrabi; Éric Schost (ACM Commun. Comput. Algebra, 2012)

Bit-size estimates for triangular sets in positive dimension. - Xavier Dahan; Abdulilah Kadri; Éric Schost (J. Complex., 2012)

Fast arithmetics in Artin-Schreier towers over finite fields. - Luca De Feo; Éric Schost (J. Symb. Comput., 2012)

Genus 2 point counting over prime fields. - Pierrick Gaudry; Éric Schost (J. Symb. Comput., 2012)

Fast algorithms for l-adic towers over finite fields. - Luca De Feo; Javad Doliskani; Éric Schost (ISSAC, 2013)

Structured FFT and TFT: symmetric and lattice polynomials. - Joris van der Hoeven; Romain Lebreton; Éric Schost (ISSAC, 2013)

On the complexity of solving bivariate systems: the case of non-singular solutions. - Romain Lebreton; Esmaeil Mehrabi; Éric Schost (ISSAC, 2013)

Multi-point evaluation in higher dimensions. - Joris van der Hoeven; Éric Schost (Appl. Algebra Eng. Commun. Comput., 2013)

Modular Composition Modulo Triangular Sets and Applications. - Adrien Poteaux; Éric Schost (Comput. Complex., 2013)

Newton-like iteration for determinantal systems and structured low rank approximation. - Éric Schost; Pierre-Jean Spaenlehauer (ACM Commun. Comput. Algebra, 2013)

Fast algorithms for ell-adic towers over finite fields - Luca De Feo; Javad Doliskani; Éric Schost (CoRR, 2013)

Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011. - Ioannis Z. Emiris; Éric Schost (J. Symb. Comput., 2013)

On the complexity of computing with zero-dimensional triangular sets. - Adrien Poteaux; Éric Schost (J. Symb. Comput., 2013)

Doing Algebraic Geometry with the RegularChains Library. - Parisa Alvandi; Changbo Chen; Steffen Marcus; Marc Moreno Maza; Éric Schost; Paul Vrbik (ICMS, 2014)

A fast algorithm for computing the characteristic polynomial of the p-curvature. - Alin Bostan; Xavier Caruso; Éric Schost (ISSAC, 2014)

Fast arithmetic for the algebraic closure of finite fields. - Luca De Feo; Javad Doliskani; Éric Schost (ISSAC, 2014)

A Truncated Fourier Transform middle product. - Andrew Arnold; Éric Schost (ACM Commun. Comput. Algebra, 2014)

A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. - Saugata Basu; Marie-Françoise Roy; Mohab Safey El Din; Éric Schost (Found. Comput. Math., 2014)

Taking roots over high extensions of finite fields. - Javad Doliskani; Éric Schost (Math. Comput., 2014)

A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve. - Parisa Alvandi; Marc Moreno Maza; Éric Schost; Paul Vrbik (CASC, 2015)

A Fast Algorithm for Computing the P-curvature. - Alin Bostan; Xavier Caruso; Éric Schost (ISSAC, 2015)

Algorithms for Finite Field Arithmetic. - Éric Schost (ISSAC, 2015)

Computing in degree 2k-extensions of finite fields of odd characteristic. - Javad Doliskani; Éric Schost (Des. Codes Cryptogr., 2015)

Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations. - Muhammad F. I. Chowdhury; Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (IEEE Trans. Inf. Theory, 2015)

Computation of the Similarity Class of the p-Curvature. - Alin Bostan; Xavier Caruso; Éric Schost (ISSAC, 2016)

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. - Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (ISSAC, 2016)

A Fast Algorithm for Computing the Truncated Resultant. - Guillaume Moroz; Éric Schost (ISSAC, 2016)

A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. - Éric Schost; Pierre-Jean Spaenlehauer (Found. Comput. Math., 2016)

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers. - Esmaeil Mehrabi; Éric Schost (J. Complex., 2016)

A simple and fast online power series multiplication and its analysis. - Romain Lebreton; Éric Schost (J. Symb. Comput., 2016)

Explicit isogenies in quadratic time in any characteristic. - Luca De Feo; Cyril Hugounenq; Jérôme Plût; Éric Schost (LMS J. Comput. Math., 2016)

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. - Vincent Neiger; Hamid Rahkooy; Éric Schost (CASC, 2017)

Algorithms for Structured Linear Systems Solving and Their Implementation. - Seung Gyu Hyun; Romain Lebreton; Éric Schost (ISSAC, 2017)

Sparse Rational Univariate Representation. - Angelos Mantzaflaris; Éric Schost; Elias P. Tsigaridas (ISSAC, 2017)

Fast Computation of the Roots of Polynomials Over the Ring of Power Series. - Vincent Neiger; Johan Rosenkilde; Éric Schost (ISSAC, 2017)

A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. - Mohab Safey El Din; Éric Schost (J. ACM, 2017)

Computing minimal interpolation bases. - Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (J. Symb. Comput., 2017)

On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms. - Alin Bostan; Claude-Pierre Jeannerod; Christophe Mouilleron; Éric Schost (SIAM J. Matrix Anal. Appl., 2017)

On semiring complexity of Schur polynomials. - Sergey Fomin; Dima Grigoriev; Dorian Nogneng; Éric Schost (Comput. Complex., 2018)

Sparse FGLM using the block Wiedemann algorithm. - Seung Gyu Hyun; Vincent Neiger; Hamid Rahkooy; Éric Schost (ACM Commun. Comput. Algebra, 2018)

Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. - Mohab Safey El Din; Éric Schost (J. Symb. Comput., 2018)

On the evaluation of some sparse polynomials. - Dorian Nogneng; Éric Schost (Math. Comput., 2018)

Simultaneous Conversions with the Residue Number System Using Linear Algebra. - Javad Doliskani; Pascal Giorgi; Romain Lebreton; Éric Schost (ACM Trans. Math. Softw., 2018)

Quadratic-Time Algorithms for Normal Elements. - Mark Giesbrecht; Armin Jamshidpey; Éric Schost (ISSAC, 2019)

Change of Basis for m-primary Ideals in One and Two Variables. - Seung Gyu Hyun; Stephen Melczer; Éric Schost; Catherine St-Pierre (ISSAC, 2019)

Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. - Seung Gyu Hyun; Vincent Neiger; Éric Schost (ISSAC, 2019)

Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. - Yossef Musleh; Éric Schost (ISSAC, 2019)

Bit complexity for critical point computation in smooth and compact real hypersurfaces. - Jesse Elliott; Éric Schost (ACM Commun. Comput. Algebra, 2019)

Quadratic Probabilistic Algorithms for Normal Bases. - Mark Giesbrecht; Armin Jamshidpey; Éric Schost (CoRR, 2019)

Computing isomorphisms and embeddings of finite fields. - Ludovic Brieulle; Luca De Feo; Javad Doliskani; Jean-Pierre Flori; Éric Schost (Math. Comput., 2019)

On the bit complexity of finding points in connected components of a smooth real hypersurface. - Jesse Elliott; Mark Giesbrecht; Éric Schost (ISSAC, 2020)

Sparse multiplication for skew polynomials. - Mark Giesbrecht; Qiao-Long Huang; Éric Schost (ISSAC, 2020)

Connectivity in Semi-Algebraic Sets I. - Hoon Hong; James Rohal; Mohab Safey El Din; Éric Schost (CoRR, 2020)

Computing syzygies in finite dimension using fast linear algebra. - Vincent Neiger; Éric Schost (J. Complex., 2020)

Block-Krylov techniques in the context of sparse-FGLM algorithms. - Seung Gyu Hyun; Vincent Neiger; Hamid Rahkooy; Éric Schost (J. Symb. Comput., 2020)

Sparse Multiplication of Multivariate Linear Differential Operators. - Mark Giesbrecht; Qiao-Long Huang; Éric Schost (ISSAC, 2021)

Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. - Seung Gyu Hyun; Vincent Neiger; Éric Schost (ISSAC, 2021)

Subquadratic-Time Algorithms for Normal Bases. - Mark Giesbrecht; Armin Jamshidpey; Éric Schost (Comput. Complex., 2021)

Homotopy techniques for solving sparse column support determinantal polynomial systems. - George Labahn; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Complex., 2021)

Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. - Javad Doliskani; Anand Kumar Narayanan; Éric Schost (J. Symb. Comput., 2021)

Solving determinantal systems using homotopy techniques. - Jonathan D. Hauenstein; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Symb. Comput., 2021)

Foreword. - Manuel Kauers; Alexey Ovchinnikov; Éric Schost (J. Symb. Comput., 2021)

Faster real root decision algorithm for symmetric polynomials. - George Labahn; Cordian Riener; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (ISSAC, 2023)

Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. - Yossef Musleh; Éric Schost (ISSAC, 2023)

p-adic algorithm for bivariate Gröbner bases. - Éric Schost; Catherine St-Pierre (ISSAC, 2023)

Newton iteration for lexicographic Gröbner bases in two variables. - Éric Schost; Catherine St-Pierre (CoRR, 2023)

Bit complexity for computing one point in each connected component of a smooth real algebraic set. - Jesse Elliott; Mark Giesbrecht; Éric Schost (J. Symb. Comput., 2023)

Computing critical points for invariant algebraic systems. - Jean-Charles Faugère; George Labahn; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Symb. Comput., 2023)

Some applications of Chinese Remainder Theorem codes with error-correction. - Jesse Elliott; Éric Schost (SCSS (Work in Progress), 2024)

Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity. - Rémi Prébet; Mohab Safey El Din; Éric Schost (CoRR, 2024)

Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results. - Rémi Prébet; Mohab Safey El Din; Éric Schost (J. Symb. Comput., 2024)

Faster Modular Composition. - Vincent Neiger; Bruno Salvy; Éric Schost; Gilles Villard (J. ACM, 2024)

An m-adic algorithm for bivariate Gröbner bases. - Éric Schost; Catherine St-Pierre (J. Symb. Comput., 2025)

A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case. - Benjamin Hackl; Andrew Luo; Stephen Melczer; Éric Schost (CoRR, 2025)