Éric Schost - RankMe

192 papers A* 2B 51Misc 1Journal 130Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity. J. Symb. Comput. Rémi Prébet, Mohab Safey El Din, Éric Schost
2026	J	`jnl`	Faster modular composition using two relation matrices. CoRR Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard
2026	J	`jnl`	Hilbert's Nullstellensatz is in the Counting Hierarchy. CoRR Robert Andrews, Abhibhav Garg, Éric Schost
2026	J	`jnl`	Hilbert's Nullstellensatz is in the Counting Hierarchy. Electron. Colloquium Comput. Complex. Robert Andrews, Abhibhav Garg, Éric Schost
2025	J	`jnl`	A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case. CoRR Benjamin Hackl, Andrew Luo, Stephen Melczer, Éric Schost
2025	J	`jnl`	An m-adic algorithm for bivariate Gröbner bases. J. Symb. Comput. Éric Schost, Catherine St-Pierre
2025	J	`jnl`	Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set. CoRR Jesse Elliott, Mark Giesbrecht, Edern Gillot, Mohab Safey El Din, Éric Schost
2025	B	`conf`	Some Applications of Chinese Remainder Theorem Codes with Error-Correction. ISSAC Éric Schost, Jesse Elliott
2024	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results. J. Symb. Comput. Rémi Prébet, Mohab Safey El Din, Éric Schost
2024	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity. CoRR Rémi Prébet, Mohab Safey El Din, Éric Schost
2024	J	`jnl`	Faster Modular Composition. J. ACM Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard
2024	—	`conf`	Some applications of Chinese Remainder Theorem codes with error-correction. SCSS (Work in Progress) Jesse Elliott, Éric Schost
2023	J	`jnl`	Bit complexity for computing one point in each connected component of a smooth real algebraic set. J. Symb. Comput. Jesse Elliott, Mark Giesbrecht, Éric Schost
2023	J	`jnl`	Computing critical points for invariant algebraic systems. J. Symb. Comput. Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2023	B	`conf`	Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. ISSAC Yossef Musleh, Éric Schost
2023	J	`jnl`	Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. CoRR Yossef Musleh, Éric Schost
2023	B	`conf`	Faster real root decision algorithm for symmetric polynomials. ISSAC George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2023	J	`jnl`	Faster real root decision algorithm for symmetric polynomials. CoRR George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2023	J	`jnl`	Newton iteration for lexicographic Gröbner bases in two variables. CoRR Éric Schost, Catherine St-Pierre
2023	B	`conf`	p-adic algorithm for bivariate Gröbner bases. ISSAC Éric Schost, Catherine St-Pierre
2023	J	`jnl`	p-adic algorithm for bivariate Gröbner bases. CoRR Éric Schost, Catherine St-Pierre
2022	J	`jnl`	Bit complexity for computing one point in each connected component of a smooth real algebraic set. CoRR Jesse Elliott, Mark Giesbrecht, Éric Schost
2022	J	`jnl`	Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results. CoRR Rémi Prébet, Mohab Safey El Din, Éric Schost
2021	B	`conf`	Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. ISSAC Seung Gyu Hyun, Vincent Neiger, Éric Schost
2021	J	`jnl`	Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. CoRR Seung Gyu Hyun, Vincent Neiger, Éric Schost
2021	J	`jnl`	Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. J. Symb. Comput. Javad Doliskani, Anand Kumar Narayanan, Éric Schost
2021	J	`jnl`	Faster Modular Composition. CoRR Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard
2021	J	`jnl`	Foreword. J. Symb. Comput. Manuel Kauers, Alexey Ovchinnikov, Éric Schost
2021	J	`jnl`	Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2021	J	`jnl`	Solving determinantal systems using homotopy techniques. J. Symb. Comput. Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2021	B	`conf`	Sparse Multiplication of Multivariate Linear Differential Operators. ISSAC Mark Giesbrecht, Qiao-Long Huang, Éric Schost
2021	J	`jnl`	Subquadratic-Time Algorithms for Normal Bases. Comput. Complex. Mark Giesbrecht, Armin Jamshidpey, Éric Schost
2020	J	`jnl`	Block-Krylov techniques in the context of sparse-FGLM algorithms. J. Symb. Comput. Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost
2020	J	`jnl`	Computing critical points for invariant algebraic systems. CoRR Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2020	J	`jnl`	Computing syzygies in finite dimension using fast linear algebra. J. Complex. Vincent Neiger, Éric Schost
2020	J	`jnl`	Connectivity in Semi-Algebraic Sets I. CoRR Hoon Hong, James Rohal, Mohab Safey El Din, Éric Schost
2020	J	`jnl`	Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2020	B	`conf`	On the bit complexity of finding points in connected components of a smooth real hypersurface. ISSAC Jesse Elliott, Mark Giesbrecht, Éric Schost
2020	B	`conf`	Sparse multiplication for skew polynomials. ISSAC Mark Giesbrecht, Qiao-Long Huang, Éric Schost
2020	J	`jnl`	Subquadratic-Time Algorithms for Normal Bases. CoRR Mark Giesbrecht, Armin Jamshidpey, Éric Schost
2019	J	`jnl`	Bit complexity for critical point computation in smooth and compact real hypersurfaces. ACM Commun. Comput. Algebra Jesse Elliott, Éric Schost
2019	B	`conf`	Change of Basis for m-primary Ideals in One and Two Variables. ISSAC Seung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine St-Pierre
2019	J	`jnl`	Change of basis for m-primary ideals in one and two variables. CoRR Seung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine St-Pierre
2019	J	`jnl`	Computing isomorphisms and embeddings of finite fields. Math. Comput. Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost
2019	J	`jnl`	Computing syzygies in finite dimension using fast linear algebra. CoRR Vincent Neiger, Éric Schost
2019	B	`conf`	Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. ISSAC Yossef Musleh, Éric Schost
2019	J	`jnl`	Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. CoRR Yossef Musleh, Éric Schost
2019	B	`conf`	Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. ISSAC Seung Gyu Hyun, Vincent Neiger, Éric Schost
2019	J	`jnl`	Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. CoRR Seung Gyu Hyun, Vincent Neiger, Éric Schost
2019	J	`jnl`	Quadratic Probabilistic Algorithms for Normal Bases. CoRR Mark Giesbrecht, Armin Jamshidpey, Éric Schost
2019	B	`conf`	Quadratic-Time Algorithms for Normal Elements. ISSAC Mark Giesbrecht, Armin Jamshidpey, Éric Schost
2018	J	`jnl`	Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. J. Symb. Comput. Mohab Safey El Din, Éric Schost
2018	J	`jnl`	Computing isomorphisms and embeddings of finite fields. ACM Commun. Comput. Algebra Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost
2018	J	`jnl`	On semiring complexity of Schur polynomials. Comput. Complex. Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost
2018	J	`jnl`	On the evaluation of some sparse polynomials. Math. Comput. Dorian Nogneng, Éric Schost
2018	B	`ed.`	Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018 ISSAC Manuel Kauers, Alexey Ovchinnikov, Éric Schost
2018	J	`jnl`	Simultaneous Conversions with the Residue Number System Using Linear Algebra. ACM Trans. Math. Softw. Javad Doliskani, Pascal Giorgi, Romain Lebreton, Éric Schost
2018	J	`jnl`	Solving determinantal systems using homotopy techniques. CoRR Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2018	J	`jnl`	Sparse FGLM using the block Wiedemann algorithm. ACM Commun. Comput. Algebra Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost
2017	J	`jnl`	A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. J. ACM Mohab Safey El Din, Éric Schost
2017	B	`conf`	Algorithms for Structured Linear Systems Solving and Their Implementation. ISSAC Seung Gyu Hyun, Romain Lebreton, Éric Schost
2017	B	`conf`	Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. CASC Vincent Neiger, Hamid Rahkooy, Éric Schost
2017	J	`jnl`	Algorithms for zero-dimensional ideals using linear recurrent sequences. CoRR Vincent Neiger, Hamid Rahkooy, Éric Schost
2017	J	`jnl`	Block-Krylov techniques in the context of sparse-FGLM algorithms. CoRR Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost
2017	J	`jnl`	Computing isomorphisms and embeddings of finite fields. CoRR Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost
2017	J	`jnl`	Computing minimal interpolation bases. J. Symb. Comput. Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
2017	J	`jnl`	Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields. CoRR Javad Doliskani, Anand Kumar Narayanan, Éric Schost
2017	B	`conf`	Fast Computation of the Roots of Polynomials Over the Ring of Power Series. ISSAC Vincent Neiger, Johan Rosenkilde, Éric Schost
2017	J	`jnl`	Fast Computation of the Roots of Polynomials Over the Ring of Power Series. CoRR Vincent Neiger, Johan Rosenkilde, Éric Schost
2017	J	`jnl`	On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms. SIAM J. Matrix Anal. Appl. Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost
2017	J	`jnl`	On matrices with displacement structure: generalized operators and faster algorithms. CoRR Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost
2017	B	`conf`	Sparse Rational Univariate Representation. ISSAC Angelos Mantzaflaris, Éric Schost, Elias P. Tsigaridas
2016	B	`conf`	A Fast Algorithm for Computing the Truncated Resultant. ISSAC Guillaume Moroz, Éric Schost
2016	J	`jnl`	A Fast Algorithm for Computing the Truncated Resultant. CoRR Guillaume Moroz, Éric Schost
2016	J	`jnl`	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. Found. Comput. Math. Éric Schost, Pierre-Jean Spaenlehauer
2016	J	`jnl`	A simple and fast online power series multiplication and its analysis. J. Symb. Comput. Romain Lebreton, Éric Schost
2016	J	`jnl`	A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers. J. Complex. Esmaeil Mehrabi, Éric Schost
2016	J	`jnl`	Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization. CoRR Mohab Safey El Din, Éric Schost
2016	B	`conf`	Computation of the Similarity Class of the p-Curvature. ISSAC Alin Bostan, Xavier Caruso, Éric Schost
2016	J	`jnl`	Computation of the Similarity Class of the p-Curvature. CoRR Alin Bostan, Xavier Caruso, Éric Schost
2016	J	`jnl`	Explicit isogenies in quadratic time in any characteristic. LMS J. Comput. Math. Luca De Feo, Cyril Hugounenq, Jérôme Plût, Éric Schost
2016	B	`conf`	Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. ISSAC Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
2016	J	`jnl`	Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. CoRR Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
2016	J	`jnl`	On semiring complexity of Schur polynomials. CoRR Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost
2015	B	`conf`	A Fast Algorithm for Computing the P-curvature. ISSAC Alin Bostan, Xavier Caruso, Éric Schost
2015	J	`jnl`	A Fast Algorithm for Computing the p-Curvature. CoRR Alin Bostan, Xavier Caruso, Éric Schost
2015	B	`conf`	A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve. CASC Parisa Alvandi, Marc Moreno Maza, Éric Schost, Paul Vrbik
2015	B	`conf`	Algorithms for Finite Field Arithmetic. ISSAC Éric Schost
2015	J	`jnl`	Computing in degree 2 Des. Codes Cryptogr. Javad Doliskani, Éric Schost
2015	J	`jnl`	Computing minimal interpolation bases. CoRR Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
2015	J	`jnl`	Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations. IEEE Trans. Inf. Theory Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
2014	J	`jnl`	A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. Found. Comput. Math. Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost
2014	J	`jnl`	A Truncated Fourier Transform middle product. ACM Commun. Comput. Algebra Andrew Arnold, Éric Schost
2014	B	`conf`	A fast algorithm for computing the characteristic polynomial of the p-curvature. ISSAC Alin Bostan, Xavier Caruso, Éric Schost
2014	J	`jnl`	A fast algorithm for computing the characteristic polynomial of the p-curvature. CoRR Alin Bostan, Xavier Caruso, Éric Schost
2014	—	`conf`	Doing Algebraic Geometry with the RegularChains Library. ICMS Parisa Alvandi, Changbo Chen, Steffen Marcus, Marc Moreno Maza, Éric Schost, Paul Vrbik
2014	B	`conf`	Fast arithmetic for the algebraic closure of finite fields. ISSAC Luca De Feo, Javad Doliskani, Éric Schost
2014	J	`jnl`	Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations. CoRR Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard
2014	J	`jnl`	Taking roots over high extensions of finite fields. Math. Comput. Javad Doliskani, Éric Schost
2013	J	`jnl`	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. CoRR Éric Schost, Pierre-Jean Spaenlehauer
2013	J	`jnl`	A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. CoRR Mohab Safey El Din, Éric Schost
2013	J	`jnl`	A simple and fast algorithm for computing exponentials of power series CoRR Alin Bostan, Éric Schost
2013	B	`conf`	Fast algorithms for ISSAC Luca De Feo, Javad Doliskani, Éric Schost
2013	J	`jnl`	Fast algorithms for ell-adic towers over finite fields CoRR Luca De Feo, Javad Doliskani, Éric Schost
2013	J	`jnl`	Modular Composition Modulo Triangular Sets and Applications. Comput. Complex. Adrien Poteaux, Éric Schost
2013	J	`jnl`	Multi-point evaluation in higher dimensions. Appl. Algebra Eng. Commun. Comput. Joris van der Hoeven, Éric Schost
2013	J	`jnl`	Newton-like iteration for determinantal systems and structured low rank approximation. ACM Commun. Comput. Algebra Éric Schost, Pierre-Jean Spaenlehauer
2013	J	`jnl`	On the complexity of computing with zero-dimensional triangular sets. J. Symb. Comput. Adrien Poteaux, Éric Schost
2013	B	`conf`	On the complexity of solving bivariate systems: the case of non-singular solutions. ISSAC Romain Lebreton, Esmaeil Mehrabi, Éric Schost
2013	J	`jnl`	Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011. J. Symb. Comput. Ioannis Z. Emiris, Éric Schost
2013	B	`conf`	Structured FFT and TFT: symmetric and lattice polynomials. ISSAC Joris van der Hoeven, Romain Lebreton, Éric Schost
2012	J	`jnl`	A baby step-giant step roadmap algorithm for general algebraic sets CoRR Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost
2012	B	`conf`	Algorithms for the universal decomposition algebra. ISSAC Romain Lebreton, Éric Schost
2012	J	`jnl`	Bit-size estimates for triangular sets in positive dimension. J. Complex. Xavier Dahan, Abdulilah Kadri, Éric Schost
2012	J	`jnl`	Fast arithmetics in Artin-Schreier towers over finite fields. J. Symb. Comput. Luca De Feo, Éric Schost
2012	J	`jnl`	Genus 2 point counting over prime fields. J. Symb. Comput. Pierrick Gaudry, Éric Schost
2012	B	`conf`	Inversion Modulo Zero-Dimensional Regular Chains. CASC Marc Moreno Maza, Éric Schost, Paul Vrbik
2012	J	`jnl`	On the complexity of computing certain resultants. ACM Commun. Comput. Algebra Romain Lebreton, Esmaeil Mehrabi, Éric Schost
2012	J	`jnl`	Power Series Solutions of Singular (q)-Differential Equations CoRR Alin Bostan, Muhammad F. I. Chowdhury, Romain Lebreton, Bruno Salvy, Éric Schost
2012	B	`conf`	Power series solutions of singular (q)-differential equations. ISSAC Alin Bostan, Bruno Salvy, Muhammad F. I. Chowdhury, Éric Schost, Romain Lebreton
2011	J	`jnl`	A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface. Discret. Comput. Geom. Mohab Safey El Din, Éric Schost
2011	J	`jnl`	Homotopy techniques for multiplication modulo triangular sets. J. Symb. Comput. Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost
2011	J	`jnl`	On the complexity of computing with zero-dimensional triangular sets CoRR Adrien Poteaux, Éric Schost
2011	J	`jnl`	Optimization techniques for small matrix multiplication. Theor. Comput. Sci. Charles-Éric Drevet, Md. Nazrul Islam, Éric Schost
2011	B	`ed.`	Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings ISSAC Éric Schost, Ioannis Z. Emiris
2011	J	`jnl`	Taking Roots over High Extensions of Finite Fields CoRR Javad Doliskani, Éric Schost
2011	J	`jnl`	The modpn library: Bringing fast polynomial arithmetic into Maple. J. Symb. Comput. Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Éric Schost
2010	J	`jnl`	Almost linear time operations with triangular sets. ACM Commun. Comput. Algebra Xavier Dahan, Marc Moreno Maza, Éric Schost, Adrien Poteaux
2010	J	`jnl`	Bit-size estimates for triangular sets in positive dimension CoRR Xavier Dahan, Abdulilah Kadri, Éric Schost
2010	J	`jnl`	Complexity and performance results for non FFT-based univariate polynomial multiplication. ACM Commun. Comput. Algebra Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, Éric Schost
2010	J	`jnl`	Fast Arithmetics in Artin-Schreier Towers over Finite Fields CoRR Luca De Feo, Éric Schost
2010	J	`jnl`	On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput. Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost
2010	J	`jnl`	Optimization techniques for small matrix multiplication. ACM Commun. Comput. Algebra Charles-Éric Drevet, Md. Nazrul Islam, Éric Schost
2010	J	`jnl`	transalpyne: a language for automatic transposition. ACM Commun. Comput. Algebra Luca De Feo, Éric Schost
2010	J	`jnl`	transalpyne: a language for automatic transposition. ACM Commun. Comput. Algebra Luca De Feo, Éric Schost
2009	J	`jnl`	A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces CoRR Mohab Safey El Din, Éric Schost
2009	J	`jnl`	A simple and fast algorithm for computing exponentials of power series. Inf. Process. Lett. Alin Bostan, Éric Schost
2009	B	`conf`	Code Generation for Polynomial Multiplication. CASC Ling Ding, Éric Schost
2009	J	`jnl`	Evaluation properties of invariant polynomials. J. Symb. Comput. Xavier Dahan, Éric Schost, Jie Wu
2009	J	`jnl`	Fast algorithms for differential equations in positive characteristic CoRR Alin Bostan, Éric Schost
2009	B	`conf`	Fast algorithms for differential equations in positive characteristic. ISSAC Alin Bostan, Éric Schost
2009	J	`jnl`	Fast arithmetic for triangular sets: From theory to practice. J. Symb. Comput. Xin Li, Marc Moreno Maza, Éric Schost
2009	B	`conf`	Fast arithmetics in artin-schreier towers over finite fields. ISSAC Luca De Feo, Éric Schost
2009	J	`jnl`	Homotopy methods for multiplication modulo triangular sets CoRR Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost
2009	J	`jnl`	Interpolation of polynomials given by straight-line programs. Theor. Comput. Sci. Sanchit Garg, Éric Schost
2008	J	`jnl`	Change of order for regular chains in positive dimension. Theor. Comput. Sci. Xavier Dahan, Xin Jin, Marc Moreno Maza, Éric Schost
2008	J	`jnl`	Fast Conversion Algorithms for Orthogonal Polynomials CoRR Alin Bostan, Bruno Salvy, Éric Schost
2008	J	`jnl`	Fast algorithms for computing isogenies between elliptic curves. Math. Comput. Alin Bostan, François Morain, Bruno Salvy, Éric Schost
2008	—	`conf`	High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment. ICCSA Workshops Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Éric Schost
2008	J	`jnl`	Power Series Composition and Change of Basis CoRR Alin Bostan, Bruno Salvy, Éric Schost
2008	B	`conf`	Power series composition and change of basis. ISSAC Alin Bostan, Bruno Salvy, Éric Schost
2008	J	`jnl`	Solving structured linear systems with large displacement rank. Theor. Comput. Sci. Alin Bostan, Claude-Pierre Jeannerod, Éric Schost
2008	B	`conf`	Subquadratic Polynomial Multiplication over Selected Areas in Cryptography Éric Schost, Arash Hariri
2008	J	`jnl`	The modpn library: bringing fast polynomial arithmetic into MAPLE. ACM Commun. Comput. Algebra Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Éric Schost
2007	B	`conf`	Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. ISSAC P. Mihailescu, François Morain, Éric Schost
2007	J	`jnl`	Differential Equations for Algebraic Functions CoRR Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost
2007	B	`conf`	Differential equations for algebraic functions. ISSAC Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost
2007	B	`conf`	Fast arithmetic for triangular sets: from theory to practice. ISSAC Xin Li, Marc Moreno Maza, Éric Schost
2007	A*	`conf`	Fast computation of power series solutions of systems of differential equations. SODA Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic
2007	J	`jnl`	Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator. SIAM J. Comput. Alin Bostan, Pierrick Gaudry, Éric Schost
2007	Misc	`conf`	On the Virtues of Generic Programming for Symbolic Computation. International Conference on Computational Science (2) Xin Li, Marc Moreno Maza, Éric Schost
2007	B	`conf`	Solving toeplitz- and vandermonde-like linear systems with large displacement rank. ISSAC Alin Bostan, Claude-Pierre Jeannerod, Éric Schost
2006	B	`conf`	Change of order for bivariate triangular sets. ISSAC Cyril Pascal, Éric Schost
2006	J	`jnl`	Evaluation Properties of Symmetric Polynomials. Int. J. Algebra Comput. Pierrick Gaudry, Éric Schost, Nicolas M. Thiéry
2006	J	`jnl`	Fast algorithms for computing isogenies between elliptic curves CoRR Alin Bostan, Bruno Salvy, François Morain, Éric Schost
2006	J	`jnl`	Fast computation of power series solutions of systems of differential equations CoRR Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic
2006	J	`jnl`	Fast computation of special resultants. J. Symb. Comput. Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost
2006	B	`conf`	Implementation techniques for fast polynomial arithmetic in a high-level programming environment. ISSAC Akpodigha Filatei, Xin Li, Marc Moreno Maza, Éric Schost
2006	J	`jnl`	Solving structured linear systems of large displacement rank. ACM Commun. Comput. Algebra Alin Bostan, Claude-Pierre Jeannerod, Éric Schost
2006	—	`conf`	Using fast matrix multiplication to solve structured linear systems. Challenges in Symbolic Computation Software Éric Schost, Alin Bostan, Claude-Pierre Jeannerod
2005	B	`conf`	Lifting techniques for triangular decompositions. ISSAC Xavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, Yuzhen Xie
2005	J	`jnl`	Modular equations for hyperelliptic curves. Math. Comput. Pierrick Gaudry, Éric Schost
2005	B	`conf`	Multivariate power series multiplication. ISSAC Éric Schost
2005	J	`jnl`	On the complexity of the D5 principle. SIGSAM Bull. Xavier Dahan, Éric Schost, Marc Moreno Maza, Wenyuan Wu, Yuzhen Xie
2005	J	`jnl`	Polynomial evaluation and interpolation on special sets of points. J. Complex. Alin Bostan, Éric Schost
2005	J	`jnl`	There is no efficient reverse derivation mode for discrete derivatives. Theor. Comput. Sci. Éric Schost
2004	—	`conf`	A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm. ANTS Pierrick Gaudry, Éric Schost
2004	B	`conf`	Complexity issues in bivariate polynomial factorization. ISSAC Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt
2004	A*	`conf`	Construction of Secure Random Curves of Genus 2 over Prime Fields. EUROCRYPT Pierrick Gaudry, Éric Schost
2004	J	`jnl`	On the complexities of multipoint evaluation and interpolation. Theor. Comput. Sci. Alin Bostan, Éric Schost
2004	J	`jnl`	Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. Discret. Comput. Geom. Mohab Safey El Din, Éric Schost
2004	B	`conf`	Sharp estimates for triangular sets. ISSAC Xavier Dahan, Éric Schost
2003	J	`jnl`	Complexity results for triangular sets. J. Symb. Comput. Éric Schost
2003	J	`jnl`	Computing Parametric Geometric Resolutions. Appl. Algebra Eng. Commun. Comput. Éric Schost
2003	J	`jnl`	Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality. Appl. Algebra Eng. Commun. Comput. Alin Bostan, Bruno Salvy, Éric Schost
2003	—	`conf`	Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves. International Conference on Finite Fields and Applications Alin Bostan, Pierrick Gaudry, Éric Schost
2003	B	`conf`	Polar varieties and computation of one point in each connected component of a smooth real algebraic set. ISSAC Mohab Safey El Din, Éric Schost
2003	B	`conf`	Tellegen's principle into practice. ISSAC Alin Bostan, Grégoire Lecerf, Éric Schost
2002	B	`conf`	Degree bounds and lifting techniques for triangular sets. ISSAC Éric Schost
2001	—	`conf`	On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. AAECC Pierrick Gaudry, Éric Schost
2000	—	`conf`	Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study. Automated Deduction in Geometry Fabrice Rouillier, Mohab Safey El Din, Éric Schost
1999	B	`conf`	Solving Some Overdetermined Polynomial Systems. ISSAC Marc Giusti, Éric Schost