Éric Schost

Orcid: 0000-0002-8638-9357

According to our database1, Éric Schost authored at least 130 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results.
J. Symb. Comput., 2024

Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity.
CoRR, 2024

2023
Computing critical points for invariant algebraic systems.
J. Symb. Comput., 2023

Bit complexity for computing one point in each connected component of a smooth real algebraic set.
J. Symb. Comput., 2023

Newton iteration for lexicographic Gröbner bases in two variables.
CoRR, 2023

p-adic algorithm for bivariate Gröbner bases.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Faster real root decision algorithm for symmetric polynomials.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2021
Foreword.
J. Symb. Comput., 2021

Solving determinantal systems using homotopy techniques.
J. Symb. Comput., 2021

Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields.
J. Symb. Comput., 2021

Homotopy techniques for solving sparse column support determinantal polynomial systems.
J. Complex., 2021

Faster Modular Composition.
CoRR, 2021

Subquadratic-Time Algorithms for Normal Bases.
Comput. Complex., 2021

Algorithms for Linearly Recurrent Sequences of Truncated Polynomials.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Sparse Multiplication of Multivariate Linear Differential Operators.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Block-Krylov techniques in the context of sparse-FGLM algorithms.
J. Symb. Comput., 2020

Computing syzygies in finite dimension using fast linear algebra.
J. Complex., 2020

Connectivity in Semi-Algebraic Sets I.
CoRR, 2020

Sparse multiplication for skew polynomials.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

On the bit complexity of finding points in connected components of a smooth real hypersurface.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019
Quadratic Probabilistic Algorithms for Normal Bases.
CoRR, 2019

Bit complexity for critical point computation in smooth and compact real hypersurfaces.
ACM Commun. Comput. Algebra, 2019

Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Change of Basis for m-primary Ideals in One and Two Variables.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Quadratic-Time Algorithms for Normal Elements.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Simultaneous Conversions with the Residue Number System Using Linear Algebra.
ACM Trans. Math. Softw., 2018

On the evaluation of some sparse polynomials.
Math. Comput., 2018

Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization.
J. Symb. Comput., 2018

Sparse FGLM using the block Wiedemann algorithm.
ACM Commun. Comput. Algebra, 2018

Computing isomorphisms and embeddings of finite fields.
ACM Commun. Comput. Algebra, 2018

On semiring complexity of Schur polynomials.
Comput. Complex., 2018

2017
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms.
SIAM J. Matrix Anal. Appl., 2017

Computing minimal interpolation bases.
J. Symb. Comput., 2017

A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets.
J. ACM, 2017

Fast Computation of the Roots of Polynomials Over the Ring of Power Series.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Sparse Rational Univariate Representation.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Algorithms for Structured Linear Systems Solving and Their Implementation.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences.
Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017

2016
Explicit isogenies in quadratic time in any characteristic.
LMS J. Comput. Math., 2016

A simple and fast online power series multiplication and its analysis.
J. Symb. Comput., 2016

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers.
J. Complex., 2016

A Quadratically Convergent Algorithm for Structured Low-Rank Approximation.
Found. Comput. Math., 2016

A Fast Algorithm for Computing the Truncated Resultant.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Computation of the Similarity Class of the p-Curvature.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations.
IEEE Trans. Inf. Theory, 2015

Computing in degree 2<sup>k</sup>-extensions of finite fields of odd characteristic.
Des. Codes Cryptogr., 2015

Algorithms for Finite Field Arithmetic.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

A Fast Algorithm for Computing the P-curvature.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve.
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014
Taking roots over high extensions of finite fields.
Math. Comput., 2014

A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets.
Found. Comput. Math., 2014

A Truncated Fourier Transform middle product.
ACM Commun. Comput. Algebra, 2014

Fast arithmetic for the algebraic closure of finite fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

A fast algorithm for computing the characteristic polynomial of the p-curvature.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Doing Algebraic Geometry with the RegularChains Library.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
On the complexity of computing with zero-dimensional triangular sets.
J. Symb. Comput., 2013

Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011.
J. Symb. Comput., 2013

Fast algorithms for ell-adic towers over finite fields
CoRR, 2013

Newton-like iteration for determinantal systems and structured low rank approximation.
ACM Commun. Comput. Algebra, 2013

Modular Composition Modulo Triangular Sets and Applications.
Comput. Complex., 2013

Multi-point evaluation in higher dimensions.
Appl. Algebra Eng. Commun. Comput., 2013

On the complexity of solving bivariate systems: the case of non-singular solutions.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Structured FFT and TFT: symmetric and lattice polynomials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Fast algorithms for <i>l</i>-adic towers over finite fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Genus 2 point counting over prime fields.
J. Symb. Comput., 2012

