default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉric Schost
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j71]Vincent Neiger
, Bruno Salvy, Éric Schost, Gilles Villard:
Faster Modular Composition. J. ACM 71(2): 11:1-11:79 (2024)- [j70]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: 102234 (2024) - [c58]Jesse Elliott, Éric Schost:
Some applications of Chinese Remainder Theorem codes with error-correction. SCSS (Work in Progress) 2024: 13-18 - [i53]Rémi Prébet, Mohab Safey El Din, Éric Schost:
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity. CoRR abs/2402.03111 (2024) - 2023
- [j69]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: 72-97 (2023) - [j68]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: 365-399 (2023) - [c57]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. ISSAC 2023: 452-460 - [c56]Yossef Musleh, Éric Schost:
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. ISSAC 2023: 461-469 - [c55]Éric Schost, Catherine St-Pierre:
p-adic algorithm for bivariate Gröbner bases. ISSAC 2023: 508-516 - [i52]Éric Schost, Catherine St-Pierre:
Newton iteration for lexicographic Gröbner bases in two variables. CoRR abs/2302.03766 (2023) - [i51]Yossef Musleh, Éric Schost:
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. CoRR abs/2302.08611 (2023) - [i50]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. CoRR abs/2306.03855 (2023) - [i49]Éric Schost, Catherine St-Pierre:
p-adic algorithm for bivariate Gröbner bases. CoRR abs/2312.14116 (2023) - 2022
- [i48]Rémi Prébet, Mohab Safey El Din, Éric Schost:
Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results. CoRR abs/2203.03961 (2022) - [i47]Jesse Elliott, Mark Giesbrecht, Éric Schost:
Bit complexity for computing one point in each connected component of a smooth real algebraic set. CoRR abs/2207.04289 (2022) - 2021
- [j67]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Subquadratic-Time Algorithms for Normal Bases. Comput. Complex. 30(1): 5 (2021) - [j66]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. 66: 101557 (2021) - [j65]Manuel Kauers, Alexey Ovchinnikov, Éric Schost:
Foreword. J. Symb. Comput. 102: 1-2 (2021) - [j64]Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Solving determinantal systems using homotopy techniques. J. Symb. Comput. 104: 754-804 (2021) - [j63]Javad Doliskani, Anand Kumar Narayanan, Éric Schost:
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. J. Symb. Comput. 105: 199-213 (2021) - [c54]Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse Multiplication of Multivariate Linear Differential Operators. ISSAC 2021: 155-162 - [c53]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. ISSAC 2021: 201-208 - [i46]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. CoRR abs/2102.03583 (2021) - [i45]Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard:
Faster Modular Composition. CoRR abs/2110.08354 (2021) - 2020
- [j62]Vincent Neiger, Éric Schost:
Computing syzygies in finite dimension using fast linear algebra. J. Complex. 60: 101502 (2020) - [j61]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Block-Krylov techniques in the context of sparse-FGLM algorithms. J. Symb. Comput. 98: 163-191 (2020) - [c52]Jesse Elliott, Mark Giesbrecht, Éric Schost:
On the bit complexity of finding points in connected components of a smooth real hypersurface. ISSAC 2020: 170-177 - [c51]Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse multiplication for skew polynomials. ISSAC 2020: 194-201 - [i44]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Subquadratic-Time Algorithms for Normal Bases. CoRR abs/2005.03497 (2020) - [i43]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR abs/2009.00844 (2020) - [i42]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. CoRR abs/2009.00847 (2020) - [i41]Hoon Hong, James Rohal, Mohab Safey El Din, Éric Schost:
Connectivity in Semi-Algebraic Sets I. CoRR abs/2011.02162 (2020)
2010 – 2019
- 2019
- [j60]Jesse Elliott, Éric Schost:
Bit complexity for critical point computation in smooth and compact real hypersurfaces. ACM Commun. Comput. Algebra 53(3): 114-117 (2019) - [j59]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. Math. Comput. 88(317): 1391-1426 (2019) - [c50]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Quadratic-Time Algorithms for Normal Elements. ISSAC 2019: 179-186 - [c49]Seung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine St-Pierre:
Change of Basis for m-primary Ideals in One and Two Variables. ISSAC 2019: 227-234 - [c48]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. ISSAC 2019: 235-242 - [c47]Yossef Musleh, Éric Schost:
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. ISSAC 2019: 307-314 - [i40]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Quadratic Probabilistic Algorithms for Normal Bases. CoRR abs/1903.03278 (2019) - [i39]Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. CoRR abs/1905.04356 (2019) - [i38]Seung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine St-Pierre:
Change of basis for m-primary ideals in one and two variables. CoRR abs/1905.04614 (2019) - [i37]Yossef Musleh, Éric Schost:
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. CoRR abs/1907.12731 (2019) - [i36]Vincent Neiger, Éric Schost:
Computing syzygies in finite dimension using fast linear algebra. CoRR abs/1912.01848 (2019) - 2018
- [j58]Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost:
On semiring complexity of Schur polynomials. Comput. Complex. 27(4): 595-616 (2018) - [j57]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): 117-119 (2018) - [j56]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Sparse FGLM using the block Wiedemann algorithm. ACM Commun. Comput. Algebra 52(4): 123-125 (2018) - [j55]Mohab Safey El Din, Éric Schost:
Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. J. Symb. Comput. 87: 176-206 (2018) - [j54]Dorian Nogneng, Éric Schost:
On the evaluation of some sparse polynomials. Math. Comput. 87(310): 893-904 (2018) - [j53]Javad Doliskani, Pascal Giorgi, Romain Lebreton, Éric Schost:
Simultaneous Conversions with the Residue Number System Using Linear Algebra. ACM Trans. Math. Softw. 44(3): 27:1-27:21 (2018) - [e2]Manuel Kauers, Alexey Ovchinnikov, Éric Schost:
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018. ACM 2018 [contents] - [i35]Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Solving determinantal systems using homotopy techniques. CoRR abs/1802.10409 (2018) - 2017
- [j52]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): 48:1-48:37 (2017) - [j51]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. J. Symb. Comput. 83: 272-314 (2017) - [j50]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): 733-775 (2017) - [c46]Vincent Neiger, Hamid Rahkooy, Éric Schost:
Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. CASC 2017: 313-328 - [c45]Seung Gyu Hyun, Romain Lebreton, Éric Schost:
Algorithms for Structured Linear Systems Solving and Their Implementation. ISSAC 2017: 205-212 - [c44]Angelos Mantzaflaris, Éric Schost, Elias P. Tsigaridas:
Sparse Rational Univariate Representation. ISSAC 2017: 301-308 - [c43]Vincent Neiger, Johan Rosenkilde, Éric Schost:
Fast Computation of the Roots of Polynomials Over the Ring of Power Series. ISSAC 2017: 349-356 - [i34]Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost:
On matrices with displacement structure: generalized operators and faster algorithms. CoRR abs/1703.03734 (2017) - [i33]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. CoRR abs/1705.01221 (2017) - [i32]Vincent Neiger, Johan Rosenkilde, Éric Schost:
Fast Computation of the Roots of Polynomials Over the Ring of Power Series. CoRR abs/1705.10658 (2017) - [i31]Vincent Neiger, Hamid Rahkooy, Éric Schost:
Algorithms for zero-dimensional ideals using linear recurrent sequences. CoRR abs/1707.01971 (2017) - [i30]Javad Doliskani, Anand Kumar Narayanan, Éric Schost:
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields. CoRR abs/1712.00669 (2017) - [i29]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Block-Krylov techniques in the context of sparse-FGLM algorithms. CoRR abs/1712.04177 (2017) - 2016
- [j49]Éric Schost, Pierre-Jean Spaenlehauer:
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. Found. Comput. Math. 16(2): 457-492 (2016) - [j48]Esmaeil Mehrabi, Éric Schost:
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers. J. Complex. 34: 78-128 (2016) - [j47]Romain Lebreton, Éric Schost:
A simple and fast online power series multiplication and its analysis. J. Symb. Comput. 72: 231-251 (2016) - [j46]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): 267-282 (2016) - [c42]Alin Bostan, Xavier Caruso, Éric Schost:
Computation of the Similarity Class of the p-Curvature. ISSAC 2016: 111-118 - [c41]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. ISSAC 2016: 295-302 - [c40]Guillaume Moroz, Éric Schost:
A Fast Algorithm for Computing the Truncated Resultant. ISSAC 2016: 341-348 - [i28]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. CoRR abs/1602.00651 (2016) - [i27]Alin Bostan, Xavier Caruso, Éric Schost:
Computation of the Similarity Class of the p-Curvature. CoRR abs/1605.06126 (2016) - [i26]Mohab Safey El Din, Éric Schost:
Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization. CoRR abs/1605.07433 (2016) - [i25]Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost:
On semiring complexity of Schur polynomials. CoRR abs/1608.05043 (2016) - [i24]Guillaume Moroz, Éric Schost:
A Fast Algorithm for Computing the Truncated Resultant. CoRR abs/1609.04259 (2016) - 2015
- [j45]Javad Doliskani, Éric Schost:
Computing in degree 2k-extensions of finite fields of odd characteristic. Des. Codes Cryptogr. 74(3): 559-569 (2015) - [j44]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): 2370-2387 (2015) - [c39]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: 45-60 - [c38]Éric Schost:
Algorithms for Finite Field Arithmetic. ISSAC 2015: 7-12 - [c37]Alin Bostan, Xavier Caruso, Éric Schost:
A Fast Algorithm for Computing the P-curvature. ISSAC 2015: 69-76 - [i23]Alin Bostan, Xavier Caruso, Éric Schost:
A Fast Algorithm for Computing the p-Curvature. CoRR abs/1506.05645 (2015) - [i22]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. CoRR abs/1512.03503 (2015) - 2014
- [j43]Andrew Arnold, Éric Schost:
A Truncated Fourier Transform middle product. ACM Commun. Comput. Algebra 48(3/4): 98-99 (2014) - [j42]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): 1117-1172 (2014) - [j41]Javad Doliskani, Éric Schost:
Taking roots over high extensions of finite fields. Math. Comput. 83(285): 435-446 (2014) - [c36]Parisa Alvandi, Changbo Chen, Steffen Marcus, Marc Moreno Maza, Éric Schost, Paul Vrbik:
Doing Algebraic Geometry with the RegularChains Library. ICMS 2014: 472-479 - [c35]Alin Bostan, Xavier Caruso, Éric Schost:
A fast algorithm for computing the characteristic polynomial of the p-curvature. ISSAC 2014: 59-66 - [c34]Luca De Feo, Javad Doliskani, Éric Schost:
Fast arithmetic for the algebraic closure of finite fields. ISSAC 2014: 122-129 - [i21]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 abs/1402.0643 (2014) - [i20]Alin Bostan, Xavier Caruso, Éric Schost:
A fast algorithm for computing the characteristic polynomial of the p-curvature. CoRR abs/1405.5341 (2014) - 2013
- [j40]Joris van der Hoeven, Éric Schost:
Multi-point evaluation in higher dimensions. Appl. Algebra Eng. Commun. Comput. 24(1): 37-52 (2013) - [j39]Adrien Poteaux, Éric Schost:
Modular Composition Modulo Triangular Sets and Applications. Comput. Complex. 22(3): 463-516 (2013) - [j38]Éric Schost, Pierre-Jean Spaenlehauer:
Newton-like iteration for determinantal systems and structured low rank approximation. ACM Commun. Comput. Algebra 47(3/4): 96-97 (2013) - [j37]Adrien Poteaux, Éric Schost:
On the complexity of computing with zero-dimensional triangular sets. J. Symb. Comput. 50: 110-138 (2013) - [j36]Ioannis Z. Emiris, Éric Schost:
Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011. J. Symb. Comput. 52: 1-2 (2013) - [c33]Luca De Feo, Javad Doliskani, Éric Schost:
Fast algorithms for l-adic towers over finite fields. ISSAC 2013: 165-172 - [c32]Romain Lebreton, Esmaeil Mehrabi, Éric Schost:
On the complexity of solving bivariate systems: the case of non-singular solutions. ISSAC 2013: 251-258 - [c31]Joris van der Hoeven, Romain Lebreton, Éric Schost:
Structured FFT and TFT: symmetric and lattice polynomials. ISSAC 2013: 355-362 - [i19]Alin Bostan, Éric Schost:
A simple and fast algorithm for computing exponentials of power series. CoRR abs/1301.5804 (2013) - [i18]Luca De Feo, Javad Doliskani, Éric Schost:
Fast algorithms for ell-adic towers over finite fields. CoRR abs/1301.6021 (2013) - [i17]Mohab Safey El Din, Éric Schost:
A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. CoRR abs/1307.7836 (2013) - [i16]Éric Schost, Pierre-Jean Spaenlehauer:
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. CoRR abs/1312.7279 (2013) - 2012
- [j35]Romain Lebreton, Esmaeil Mehrabi, Éric Schost:
On the complexity of computing certain resultants. ACM Commun. Comput. Algebra 46(3/4): 108-109 (2012) - [j34]Xavier Dahan, Abdulilah Kadri, Éric Schost:
Bit-size estimates for triangular sets in positive dimension. J. Complex. 28(1): 109-135 (2012) - [j33]Pierrick Gaudry, Éric Schost:
Genus 2 point counting over prime fields. J. Symb. Comput. 47(4): 368-400 (2012) - [j32]Luca De Feo, Éric Schost:
Fast arithmetics in Artin-Schreier towers over finite fields. J. Symb. Comput. 47(7): 771-792 (2012) - [c30]Marc Moreno Maza, Éric Schost, Paul Vrbik:
Inversion Modulo Zero-Dimensional Regular Chains. CASC 2012: 224-235 - [c29]Alin Bostan, Bruno Salvy, Muhammad F. I. Chowdhury, Éric Schost, Romain Lebreton:
Power series solutions of singular (q)-differential equations. ISSAC 2012: 107-114 - [c28]Romain Lebreton, Éric Schost:
Algorithms for the universal decomposition algebra. ISSAC 2012: 234-241 - [i15]Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost:
A baby step-giant step roadmap algorithm for general algebraic sets. CoRR abs/1201.6439 (2012) - [i14]Alin Bostan, Muhammad F. I. Chowdhury, Romain Lebreton, Bruno Salvy, Éric Schost:
Power Series Solutions of Singular (q)-Differential Equations. CoRR abs/1205.3414 (2012) - 2011
- [j31]Mohab Safey El Din, Éric Schost:
A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface. Discret. Comput. Geom. 45(1): 181-220 (2011) - [j30]Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Éric Schost:
The modpn library: Bringing fast polynomial arithmetic into Maple. J. Symb. Comput. 46(7): 841-858 (2011) - [j29]Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost:
Homotopy techniques for multiplication modulo triangular sets. J. Symb. Comput. 46(12): 1378-1402 (2011) - [j28]Charles-Éric Drevet, Md. Nazrul Islam, Éric Schost:
Optimization techniques for small matrix multiplication. Theor. Comput. Sci. 412(22): 2219-2236 (2011) - [e1]Éric Schost, Ioannis Z. Emiris:
Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings. ACM 2011, ISBN 978-1-4503-0675-1 [contents] - [i13]Adrien Poteaux, Éric Schost:
On the complexity of computing with zero-dimensional triangular sets. CoRR abs/1109.4323 (2011) - [i12]Javad Doliskani, Éric Schost:
Taking Roots over High Extensions of Finite Fields. CoRR abs/1110.4350 (2011) - 2010
- [j27]Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost:
On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput. 21(1): 33-83 (2010) - [j26]Luca De Feo, Éric Schost:
transalpyne: a language for automatic transposition. ACM Commun. Comput. Algebra 44(1/2): 59-71 (2010) - [j25]Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, Éric Schost:
Complexity and performance results for non FFT-based univariate polynomial multiplication. ACM Commun. Comput. Algebra 44(3/4): 99-100 (2010) - [j24]Xavier Dahan, Marc Moreno Maza, Éric Schost, Adrien Poteaux:
Almost linear time operations with triangular sets. ACM Commun. Comput. Algebra 44(3/4): 103-104 (2010) - [j23]Luca De Feo, Éric Schost:
transalpyne: a language for automatic transposition. ACM Commun. Comput. Algebra 44(3/4): 105-106 (2010) - [j22]Charles-Éric Drevet, Md. Nazrul Islam, Éric Schost:
Optimization techniques for small matrix multiplication. ACM Commun. Comput. Algebra 44(3/4): 107-108 (2010) - [i11]Luca De Feo, Éric Schost:
Fast Arithmetics in Artin-Schreier Towers over Finite Fields. CoRR abs/1002.2594 (2010) - [i10]Xavier Dahan, Abdulilah Kadri, Éric Schost:
Bit-size estimates for triangular sets in positive dimension. CoRR abs/1008.3459 (2010)
2000 – 2009
- 2009
- [j21]Alin Bostan, Éric Schost:
A simple and fast algorithm for computing exponentials of power series. Inf. Process. Lett. 109(13): 754-756 (2009) - [j20]Xin Li, Marc Moreno Maza, Éric Schost:
Fast arithmetic for triangular sets: From theory to practice. J. Symb. Comput. 44(7): 891-907 (2009) - [j19]Xavier Dahan, Éric Schost, Jie Wu:
Evaluation properties of invariant polynomials. J. Symb. Comput. 44(11): 1592-1604 (2009) - [j18]Sanchit Garg, Éric Schost:
Interpolation of polynomials given by straight-line programs. Theor. Comput. Sci. 410(27-29): 2659-2662 (2009) - [c27]Ling Ding, Éric Schost:
Code Generation for Polynomial Multiplication. CASC 2009: 66-78 - [c26]Alin Bostan, Éric Schost:
Fast algorithms for differential equations in positive characteristic. ISSAC 2009: 47-54 - [c25]Luca De Feo, Éric Schost:
Fast arithmetics in artin-schreier towers over finite fields. ISSAC 2009: 127-134 - [i9]Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost:
Homotopy methods for multiplication modulo triangular sets. CoRR abs/0901.3657 (2009) - [i8]Alin Bostan, Éric Schost:
Fast algorithms for differential equations in positive characteristic. CoRR abs/0901.3843 (2009) - [i7]Mohab Safey El Din, Éric Schost:
A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces. CoRR abs/0902.1612 (2009) - 2008
- [j17]Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Éric Schost:
The modpn library: bringing fast polynomial arithmetic into MAPLE. ACM Commun. Comput. Algebra 42(3): 172-174 (2008) - [j16]Alin Bostan, François Morain, Bruno Salvy, Éric Schost:
Fast algorithms for computing isogenies between elliptic curves. Math. Comput. 77(263): 1755-1778 (2008) - [j15]Xavier Dahan, Xin Jin, Marc Moreno Maza, Éric Schost:
Change of order for regular chains in positive dimension. Theor. Comput. Sci. 392(1-3): 37-65 (2008) - [j14]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving structured linear systems with large displacement rank. Theor. Comput. Sci. 407(1-3): 155-181 (2008) - [c24]Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Éric Schost:
High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment. ICCSA Workshops 2008: 331-341 - [c23]Alin Bostan, Bruno Salvy, Éric Schost:
Power series composition and change of basis. ISSAC 2008: 269-276 - [c22]Éric Schost, Arash Hariri:
Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering. Selected Areas in Cryptography 2008: 361-372 - [i6]Alin Bostan, Bruno Salvy, Éric Schost:
Power Series Composition and Change of Basis. CoRR abs/0804.2337 (2008) - [i5]Alin Bostan, Bruno Salvy, Éric Schost:
Fast Conversion Algorithms for Orthogonal Polynomials. CoRR abs/0804.2373 (2008) - 2007
- [j13]Alin Bostan, Pierrick Gaudry, Éric Schost:
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator. SIAM J. Comput. 36(6): 1777-1806 (2007) - [c21]Xin Li, Marc Moreno Maza, Éric Schost:
On the Virtues of Generic Programming for Symbolic Computation. International Conference on Computational Science (2) 2007: 251-258 - [c20]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
Differential equations for algebraic functions. ISSAC 2007: 25-32 - [c19]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving toeplitz- and vandermonde-like linear systems with large displacement rank. ISSAC 2007: 33-40 - [c18]Xin Li, Marc Moreno Maza, Éric Schost:
Fast arithmetic for triangular sets: from theory to practice. ISSAC 2007: 269-276 - [c17]P. Mihailescu, François Morain, Éric Schost:
Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. ISSAC 2007: 285-292 - [c16]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. SODA 2007: 1012-1021 - [i4]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
Differential Equations for Algebraic Functions. CoRR abs/cs/0703121 (2007) - 2006
- [j12]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving structured linear systems of large displacement rank. ACM Commun. Comput. Algebra 40(2): 42-44 (2006) - [j11]Pierrick Gaudry, Éric Schost, Nicolas M. Thiéry:
Evaluation Properties of Symmetric Polynomials. Int. J. Algebra Comput. 16(3): 505-524 (2006) - [j10]Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost:
Fast computation of special resultants. J. Symb. Comput. 41(1): 1-29 (2006) - [c15]Akpodigha Filatei, Xin Li, Marc Moreno Maza, Éric Schost:
Implementation techniques for fast polynomial arithmetic in a high-level programming environment. ISSAC 2006: 93-100 - [c14]Cyril Pascal, Éric Schost:
Change of order for bivariate triangular sets. ISSAC 2006: 277-284 - [i3]Éric Schost, Alin Bostan, Claude-Pierre Jeannerod:
Using fast matrix multiplication to solve structured linear systems. Challenges in Symbolic Computation Software 2006 - [i2]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. CoRR abs/cs/0604101 (2006) - [i1]Alin Bostan, Bruno Salvy, François Morain, Éric Schost:
Fast algorithms for computing isogenies between elliptic curves. CoRR abs/cs/0609020 (2006) - 2005
- [j9]Xavier Dahan, Éric Schost, Marc Moreno Maza, Wenyuan Wu, Yuzhen Xie:
On the complexity of the D5 principle. SIGSAM Bull. 39(3): 97-98 (2005) - [j8]Alin Bostan, Éric Schost:
Polynomial evaluation and interpolation on special sets of points. J. Complex. 21(4): 420-446 (2005) - [j7]Pierrick Gaudry, Éric Schost:
Modular equations for hyperelliptic curves. Math. Comput. 74(249): 429-454 (2005) - [j6]Éric Schost:
There is no efficient reverse derivation mode for discrete derivatives. Theor. Comput. Sci. 347(1-2): 299-305 (2005) - [c13]Xavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, Yuzhen Xie:
Lifting techniques for triangular decompositions. ISSAC 2005: 108-115 - [c12]Éric Schost:
Multivariate power series multiplication. ISSAC 2005: 293-300 - 2004
- [j5]Mohab Safey El Din, Éric Schost:
Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. Discret. Comput. Geom. 32(3): 417-430 (2004) - [j4]Alin Bostan, Éric Schost:
On the complexities of multipoint evaluation and interpolation. Theor. Comput. Sci. 329(1-3): 223-235 (2004) - [c11]Pierrick Gaudry, Éric Schost:
A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm. ANTS 2004: 208-222 - [c10]Pierrick Gaudry, Éric Schost:
Construction of Secure Random Curves of Genus 2 over Prime Fields. EUROCRYPT 2004: 239-256 - [c9]Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt:
Complexity issues in bivariate polynomial factorization. ISSAC 2004: 42-49 - [c8]Xavier Dahan, Éric Schost:
Sharp estimates for triangular sets. ISSAC 2004: 103-110 - 2003
- [j3]Éric Schost:
Computing Parametric Geometric Resolutions. Appl. Algebra Eng. Commun. Comput. 13(5): 349-393 (2003) - [j2]Alin Bostan, Bruno Salvy, Éric Schost:
Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality. Appl. Algebra Eng. Commun. Comput. 14(4): 239-272 (2003) - [j1]Éric Schost:
Complexity results for triangular sets. J. Symb. Comput. 36(3-4): 555-594 (2003) - [c7]Alin Bostan, Pierrick Gaudry, Éric Schost:
Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves. International Conference on Finite Fields and Applications 2003: 40-58 - [c6]Alin Bostan, Grégoire Lecerf, Éric Schost:
Tellegen's principle into practice. ISSAC 2003: 37-44 - [c5]Mohab Safey El Din, Éric Schost:
Polar varieties and computation of one point in each connected component of a smooth real algebraic set. ISSAC 2003: 224-231 - 2002
- [c4]Éric Schost:
Degree bounds and lifting techniques for triangular sets. ISSAC 2002: 238-245 - 2001
- [c3]Pierrick Gaudry, Éric Schost:
On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. AAECC 2001: 373-386 - 2000
- [c2]Fabrice Rouillier, Mohab Safey El Din, Éric Schost:
Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study. Automated Deduction in Geometry 2000: 26-40
1990 – 1999
- 1999
- [c1]Marc Giusti, Éric Schost:
Solving Some Overdetermined Polynomial Systems. ISSAC 1999: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
