Éric Schost

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 74

Top Venues

CoRR

ISSAC

J. Symb. Comput.

ACM Commun. Comput. Algebra

Publications

Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard
Faster Modular Composition. J. ACM 71 (2) (2024)
Rémi Prébet, Mohab Safey El Din, Éric Schost
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity. CoRR (2024)
Rémi Prébet, Mohab Safey El Din, Éric Schost
Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results. J. Symb. Comput. 120 (2024)
Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Computing critical points for invariant algebraic systems. J. Symb. Comput. 116 (2023)
Yossef Musleh, Éric Schost
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. CoRR (2023)
Éric Schost, Catherine St-Pierre
p-adic algorithm for bivariate Gröbner bases. ISSAC (2023)
Éric Schost, Catherine St-Pierre
p-adic algorithm for bivariate Gröbner bases. CoRR (2023)
George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Faster real root decision algorithm for symmetric polynomials. ISSAC (2023)
Jesse Elliott, Mark Giesbrecht, Éric Schost
Bit complexity for computing one point in each connected component of a smooth real algebraic set. J. Symb. Comput. 116 (2023)
George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Faster real root decision algorithm for symmetric polynomials. CoRR (2023)
Éric Schost, Catherine St-Pierre
Newton iteration for lexicographic Gröbner bases in two variables. CoRR (2023)
Yossef Musleh, Éric Schost
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. ISSAC (2023)
Jesse Elliott, Mark Giesbrecht, Éric Schost
Bit complexity for computing one point in each connected component of a smooth real algebraic set. CoRR (2022)
Rémi Prébet, Mohab Safey El Din, Éric Schost
Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results. CoRR (2022)
Mark Giesbrecht, Qiao-Long Huang, Éric Schost
Sparse Multiplication of Multivariate Linear Differential Operators. ISSAC (2021)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Subquadratic-Time Algorithms for Normal Bases. Comput. Complex. 30 (1) (2021)
Seung Gyu Hyun, Vincent Neiger, Éric Schost
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. ISSAC (2021)
George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. 66 (2021)
Manuel Kauers, Alexey Ovchinnikov, Éric Schost
Foreword. J. Symb. Comput. 102 (2021)
Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard
Faster Modular Composition. CoRR (2021)
Javad Doliskani, Anand Kumar Narayanan, Éric Schost
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. J. Symb. Comput. 105 (2021)
Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Solving determinantal systems using homotopy techniques. J. Symb. Comput. 104 (2021)
Seung Gyu Hyun, Vincent Neiger, Éric Schost
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. CoRR (2021)
Jesse Elliott, Mark Giesbrecht, Éric Schost
On the bit complexity of finding points in connected components of a smooth real hypersurface. ISSAC (2020)
Mark Giesbrecht, Qiao-Long Huang, Éric Schost
Sparse multiplication for skew polynomials. ISSAC (2020)
Vincent Neiger, Éric Schost
Computing syzygies in finite dimension using fast linear algebra. J. Complex. 60 (2020)
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost
Block-Krylov techniques in the context of sparse-FGLM algorithms. J. Symb. Comput. 98 (2020)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Subquadratic-Time Algorithms for Normal Bases. CoRR (2020)
Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Computing critical points for invariant algebraic systems. CoRR (2020)
George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR (2020)
Hoon Hong, James Rohal, Mohab Safey El Din, Éric Schost
Connectivity in Semi-Algebraic Sets I. CoRR (2020)
Vincent Neiger, Éric Schost
Computing syzygies in finite dimension using fast linear algebra. CoRR (2019)
Seung Gyu Hyun, Vincent Neiger, Éric Schost
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. CoRR (2019)
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost
Computing isomorphisms and embeddings of finite fields. Math. Comput. 88 (317) (2019)
Seung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine St-Pierre
Change of Basis for m-primary Ideals in One and Two Variables. ISSAC (2019)
Jesse Elliott, Éric Schost
Bit complexity for critical point computation in smooth and compact real hypersurfaces. ACM Commun. Comput. Algebra 53 (3) (2019)
Seung Gyu Hyun, Vincent Neiger, Éric Schost
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. ISSAC (2019)
Yossef Musleh, Éric Schost
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. ISSAC (2019)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Quadratic-Time Algorithms for Normal Elements. ISSAC (2019)
Seung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine St-Pierre
Change of basis for m-primary ideals in one and two variables. CoRR (2019)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Quadratic Probabilistic Algorithms for Normal Bases. CoRR (2019)
Yossef Musleh, Éric Schost
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. CoRR (2019)
Mohab Safey El Din, Éric Schost
Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. J. Symb. Comput. 87 (2018)
Javad Doliskani, Pascal Giorgi, Romain Lebreton, Éric Schost
Simultaneous Conversions with the Residue Number System Using Linear Algebra. ACM Trans. Math. Softw. 44 (3) (2018)
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost
Computing isomorphisms and embeddings of finite fields. ACM Commun. Comput. Algebra 52 (4) (2018)
Dorian Nogneng, Éric Schost
On the evaluation of some sparse polynomials. Math. Comput. 87 (310) (2018)
Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost
On semiring complexity of Schur polynomials. Comput. Complex. 27 (4) (2018)
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost
Sparse FGLM using the block Wiedemann algorithm. ACM Commun. Comput. Algebra 52 (4) (2018)
Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Solving determinantal systems using homotopy techniques. CoRR (2018)
Seung Gyu Hyun, Romain Lebreton, Éric Schost
Algorithms for Structured Linear Systems Solving and Their Implementation. ISSAC (2017)
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
Computing minimal interpolation bases. J. Symb. Comput. 83 (2017)
Javad Doliskani, Anand Kumar Narayanan, Éric Schost
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields. CoRR (2017)
Angelos Mantzaflaris, Éric Schost, Elias P. Tsigaridas
Sparse Rational Univariate Representation. ISSAC (2017)
Vincent Neiger, Hamid Rahkooy, Éric Schost
Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. CASC (2017)
Vincent Neiger, Johan Rosenkilde, Éric Schost
Fast Computation of the Roots of Polynomials Over the Ring of Power Series. CoRR (2017)
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost
Computing isomorphisms and embeddings of finite fields. CoRR (2017)
Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms. SIAM J. Matrix Anal. Appl. 38 (3) (2017)
Vincent Neiger, Hamid Rahkooy, Éric Schost
Algorithms for zero-dimensional ideals using linear recurrent sequences. CoRR (2017)
Mohab Safey El Din, Éric Schost
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. J. ACM 63 (6) (2017)
Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost
On matrices with displacement structure: generalized operators and faster algorithms. CoRR (2017)
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost
Block-Krylov techniques in the context of sparse-FGLM algorithms. CoRR (2017)
Vincent Neiger, Johan Rosenkilde, Éric Schost
Fast Computation of the Roots of Polynomials Over the Ring of Power Series. ISSAC (2017)
Alin Bostan, Xavier Caruso, Éric Schost
Computation of the Similarity Class of the p-Curvature. CoRR (2016)
Romain Lebreton, Éric Schost
A simple and fast online power series multiplication and its analysis. J. Symb. Comput. 72 (2016)
Guillaume Moroz, Éric Schost
A Fast Algorithm for Computing the Truncated Resultant. CoRR (2016)
Alin Bostan, Xavier Caruso, Éric Schost
Computation of the Similarity Class of the p-Curvature. ISSAC (2016)
Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost
On semiring complexity of Schur polynomials. CoRR (2016)
Éric Schost, Pierre-Jean Spaenlehauer
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. Found. Comput. Math. 16 (2) (2016)
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. CoRR (2016)
Esmaeil Mehrabi, Éric Schost
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers. J. Complex. 34 (2016)
Guillaume Moroz, Éric Schost
A Fast Algorithm for Computing the Truncated Resultant. ISSAC (2016)
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. ISSAC (2016)
Luca De Feo, Cyril Hugounenq, Jérôme Plût, Éric Schost
Explicit isogenies in quadratic time in any characteristic. LMS J. Comput. Math. 19 (A) (2016)
Mohab Safey El Din, Éric Schost
Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization. CoRR (2016)
Parisa Alvandi, Marc Moreno Maza, Éric Schost, Paul Vrbik
A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve. CASC (2015)
Alin Bostan, Xavier Caruso, Éric Schost
A Fast Algorithm for Computing the P-curvature. ISSAC (2015)
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
Computing minimal interpolation bases. CoRR (2015)
Alin Bostan, Xavier Caruso, Éric Schost
A Fast Algorithm for Computing the p-Curvature. CoRR (2015)
Éric Schost
Algorithms for Finite Field Arithmetic. ISSAC (2015)
Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations. IEEE Trans. Inf. Theory 61 (5) (2015)
Javad Doliskani, Éric Schost
-extensions of finite fields of odd characteristic. Des. Codes Cryptogr. 74 (3) (2015)
Javad Doliskani, Éric Schost
Taking roots over high extensions of finite fields. Math. Comput. 83 (285) (2014)
Luca De Feo, Javad Doliskani, Éric Schost
Fast arithmetic for the algebraic closure of finite fields. ISSAC (2014)
Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations. CoRR (2014)
Alin Bostan, Xavier Caruso, Éric Schost
A fast algorithm for computing the characteristic polynomial of the p-curvature. ISSAC (2014)
Alin Bostan, Xavier Caruso, Éric Schost
A fast algorithm for computing the characteristic polynomial of the p-curvature. CoRR (2014)
Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost
A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. Found. Comput. Math. 14 (6) (2014)
Andrew Arnold, Éric Schost
A Truncated Fourier Transform middle product. ACM Commun. Comput. Algebra 48 (3/4) (2014)
Parisa Alvandi, Changbo Chen, Steffen Marcus, Marc Moreno Maza, Éric Schost, Paul Vrbik
Doing Algebraic Geometry with the RegularChains Library. ICMS (2014)
Éric Schost, Pierre-Jean Spaenlehauer
Newton-like iteration for determinantal systems and structured low rank approximation. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Luca De Feo, Javad Doliskani, Éric Schost
-adic towers over finite fields. ISSAC (2013)
Alin Bostan, Éric Schost
A simple and fast algorithm for computing exponentials of power series CoRR (2013)
Adrien Poteaux, Éric Schost
On the complexity of computing with zero-dimensional triangular sets. J. Symb. Comput. 50 (2013)
Ioannis Z. Emiris, Éric Schost
Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011. J. Symb. Comput. 52 (2013)
Éric Schost, Pierre-Jean Spaenlehauer
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. CoRR (2013)
Adrien Poteaux, Éric Schost
Modular Composition Modulo Triangular Sets and Applications. Comput. Complex. 22 (3) (2013)
Joris van der Hoeven, Éric Schost
Multi-point evaluation in higher dimensions. Appl. Algebra Eng. Commun. Comput. 24 (1) (2013)
Luca De Feo, Javad Doliskani, Éric Schost
Fast algorithms for ell-adic towers over finite fields CoRR (2013)
Joris van der Hoeven, Romain Lebreton, Éric Schost
Structured FFT and TFT: symmetric and lattice polynomials. ISSAC (2013)
Romain Lebreton, Esmaeil Mehrabi, Éric Schost
On the complexity of solving bivariate systems: the case of non-singular solutions. ISSAC (2013)

Éric Schost.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Éric Schost