Fast arithmetics in Artin-Schreier towers over finite fields.
J. Symb. Comput., 2012

Bit-size estimates for triangular sets in positive dimension.
J. Complex., 2012

On the complexity of computing certain resultants.
ACM Commun. Comput. Algebra, 2012

Algorithms for the universal decomposition algebra.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Power series solutions of singular (q)-differential equations.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Inversion Modulo Zero-Dimensional Regular Chains.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011
Homotopy techniques for multiplication modulo triangular sets.
J. Symb. Comput., 2011

A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface.
Discret. Comput. Geom., 2011

2010
transalpyne: a language for automatic transposition.
ACM Commun. Comput. Algebra, 2010

Optimization techniques for small matrix multiplication.
ACM Commun. Comput. Algebra, 2010

Almost linear time operations with triangular sets.
ACM Commun. Comput. Algebra, 2010

Complexity and performance results for non FFT-based univariate polynomial multiplication.
ACM Commun. Comput. Algebra, 2010

On the geometry of polar varieties.
Appl. Algebra Eng. Commun. Comput., 2010

2009
Interpolation of polynomials given by straight-line programs.
Theor. Comput. Sci., 2009

Fast arithmetic for triangular sets: From theory to practice.
J. Symb. Comput., 2009

Evaluation properties of invariant polynomials.
J. Symb. Comput., 2009

A simple and fast algorithm for computing exponentials of power series.
Inf. Process. Lett., 2009

A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces
CoRR, 2009

Homotopy methods for multiplication modulo triangular sets
CoRR, 2009

Fast algorithms for differential equations in positive characteristic.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Code Generation for Polynomial Multiplication.
Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

2008
Change of order for regular chains in positive dimension.
Theor. Comput. Sci., 2008

Fast algorithms for computing isogenies between elliptic curves.
Math. Comput., 2008

Fast Conversion Algorithms for Orthogonal Polynomials
CoRR, 2008

The modpn library: bringing fast polynomial arithmetic into MAPLE.
ACM Commun. Comput. Algebra, 2008

Subquadratic Polynomial Multiplication over <i>GF</i>(2<sup><i>m</i></sup>) Using Trinomial Bases and Chinese Remaindering.
Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, 2008

Power series composition and change of basis.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment.
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

2007
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator.
SIAM J. Comput., 2007

Fast computation of power series solutions of systems of differential equations.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Solving toeplitz- and vandermonde-like linear systems with large displacement rank.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Differential equations for algebraic functions.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

On the Virtues of Generic Programming for Symbolic Computation.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006
Fast computation of special resultants.
J. Symb. Comput., 2006

Evaluation Properties of Symmetric Polynomials.
Int. J. Algebra Comput., 2006

Solving structured linear systems of large displacement rank.
ACM Commun. Comput. Algebra, 2006

Change of order for bivariate triangular sets.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Implementation techniques for fast polynomial arithmetic in a high-level programming environment.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Using fast matrix multiplication to solve structured linear systems.
Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005
There is no efficient reverse derivation mode for discrete derivatives.
Theor. Comput. Sci., 2005

Modular equations for hyperelliptic curves.
Math. Comput., 2005

Polynomial evaluation and interpolation on special sets of points.
J. Complex., 2005

On the complexity of the D5 principle.
SIGSAM Bull., 2005

Multivariate power series multiplication.
Proceedings of the Symbolic and Algebraic Computation, 2005

Lifting techniques for triangular decompositions.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
On the complexities of multipoint evaluation and interpolation.
Theor. Comput. Sci., 2004

Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set.
Discret. Comput. Geom., 2004

Sharp estimates for triangular sets.
Proceedings of the Symbolic and Algebraic Computation, 2004

Complexity issues in bivariate polynomial factorization.
Proceedings of the Symbolic and Algebraic Computation, 2004

Construction of Secure Random Curves of Genus 2 over Prime Fields.
Proceedings of the Advances in Cryptology, 2004

A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Complexity results for triangular sets.
J. Symb. Comput., 2003

Computing Parametric Geometric Resolutions.
Appl. Algebra Eng. Commun. Comput., 2003

Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality.
Appl. Algebra Eng. Commun. Comput., 2003

Polar varieties and computation of one point in each connected component of a smooth real algebraic set.
Proceedings of the Symbolic and Algebraic Computation, 2003

Tellegen's principle into practice.
Proceedings of the Symbolic and Algebraic Computation, 2003

Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves.
Proceedings of the Finite Fields and Applications, 2003

2002
Degree bounds and lifting techniques for triangular sets.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2.
Proceedings of the Applied Algebra, 2001

2000
Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study.
Proceedings of the Automated Deduction in Geometry, Third International Workshop, 2000

1999
Solving Some Overdetermined Polynomial Systems.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999


  Loading...