[ 2017 ]


[ 116 ]
Mohab Safey El Din and Éric Schost. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. J. ACM, 63:48:1-48:37, 2017. [ http ]
@article{DBLP:journals/jacm/DinS17,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1145/2996450},
 journal = {J. {ACM}},
 pages = {48:1--48:37},
 title = {A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth
and Bounded Real Algebraic Sets},
 url = {http://doi.acm.org/10.1145/2996450},
 volume = {63},
 year = {2017}
}



[ 2016 ]


[ 115 ]
Alin Bostan, Xavier Caruso, and Éric Schost. Computation of the similarity class of the p-curvature. CoRR, abs/1605.06126, 2016. [ http ]
@article{DBLP:journals/corr/BostanCS16,
 author = {Alin Bostan and
Xavier Caruso and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Computation of the Similarity Class of the p-Curvature},
 url = {http://arxiv.org/abs/1605.06126},
 volume = {abs/1605.06126},
 year = {2016}
}

[ 114 ]
Mohab Safey El Din and Éric Schost. Bit complexity for multi-homogeneous polynomial system solving application to polynomial minimization. CoRR, abs/1605.07433, 2016. [ http ]
@article{DBLP:journals/corr/DinS16a,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Bit complexity for multi-homogeneous polynomial system solving Application
to polynomial minimization},
 url = {http://arxiv.org/abs/1605.07433},
 volume = {abs/1605.07433},
 year = {2016}
}

[ 113 ]
Sergey Fomin, Dima Grigoriev, Dorian Nogneng, and Éric Schost. On semiring complexity of schur polynomials. CoRR, abs/1608.05043, 2016. [ http ]
@article{DBLP:journals/corr/FominGNS16,
 author = {Sergey Fomin and
Dima Grigoriev and
Dorian Nogneng and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {On semiring complexity of Schur polynomials},
 url = {http://arxiv.org/abs/1608.05043},
 volume = {abs/1608.05043},
 year = {2016}
}

[ 112 ]
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, and Gilles Villard. Fast computation of minimal interpolation bases in popov form for arbitrary shifts. CoRR, abs/1602.00651, 2016. [ http ]
@article{DBLP:journals/corr/JeannerodNSV16,
 author = {Claude{-}Pierre Jeannerod and
Vincent Neiger and
{\'{E}}ric Schost and
Gilles Villard},
 journal = {CoRR},
 title = {Fast computation of minimal interpolation bases in Popov form for
arbitrary shifts},
 url = {http://arxiv.org/abs/1602.00651},
 volume = {abs/1602.00651},
 year = {2016}
}

[ 111 ]
Guillaume Moroz and Éric Schost. A fast algorithm for computing the truncated resultant. CoRR, abs/1609.04259, 2016. [ http ]
@article{DBLP:journals/corr/MorozS16,
 author = {Guillaume Moroz and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {A Fast Algorithm for Computing the Truncated Resultant},
 url = {http://arxiv.org/abs/1609.04259},
 volume = {abs/1609.04259},
 year = {2016}
}

[ 110 ]
Éric Schost and Pierre-Jean Spaenlehauer. A quadratically convergent algorithm for structured low-rank approximation. Foundations of Computational Mathematics, 16:457-492, 2016. [ http ]
@article{DBLP:journals/focm/SchostS16,
 author = {{\'{E}}ric Schost and
Pierre{-}Jean Spaenlehauer},
 doi = {10.1007/s10208-015-9256-x},
 journal = {Foundations of Computational Mathematics},
 pages = {457--492},
 title = {A Quadratically Convergent Algorithm for Structured Low-Rank Approximation},
 url = {http://dx.doi.org/10.1007/s10208-015-9256-x},
 volume = {16},
 year = {2016}
}

[ 109 ]
Esmaeil Mehrabi and Éric Schost. A softly optimal monte carlo algorithm for solving bivariate polynomial systems over the integers. J. Complexity, 34:78-128, 2016. [ http ]
@article{DBLP:journals/jc/MehrabiS16,
 author = {Esmaeil Mehrabi and
{\'{E}}ric Schost},
 doi = {10.1016/j.jco.2015.11.009},
 journal = {J. Complexity},
 pages = {78--128},
 title = {A softly optimal Monte Carlo algorithm for solving bivariate polynomial
systems over the integers},
 url = {http://dx.doi.org/10.1016/j.jco.2015.11.009},
 volume = {34},
 year = {2016}
}

[ 108 ]
Romain Lebreton and Éric Schost. A simple and fast online power series multiplication and its analysis. J. Symb. Comput., 72:231-251, 2016. [ http ]
@article{DBLP:journals/jsc/LebretonS16,
 author = {Romain Lebreton and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2015.03.001},
 journal = {J. Symb. Comput.},
 pages = {231--251},
 title = {A simple and fast online power series multiplication and its analysis},
 url = {http://dx.doi.org/10.1016/j.jsc.2015.03.001},
 volume = {72},
 year = {2016}
}

[ 107 ]
De Feo, Luca, Hugounenq, Cyril, Plût, Jérôme, and Schost, Éric. Explicit isogenies in quadratic time in any characteristic. LMS J. Comput. Math., 19:267-282, 2016. [ http ]
@article{MR3540960,
 author = {De Feo, Luca and Hugounenq, Cyril and Pl\^ut, J\'er\^ome and Schost, \'Eric},
 doi = {10.1112/S146115701600036X},
 journal = {LMS J. Comput. Math.},
 pages = {267--282},
 title = {Explicit isogenies in quadratic time in any characteristic},
 url = {http://dx.doi.org/10.1112/S146115701600036X},
 volume = {19},
 year = {2016}
}

[ 106 ]
Alin Bostan, Xavier Caruso, and Éric Schost. Computation of the similarity class of the p-curvature. In Sergei A. Abramov, Eugene V. Zima, and Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 111-118. ACM, 2016. [ http ]
@inproceedings{DBLP:conf/issac/BostanCS16,
 author = {Alin Bostan and
Xavier Caruso and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the {ACM} on International Symposium on Symbolic and
Algebraic Computation, {ISSAC} 2016, Waterloo, ON, Canada, July 19-22, 2016},
 doi = {10.1145/2930889.2930897},
 editor = {Sergei A. Abramov and
Eugene V. Zima and
Xiao{-}Shan Gao},
 pages = {111--118},
 publisher = {ACM},
 title = {Computation of the Similarity Class of the p-Curvature},
 url = {http://doi.acm.org/10.1145/2930889.2930897},
 year = {2016}
}

[ 105 ]
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, and Gilles Villard. Fast computation of minimal interpolation bases in popov form for arbitrary shifts. In Sergei A. Abramov, Eugene V. Zima, and Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 295-302. ACM, 2016. [ http ]
@inproceedings{DBLP:conf/issac/JeannerodNSV16,
 author = {Claude{-}Pierre Jeannerod and
Vincent Neiger and
{\'{E}}ric Schost and
Gilles Villard},
 booktitle = {Proceedings of the {ACM} on International Symposium on Symbolic and
Algebraic Computation, {ISSAC} 2016, Waterloo, ON, Canada, July 19-22, 2016},
 doi = {10.1145/2930889.2930928},
 editor = {Sergei A. Abramov and
Eugene V. Zima and
Xiao{-}Shan Gao},
 pages = {295--302},
 publisher = {ACM},
 title = {Fast Computation of Minimal Interpolation Bases in Popov Form for
Arbitrary Shifts},
 url = {http://doi.acm.org/10.1145/2930889.2930928},
 year = {2016}
}

[ 104 ]
Guillaume Moroz and Éric Schost. A fast algorithm for computing the truncated resultant. In Sergei A. Abramov, Eugene V. Zima, and Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 341-348. ACM, 2016. [ http ]
@inproceedings{DBLP:conf/issac/MorozS16,
 author = {Guillaume Moroz and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the {ACM} on International Symposium on Symbolic and
Algebraic Computation, {ISSAC} 2016, Waterloo, ON, Canada, July 19-22, 2016},
 doi = {10.1145/2930889.2930931},
 editor = {Sergei A. Abramov and
Eugene V. Zima and
Xiao{-}Shan Gao},
 pages = {341--348},
 publisher = {ACM},
 title = {A Fast Algorithm for Computing the Truncated Resultant},
 url = {http://doi.acm.org/10.1145/2930889.2930931},
 year = {2016}
}



[ 2015 ]


[ 103 ]
Alin Bostan, Xavier Caruso, and Éric Schost. A fast algorithm for computing the p-curvature. CoRR, abs/1506.05645, 2015. [ http ]
@article{DBLP:journals/corr/BostanCS15,
 author = {Alin Bostan and
Xavier Caruso and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {A Fast Algorithm for Computing the p-Curvature},
 url = {http://arxiv.org/abs/1506.05645},
 volume = {abs/1506.05645},
 year = {2015}
}

[ 102 ]
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, and Gilles Villard. Computing minimal interpolation bases. CoRR, abs/1512.03503, 2015. [ http ]
@article{DBLP:journals/corr/JeannerodNSV15,
 author = {Claude{-}Pierre Jeannerod and
Vincent Neiger and
{\'{E}}ric Schost and
Gilles Villard},
 journal = {CoRR},
 title = {Computing minimal interpolation bases},
 url = {http://arxiv.org/abs/1512.03503},
 volume = {abs/1512.03503},
 year = {2015}
}

[ 101 ]
Javad Doliskani and Éric Schost. Computing in degree 2^k-extensions of finite fields of odd characteristic. Des. Codes Cryptography, 74:559-569, 2015. [ http ]
@article{DBLP:journals/dcc/DoliskaniS15,
 author = {Javad Doliskani and
{\'{E}}ric Schost},
 doi = {10.1007/s10623-013-9875-7},
 journal = {Des. Codes Cryptography},
 pages = {559--569},
 title = {Computing in degree 2\({}^{\mbox{k}}\)-extensions of finite fields
of odd characteristic},
 url = {http://dx.doi.org/10.1007/s10623-013-9875-7},
 volume = {74},
 year = {2015}
}

[ 100 ]
Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, and Gilles Villard. Faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations. IEEE Trans. Information Theory, 61:2370-2387, 2015. [ http ]
@article{DBLP:journals/tit/ChowdhuryJNSV15,
 author = {Muhammad F. I. Chowdhury and
Claude{-}Pierre Jeannerod and
Vincent Neiger and
{\'{E}}ric Schost and
Gilles Villard},
 doi = {10.1109/TIT.2015.2416068},
 journal = {{IEEE} Trans. Information Theory},
 pages = {2370--2387},
 title = {Faster Algorithms for Multivariate Interpolation With Multiplicities
and Simultaneous Polynomial Approximations},
 url = {http://dx.doi.org/10.1109/TIT.2015.2416068},
 volume = {61},
 year = {2015}
}

[ 99 ]
Schost, Éric. Algorithms for finite field arithmetic. In ISSAC'15-Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation, pages 7-12. ACM, New York, 2015.
@incollection{MR3388273,
 author = {Schost, \'Eric},
 booktitle = {I{SSAC}'15---{P}roceedings of the 2015 {ACM} {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 pages = {7--12},
 publisher = {ACM, New York},
 title = {Algorithms for finite field arithmetic},
 year = {2015}
}

[ 98 ]
Bostan, Alin, Caruso, Xavier, and Schost, Éric. A fast algorithm for computing the p-curvature. In ISSAC'15-Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation, pages 69-76. ACM, New York, 2015.
@incollection{MR3388284,
 author = {Bostan, Alin and Caruso, Xavier and Schost, \'Eric},
 booktitle = {I{SSAC}'15---{P}roceedings of the 2015 {ACM} {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 pages = {69--76},
 publisher = {ACM, New York},
 title = {A fast algorithm for computing the {$p$}-curvature},
 year = {2015}
}

[ 97 ]
Alvandi, Parisa, Maza, Marc Moreno, Schost, Éric, and Vrbik, Paul. A standard basis free algorithm for computing the tangent cones of a space curve. In Computer algebra in scientific computing, volume 9301, pages 45-60. Springer, Cham, 2015. [ http ]
@incollection{MR3447508,
 author = {Alvandi, Parisa and Maza, Marc Moreno and Schost, \'Eric and
Vrbik, Paul},
 booktitle = {Computer algebra in scientific computing},
 doi = {10.1007/978-3-319-24021-3_4},
 pages = {45--60},
 publisher = {Springer, Cham},
 title = {A standard basis free algorithm for computing the tangent
cones of a space curve},
 url = {http://dx.doi.org/10.1007/978-3-319-24021-3_4},
 volume = {9301},
 year = {2015}
}

[ 96 ]
Alin Bostan, Xavier Caruso, and Éric Schost. A fast algorithm for computing the p-curvature. In Kazuhiro Yokoyama, Steve Linton, and Daniel Robertz, editors, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06 - 09, 2015, pages 69-76. ACM, 2015. [ http ]
@inproceedings{DBLP:conf/issac/BostanCS15,
 author = {Alin Bostan and
Xavier Caruso and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the 2015 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2015, Bath, United Kingdom, July
06 - 09, 2015},
 doi = {10.1145/2755996.2756674},
 editor = {Kazuhiro Yokoyama and
Steve Linton and
Daniel Robertz},
 pages = {69--76},
 publisher = {ACM},
 title = {A Fast Algorithm for Computing the P-curvature},
 url = {http://doi.acm.org/10.1145/2755996.2756674},
 year = {2015}
}

[ 95 ]
Éric Schost. Algorithms for finite field arithmetic. In Kazuhiro Yokoyama, Steve Linton, and Daniel Robertz, editors, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06 - 09, 2015, pages 7-12. ACM, 2015. [ http ]
@inproceedings{DBLP:conf/issac/Schost15,
 author = {{\'{E}}ric Schost},
 booktitle = {Proceedings of the 2015 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2015, Bath, United Kingdom, July
06 - 09, 2015},
 doi = {10.1145/2755996.2756637},
 editor = {Kazuhiro Yokoyama and
Steve Linton and
Daniel Robertz},
 pages = {7--12},
 publisher = {ACM},
 title = {Algorithms for Finite Field Arithmetic},
 url = {http://doi.acm.org/10.1145/2755996.2756637},
 year = {2015}
}



[ 2014 ]


[ 94 ]
Alin Bostan, Xavier Caruso, and Éric Schost. A fast algorithm for computing the characteristic polynomial of the p-curvature. CoRR, abs/1405.5341, 2014. [ http ]
@article{DBLP:journals/corr/BostanCS14,
 author = {Alin Bostan and
Xavier Caruso and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {A fast algorithm for computing the characteristic polynomial of the
p-curvature},
 url = {http://arxiv.org/abs/1405.5341},
 volume = {abs/1405.5341},
 year = {2014}
}

[ 93 ]
Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, and Gilles Villard. Faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations. CoRR, abs/1402.0643, 2014. [ http ]
@article{DBLP:journals/corr/ChowdhuryJNSV14,
 author = {Muhammad F. I. Chowdhury and
Claude{-}Pierre Jeannerod and
Vincent Neiger and
{\'{E}}ric Schost and
Gilles Villard},
 journal = {CoRR},
 title = {Faster Algorithms for Multivariate Interpolation with Multiplicities
and Simultaneous Polynomial Approximations},
 url = {http://arxiv.org/abs/1402.0643},
 volume = {abs/1402.0643},
 year = {2014}
}

[ 92 ]
Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, and Éric Schost. A baby step-giant step roadmap algorithm for general algebraic sets. Foundations of Computational Mathematics, 14:1117-1172, 2014. [ http ]
@article{DBLP:journals/focm/BasuRDS14,
 author = {Saugata Basu and
Marie{-}Fran{\c{c}}oise Roy and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1007/s10208-014-9212-1},
 journal = {Foundations of Computational Mathematics},
 pages = {1117--1172},
 title = {A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets},
 url = {http://dx.doi.org/10.1007/s10208-014-9212-1},
 volume = {14},
 year = {2014}
}

[ 91 ]
Javad Doliskani and Éric Schost. Taking roots over high extensions of finite fields. Math. Comput., 83:435-446, 2014. [ http ]
@article{DBLP:journals/moc/DoliskaniS14,
 author = {Javad Doliskani and
{\'{E}}ric Schost},
 doi = {10.1090/S0025-5718-2013-02715-9},
 journal = {Math. Comput.},
 pages = {435--446},
 title = {Taking roots over high extensions of finite fields},
 url = {http://dx.doi.org/10.1090/S0025-5718-2013-02715-9},
 volume = {83},
 year = {2014}
}

[ 90 ]
Bostan, Alin, Caruso, Xavier, and Schost, Éric. A fast algorithm for computing the characteristic polynomial of the p-curvature. In ISSAC 2014-Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pages 59-66. ACM, New York, 2014. [ http ]
@incollection{MR3239909,
 author = {Bostan, Alin and Caruso, Xavier and Schost, \'Eric},
 booktitle = {I{SSAC} 2014---{P}roceedings of the 39th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2608628.2608650},
 pages = {59--66},
 publisher = {ACM, New York},
 title = {A fast algorithm for computing the characteristic polynomial
of the p-curvature},
 url = {http://dx.doi.org/10.1145/2608628.2608650},
 year = {2014}
}

[ 89 ]
De Feo, Luca, Doliskani, Javad, and Schost, Éric. Fast arithmetic for the algebraic closure of finite fields. In ISSAC 2014-Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pages 122-129. ACM, New York, 2014. [ http ]
@incollection{MR3239917,
 author = {De Feo, Luca and Doliskani, Javad and Schost, \'Eric},
 booktitle = {I{SSAC} 2014---{P}roceedings of the 39th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2608628.2608672},
 pages = {122--129},
 publisher = {ACM, New York},
 title = {Fast arithmetic for the algebraic closure of finite fields},
 url = {http://dx.doi.org/10.1145/2608628.2608672},
 year = {2014}
}

[ 88 ]
Alvandi, Parisa, Chen, Changbo, Marcus, Steffen, Moreno Maza, Marc, Schost, Eric, and Vrbik, Paul. Doing algebraic geometry with the RegularChains library. In Mathematical software-ICMS 2014, volume 8592, pages 472-479. Springer, Heidelberg, 2014. [ http ]
@incollection{MR3334805,
 author = {Alvandi, Parisa and Chen, Changbo and Marcus, Steffen and
Moreno Maza, Marc and Schost, Eric and Vrbik, Paul},
 booktitle = {Mathematical software---{ICMS} 2014},
 doi = {10.1007/978-3-662-44199-2_71},
 pages = {472--479},
 publisher = {Springer, Heidelberg},
 title = {Doing algebraic geometry with the {R}egular{C}hains library},
 url = {http://dx.doi.org/10.1007/978-3-662-44199-2_71},
 volume = {8592},
 year = {2014}
}



[ 2013 ]


[ 87 ]
Joris van der Hoeven and Éric Schost. Multi-point evaluation in higher dimensions. Appl. Algebra Eng. Commun. Comput., 24:37-52, 2013. [ http ]
@article{DBLP:journals/aaecc/HoevenS13,
 author = {Joris van der Hoeven and
{\'{E}}ric Schost},
 doi = {10.1007/s00200-012-0179-3},
 journal = {Appl. Algebra Eng. Commun. Comput.},
 pages = {37--52},
 title = {Multi-point evaluation in higher dimensions},
 url = {http://dx.doi.org/10.1007/s00200-012-0179-3},
 volume = {24},
 year = {2013}
}

[ 86 ]
Adrien Poteaux and Éric Schost. Modular composition modulo triangular sets and applications. Computational Complexity, 22:463-516, 2013. [ http ]
@article{DBLP:journals/cc/PoteauxS13,
 author = {Adrien Poteaux and
{\'{E}}ric Schost},
 doi = {10.1007/s00037-013-0063-y},
 journal = {Computational Complexity},
 pages = {463--516},
 title = {Modular Composition Modulo Triangular Sets and Applications},
 url = {http://dx.doi.org/10.1007/s00037-013-0063-y},
 volume = {22},
 year = {2013}
}

[ 85 ]
Alin Bostan and Éric Schost. A simple and fast algorithm for computing exponentials of power series. CoRR, abs/1301.5804, 2013. [ http ]
@article{DBLP:journals/corr/abs-1301-5804,
 author = {Alin Bostan and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {A simple and fast algorithm for computing exponentials of power series},
 url = {http://arxiv.org/abs/1301.5804},
 volume = {abs/1301.5804},
 year = {2013}
}

[ 84 ]
Luca De Feo, Javad Doliskani, and Éric Schost. Fast algorithms for ell-adic towers over finite fields. CoRR, abs/1301.6021, 2013. [ http ]
@article{DBLP:journals/corr/abs-1301-6021,
 author = {Luca De Feo and
Javad Doliskani and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Fast algorithms for ell-adic towers over finite fields},
 url = {http://arxiv.org/abs/1301.6021},
 volume = {abs/1301.6021},
 year = {2013}
}

[ 83 ]
Mohab Safey El Din and Éric Schost. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. CoRR, abs/1307.7836, 2013. [ http ]
@article{DBLP:journals/corr/DinS13,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {A nearly optimal algorithm for deciding connectivity queries in smooth
and bounded real algebraic sets},
 url = {http://arxiv.org/abs/1307.7836},
 volume = {abs/1307.7836},
 year = {2013}
}

[ 82 ]
Éric Schost and Pierre-Jean Spaenlehauer. A quadratically convergent algorithm for structured low-rank approximation. CoRR, abs/1312.7279, 2013. [ http ]
@article{DBLP:journals/corr/SchostS13,
 author = {{\'{E}}ric Schost and
Pierre{-}Jean Spaenlehauer},
 journal = {CoRR},
 title = {A Quadratically Convergent Algorithm for Structured Low-Rank Approximation},
 url = {http://arxiv.org/abs/1312.7279},
 volume = {abs/1312.7279},
 year = {2013}
}

[ 81 ]
Ioannis Z. Emiris and Éric Schost. Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011. J. Symb. Comput., 52:1-2, 2013. [ http ]
@article{DBLP:journals/jsc/EmirisS13,
 author = {Ioannis Z. Emiris and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2012.06.005},
 journal = {J. Symb. Comput.},
 pages = {1--2},
 title = {Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: {ISSAC} 2011},
 url = {http://dx.doi.org/10.1016/j.jsc.2012.06.005},
 volume = {52},
 year = {2013}
}

[ 80 ]
Adrien Poteaux and Éric Schost. On the complexity of computing with zero-dimensional triangular sets. J. Symb. Comput., 50:110-138, 2013. [ http ]
@article{DBLP:journals/jsc/PoteauxS13,
 author = {Adrien Poteaux and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2012.05.008},
 journal = {J. Symb. Comput.},
 pages = {110--138},
 title = {On the complexity of computing with zero-dimensional triangular sets},
 url = {http://dx.doi.org/10.1016/j.jsc.2012.05.008},
 volume = {50},
 year = {2013}
}

[ 79 ]
De Feo, Luca, Doliskani, Javad, and Schost, Éric. Fast algorithms for -adic towers over finite fields. In ISSAC 2013-Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pages 165-172. ACM, New York, 2013. [ http ]
@incollection{MR3206354,
 author = {De Feo, Luca and Doliskani, Javad and Schost, \'Eric},
 booktitle = {I{SSAC} 2013---{P}roceedings of the 38th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2465506.2465956},
 pages = {165--172},
 publisher = {ACM, New York},
 title = {Fast algorithms for {$\ell$}-adic towers over finite fields},
 url = {http://dx.doi.org/10.1145/2465506.2465956},
 year = {2013}
}

[ 78 ]
Lebreton, Romain, Mehrabi, Esmaeil, and Schost, Éric. On the complexity of solving bivariate systems: the case of non-singular solutions. In ISSAC 2013-Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pages 251-258. ACM, New York, 2013. [ http ]
@incollection{MR3206365,
 author = {Lebreton, Romain and Mehrabi, Esmaeil and Schost, \'Eric},
 booktitle = {I{SSAC} 2013---{P}roceedings of the 38th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2465506.2465950},
 pages = {251--258},
 publisher = {ACM, New York},
 title = {On the complexity of solving bivariate systems: the case of
non-singular solutions},
 url = {http://dx.doi.org/10.1145/2465506.2465950},
 year = {2013}
}

[ 77 ]
van der Hoeven, Joris, Lebreton, Romain, and Schost, Éric. Structured FFT and TFT: symmetric and lattice polynomials. In ISSAC 2013-Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pages 355-362. ACM, New York, 2013. [ http ]
@incollection{MR3206378,
 author = {van der Hoeven, Joris and Lebreton, Romain and Schost, \'Eric},
 booktitle = {I{SSAC} 2013---{P}roceedings of the 38th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2465506.2465526},
 pages = {355--362},
 publisher = {ACM, New York},
 title = {Structured {FFT} and {TFT}: symmetric and lattice polynomials},
 url = {http://dx.doi.org/10.1145/2465506.2465526},
 year = {2013}
}



[ 2012 ]


[ 76 ]
Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, and Éric Schost. A baby step-giant step roadmap algorithm for general algebraic sets. CoRR, abs/1201.6439, 2012. [ http ]
@article{DBLP:journals/corr/abs-1201-6439,
 author = {Saugata Basu and
Marie{-}Fran{\c{c}}oise Roy and
Mohab Safey El Din and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {A baby step-giant step roadmap algorithm for general algebraic sets},
 url = {http://arxiv.org/abs/1201.6439},
 volume = {abs/1201.6439},
 year = {2012}
}

[ 75 ]
Alin Bostan, Muhammad F. I. Chowdhury, Romain Lebreton, Bruno Salvy, and Éric Schost. Power series solutions of singular (q)-differential equations. CoRR, abs/1205.3414, 2012. [ http ]
@article{DBLP:journals/corr/abs-1205-3414,
 author = {Alin Bostan and
Muhammad F. I. Chowdhury and
Romain Lebreton and
Bruno Salvy and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Power Series Solutions of Singular (q)-Differential Equations},
 url = {http://arxiv.org/abs/1205.3414},
 volume = {abs/1205.3414},
 year = {2012}
}

[ 74 ]
Xavier Dahan, Abdulilah Kadri, and Éric Schost. Bit-size estimates for triangular sets in positive dimension. J. Complexity, 28:109-135, 2012. [ http ]
@article{DBLP:journals/jc/DahanKS12,
 author = {Xavier Dahan and
Abdulilah Kadri and
{\'{E}}ric Schost},
 doi = {10.1016/j.jco.2011.05.001},
 journal = {J. Complexity},
 pages = {109--135},
 title = {Bit-size estimates for triangular sets in positive dimension},
 url = {http://dx.doi.org/10.1016/j.jco.2011.05.001},
 volume = {28},
 year = {2012}
}

[ 73 ]
Luca De Feo and Éric Schost. Fast arithmetics in artin-schreier towers over finite fields. J. Symb. Comput., 47:771-792, 2012. [ http ]
@article{DBLP:journals/jsc/FeoS12,
 author = {Luca De Feo and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2011.12.008},
 journal = {J. Symb. Comput.},
 pages = {771--792},
 title = {Fast arithmetics in Artin-Schreier towers over finite fields},
 url = {http://dx.doi.org/10.1016/j.jsc.2011.12.008},
 volume = {47},
 year = {2012}
}

[ 72 ]
Pierrick Gaudry and Éric Schost. Genus 2 point counting over prime fields. J. Symb. Comput., 47:368-400, 2012. [ http ]
@article{DBLP:journals/jsc/GaudryS12,
 author = {Pierrick Gaudry and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2011.09.003},
 journal = {J. Symb. Comput.},
 pages = {368--400},
 title = {Genus 2 point counting over prime fields},
 url = {http://dx.doi.org/10.1016/j.jsc.2011.09.003},
 volume = {47},
 year = {2012}
}

[ 71 ]
Bostan, Alin, Chowdhury, Muhammad F. I., Lebreton, Romain, Salvy, Bruno, and Schost, Éric. Power series solutions of singular (q)-differential equations. In ISSAC 2012-Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, pages 107-114. ACM, New York, 2012. [ http ]
@incollection{MR3206293,
 author = {Bostan, Alin and Chowdhury, Muhammad F. I. and Lebreton, Romain and Salvy, Bruno and Schost, \'Eric},
 booktitle = {I{SSAC} 2012---{P}roceedings of the 37th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2442829.2442848},
 pages = {107--114},
 publisher = {ACM, New York},
 title = {Power series solutions of singular {$(q)$}-differential
equations},
 url = {http://dx.doi.org/10.1145/2442829.2442848},
 year = {2012}
}

[ 70 ]
Lebreton, Romain and Schost, Éric. Algorithms for the universal decomposition algebra. In ISSAC 2012-Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, pages 234-241. ACM, New York, 2012. [ http ]
@incollection{MR3206309,
 author = {Lebreton, Romain and Schost, \'Eric},
 booktitle = {I{SSAC} 2012---{P}roceedings of the 37th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2442829.2442864},
 pages = {234--241},
 publisher = {ACM, New York},
 title = {Algorithms for the universal decomposition algebra},
 url = {http://dx.doi.org/10.1145/2442829.2442864},
 year = {2012}
}

[ 69 ]
Marc Moreno Maza, Éric Schost, and Paul Vrbik. Inversion modulo zero-dimensional regular chains. In Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings, volume 7442, pages 224-235. Springer, 2012. [ http ]
@inproceedings{DBLP:conf/casc/MazaSV12,
 author = {Marc Moreno Maza and
{\'{E}}ric Schost and
Paul Vrbik},
 booktitle = {Computer Algebra in Scientific Computing - 14th International Workshop, {CASC} 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings},
 doi = {10.1007/978-3-642-32973-9_19},
 editor = {Vladimir P. Gerdt and
Wolfram Koepf and
Ernst W. Mayr and
Evgenii V. Vorozhtsov},
 pages = {224--235},
 publisher = {Springer},
 title = {Inversion Modulo Zero-Dimensional Regular Chains},
 url = {http://dx.doi.org/10.1007/978-3-642-32973-9_19},
 volume = {7442},
 year = {2012}
}



[ 2011 ]


[ 68 ]
Adrien Poteaux and Éric Schost. On the complexity of computing with zero-dimensional triangular sets. CoRR, abs/1109.4323, 2011. [ http ]
@article{DBLP:journals/corr/abs-1109-4323,
 author = {Adrien Poteaux and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {On the complexity of computing with zero-dimensional triangular sets},
 url = {http://arxiv.org/abs/1109.4323},
 volume = {abs/1109.4323},
 year = {2011}
}

[ 67 ]
Javad Doliskani and Éric Schost. Taking roots over high extensions of finite fields. CoRR, abs/1110.4350, 2011. [ http ]
@article{DBLP:journals/corr/abs-1110-4350,
 author = {Javad Doliskani and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Taking Roots over High Extensions of Finite Fields},
 url = {http://arxiv.org/abs/1110.4350},
 volume = {abs/1110.4350},
 year = {2011}
}

[ 66 ]
Mohab Safey El Din and Éric Schost. A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface. Discrete & Computational Geometry, 45:181-220, 2011. [ http ]
@article{DBLP:journals/dcg/DinS11,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1007/s00454-009-9239-2},
 journal = {Discrete {\&} Computational Geometry},
 pages = {181--220},
 title = {A Baby Steps/Giant Steps Probabilistic Algorithm for~Computing Roadmaps
in Smooth Bounded Real Hypersurface},
 url = {http://dx.doi.org/10.1007/s00454-009-9239-2},
 volume = {45},
 year = {2011}
}

[ 65 ]
Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, and Éric Schost. Homotopy techniques for multiplication modulo triangular sets. J. Symb. Comput., 46:1378-1402, 2011. [ http ]
@article{DBLP:journals/jsc/BostanCHS11,
 author = {Alin Bostan and
Muhammad F. I. Chowdhury and
Joris van der Hoeven and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2011.08.015},
 journal = {J. Symb. Comput.},
 pages = {1378--1402},
 title = {Homotopy techniques for multiplication modulo triangular sets},
 url = {http://dx.doi.org/10.1016/j.jsc.2011.08.015},
 volume = {46},
 year = {2011}
}

[ 64 ]
Xin Li, Marc Moreno Maza, Raqeeb Rasheed, and Éric Schost. The modpn library: Bringing fast polynomial arithmetic into maple. J. Symb. Comput., 46:841-858, 2011. [ http ]
@article{DBLP:journals/jsc/LiMRS11,
 author = {Xin Li and
Marc Moreno Maza and
Raqeeb Rasheed and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2010.08.016},
 journal = {J. Symb. Comput.},
 pages = {841--858},
 title = {The modpn library: Bringing fast polynomial arithmetic into Maple},
 url = {http://dx.doi.org/10.1016/j.jsc.2010.08.016},
 volume = {46},
 year = {2011}
}

[ 63 ]
Charles-Éric Drevet, Md. Nazrul Islam, and Éric Schost. Optimization techniques for small matrix multiplication. Theor. Comput. Sci., 412:2219-2236, 2011. [ http ]
@article{DBLP:journals/tcs/DrevetIS11,
 author = {Charles{-}{\'{E}}ric Drevet and
Md. Nazrul Islam and
{\'{E}}ric Schost},
 doi = {10.1016/j.tcs.2010.12.012},
 journal = {Theor. Comput. Sci.},
 pages = {2219--2236},
 title = {Optimization techniques for small matrix multiplication},
 url = {http://dx.doi.org/10.1016/j.tcs.2010.12.012},
 volume = {412},
 year = {2011}
}

[ 62 ]
Éric Schost and Ioannis Z. Emiris, editors. Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings. ACM, 2011.
@proceedings{DBLP:conf/issac/2011,
 editor = {{\'{E}}ric Schost and
Ioannis Z. Emiris},
 publisher = {ACM},
 title = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2011 (co-located with {FCRC} 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings},
 year = {2011}
}



[ 2010 ]


[ 61 ]
Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, and Éric Schost. On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput., 21:33-83, 2010. [ http ]
@article{DBLP:journals/aaecc/BankGHDS10,
 author = {Bernd Bank and
Marc Giusti and
Joos Heintz and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1007/s00200-009-0117-1},
 journal = {Appl. Algebra Eng. Commun. Comput.},
 pages = {33--83},
 title = {On the geometry of polar varieties},
 url = {http://dx.doi.org/10.1007/s00200-009-0117-1},
 volume = {21},
 year = {2010}
}

[ 60 ]
Luca De Feo and Éric Schost. Fast arithmetics in artin-schreier towers over finite fields. CoRR, abs/1002.2594, 2010. [ http ]
@article{DBLP:journals/corr/abs-1002-2594,
 author = {Luca De Feo and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Fast Arithmetics in Artin-Schreier Towers over Finite Fields},
 url = {http://arxiv.org/abs/1002.2594},
 volume = {abs/1002.2594},
 year = {2010}
}

[ 59 ]
Xavier Dahan, Abdulilah Kadri, and Éric Schost. Bit-size estimates for triangular sets in positive dimension. CoRR, abs/1008.3459, 2010. [ http ]
@article{DBLP:journals/corr/abs-1008-3459,
 author = {Xavier Dahan and
Abdulilah Kadri and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Bit-size estimates for triangular sets in positive dimension},
 url = {http://arxiv.org/abs/1008.3459},
 volume = {abs/1008.3459},
 year = {2010}
}

[ 58 ]
Bostan, Alin, Salvy, Bruno, and Schost, Éric. Fast conversion algorithms for orthogonal polynomials. Linear Algebra Appl., 432:249-258, 2010. [ http ]
@article{MR2566473,
 author = {Bostan, Alin and Salvy, Bruno and Schost, \'Eric},
 doi = {10.1016/j.laa.2009.08.002},
 journal = {Linear Algebra Appl.},
 pages = {249--258},
 title = {Fast conversion algorithms for orthogonal polynomials},
 url = {http://dx.doi.org/10.1016/j.laa.2009.08.002},
 volume = {432},
 year = {2010}
}

[ 57 ]
De Feo, Luca and Schost, Éric. transalpyne: a language for automatic transposition. ACM Commun. Comput. Algebra, 44:59-71, 2010.
@article{MR2923271,
 author = {De Feo, Luca and Schost, \'Eric},
 journal = {ACM Commun. Comput. Algebra},
 pages = {59--71},
 title = {{\tt transalpyne}: a language for automatic transposition},
 volume = {44},
 year = {2010}
}



[ 2009 ]


[ 56 ]
Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, and Éric Schost. Homotopy methods for multiplication modulo triangular sets. CoRR, abs/0901.3657, 2009. [ http ]
@article{DBLP:journals/corr/abs-0901-3657,
 author = {Alin Bostan and
Muhammad F. I. Chowdhury and
Joris van der Hoeven and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Homotopy methods for multiplication modulo triangular sets},
 url = {http://arxiv.org/abs/0901.3657},
 volume = {abs/0901.3657},
 year = {2009}
}

[ 55 ]
Alin Bostan and Éric Schost. Fast algorithms for differential equations in positive characteristic. CoRR, abs/0901.3843, 2009. [ http ]
@article{DBLP:journals/corr/abs-0901-3843,
 author = {Alin Bostan and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Fast algorithms for differential equations in positive characteristic},
 url = {http://arxiv.org/abs/0901.3843},
 volume = {abs/0901.3843},
 year = {2009}
}

[ 54 ]
Mohab Safey El Din and Éric Schost. A baby steps/giant steps monte carlo algorithm for computing roadmaps in smooth compact real hypersurfaces. CoRR, abs/0902.1612, 2009. [ http ]
@article{DBLP:journals/corr/abs-0902-1612,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {A baby steps/giant steps Monte Carlo algorithm for computing roadmaps
in smooth compact real hypersurfaces},
 url = {http://arxiv.org/abs/0902.1612},
 volume = {abs/0902.1612},
 year = {2009}
}

[ 53 ]
Alin Bostan and Éric Schost. A simple and fast algorithm for computing exponentials of power series. Inf. Process. Lett., 109:754-756, 2009. [ http ]
@article{DBLP:journals/ipl/BostanS09,
 author = {Alin Bostan and
{\'{E}}ric Schost},
 doi = {10.1016/j.ipl.2009.03.012},
 journal = {Inf. Process. Lett.},
 pages = {754--756},
 title = {A simple and fast algorithm for computing exponentials of power series},
 url = {http://dx.doi.org/10.1016/j.ipl.2009.03.012},
 volume = {109},
 year = {2009}
}

[ 52 ]
Xavier Dahan, Éric Schost, and Jie Wu. Evaluation properties of invariant polynomials. J. Symb. Comput., 44:1592-1604, 2009. [ http ]
@article{DBLP:journals/jsc/DahanSW09,
 author = {Xavier Dahan and
{\'{E}}ric Schost and
Jie Wu},
 doi = {10.1016/j.jsc.2008.12.002},
 journal = {J. Symb. Comput.},
 pages = {1592--1604},
 title = {Evaluation properties of invariant polynomials},
 url = {http://dx.doi.org/10.1016/j.jsc.2008.12.002},
 volume = {44},
 year = {2009}
}

[ 51 ]
Xin Li, Marc Moreno Maza, and Éric Schost. Fast arithmetic for triangular sets: From theory to practice. J. Symb. Comput., 44:891-907, 2009. [ http ]
@article{DBLP:journals/jsc/LiMS09,
 author = {Xin Li and
Marc Moreno Maza and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2008.04.019},
 journal = {J. Symb. Comput.},
 pages = {891--907},
 title = {Fast arithmetic for triangular sets: From theory to practice},
 url = {http://dx.doi.org/10.1016/j.jsc.2008.04.019},
 volume = {44},
 year = {2009}
}

[ 50 ]
Sanchit Garg and Éric Schost. Interpolation of polynomials given by straight-line programs. Theor. Comput. Sci., 410:2659-2662, 2009. [ http ]
@article{DBLP:journals/tcs/GargS09,
 author = {Sanchit Garg and
{\'{E}}ric Schost},
 doi = {10.1016/j.tcs.2009.03.030},
 journal = {Theor. Comput. Sci.},
 pages = {2659--2662},
 title = {Interpolation of polynomials given by straight-line programs},
 url = {http://dx.doi.org/10.1016/j.tcs.2009.03.030},
 volume = {410},
 year = {2009}
}

[ 49 ]
Bostan, Alin and Schost, Éric. Fast algorithms for differential equations in positive characteristic. In ISSAC 2009-Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pages 47-54. ACM, New York, 2009. [ http ]
@incollection{MR2742690,
 author = {Bostan, Alin and Schost, \'Eric},
 booktitle = {I{SSAC} 2009---{P}roceedings of the 2009 {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/1576702.1576712},
 pages = {47--54},
 publisher = {ACM, New York},
 title = {Fast algorithms for differential equations in positive
characteristic},
 url = {http://dx.doi.org/10.1145/1576702.1576712},
 year = {2009}
}

[ 48 ]
De Feo, Luca and Schost, Éric. Fast arithmetics in Artin-Schreier towers over finite fields. In ISSAC 2009-Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pages 127-134. ACM, New York, 2009. [ http ]
@incollection{MR2742700,
 author = {De Feo, Luca and Schost, \'Eric},
 booktitle = {I{SSAC} 2009---{P}roceedings of the 2009 {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/1576702.1576722},
 pages = {127--134},
 publisher = {ACM, New York},
 title = {Fast arithmetics in {A}rtin-{S}chreier towers over finite
fields},
 url = {http://dx.doi.org/10.1145/1576702.1576722},
 year = {2009}
}

[ 47 ]
Ling Ding and Éric Schost. Code generation for polynomial multiplication. In Vladimir P. Gerdt, Ernst W. Mayr, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings, volume 5743, pages 66-78. Springer, 2009. [ http ]
@inproceedings{DBLP:conf/casc/DingS09,
 author = {Ling Ding and
{\'{E}}ric Schost},
 booktitle = {Computer Algebra in Scientific Computing, 11th International Workshop, {CASC} 2009, Kobe, Japan, September 13-17, 2009. Proceedings},
 doi = {10.1007/978-3-642-04103-7_6},
 editor = {Vladimir P. Gerdt and
Ernst W. Mayr and
Evgenii V. Vorozhtsov},
 pages = {66--78},
 publisher = {Springer},
 title = {Code Generation for Polynomial Multiplication},
 url = {http://dx.doi.org/10.1007/978-3-642-04103-7_6},
 volume = {5743},
 year = {2009}
}



[ 2008 ]


[ 46 ]
Alin Bostan, Bruno Salvy, and Éric Schost. Power series composition and change of basis. CoRR, abs/0804.2337, 2008. [ http ]
@article{DBLP:journals/corr/abs-0804-2337,
 author = {Alin Bostan and
Bruno Salvy and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Power Series Composition and Change of Basis},
 url = {http://arxiv.org/abs/0804.2337},
 volume = {abs/0804.2337},
 year = {2008}
}

[ 45 ]
Alin Bostan, Bruno Salvy, and Éric Schost. Fast conversion algorithms for orthogonal polynomials. CoRR, abs/0804.2373, 2008. [ http ]
@article{DBLP:journals/corr/abs-0804-2373,
 author = {Alin Bostan and
Bruno Salvy and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Fast Conversion Algorithms for Orthogonal Polynomials},
 url = {http://arxiv.org/abs/0804.2373},
 volume = {abs/0804.2373},
 year = {2008}
}

[ 44 ]
Alin Bostan, François Morain, Bruno Salvy, and Éric Schost. Fast algorithms for computing isogenies between elliptic curves. Math. Comput., 77:1755-1778, 2008. [ http ]
@article{DBLP:journals/moc/BostanMSS08,
 author = {Alin Bostan and
Fran{\c{c}}ois Morain and
Bruno Salvy and
{\'{E}}ric Schost},
 doi = {10.1090/S0025-5718-08-02066-8},
 journal = {Math. Comput.},
 pages = {1755--1778},
 title = {Fast algorithms for computing isogenies between elliptic curves},
 url = {http://dx.doi.org/10.1090/S0025-5718-08-02066-8},
 volume = {77},
 year = {2008}
}

[ 43 ]
Alin Bostan, Claude-Pierre Jeannerod, and Éric Schost. Solving structured linear systems with large displacement rank. Theor. Comput. Sci., 407:155-181, 2008. [ http ]
@article{DBLP:journals/tcs/BostanJS08,
 author = {Alin Bostan and
Claude{-}Pierre Jeannerod and
{\'{E}}ric Schost},
 doi = {10.1016/j.tcs.2008.05.014},
 journal = {Theor. Comput. Sci.},
 pages = {155--181},
 title = {Solving structured linear systems with large displacement rank},
 url = {http://dx.doi.org/10.1016/j.tcs.2008.05.014},
 volume = {407},
 year = {2008}
}

[ 42 ]
Xavier Dahan, Xin Jin, Marc Moreno Maza, and Éric Schost. Change of order for regular chains in positive dimension. Theor. Comput. Sci., 392:37-65, 2008. [ http ]
@article{DBLP:journals/tcs/DahanJMS08,
 author = {Xavier Dahan and
Xin Jin and
Marc Moreno Maza and
{\'{E}}ric Schost},
 doi = {10.1016/j.tcs.2007.10.003},
 journal = {Theor. Comput. Sci.},
 pages = {37--65},
 title = {Change of order for regular chains in positive dimension},
 url = {http://dx.doi.org/10.1016/j.tcs.2007.10.003},
 volume = {392},
 year = {2008}
}

[ 41 ]
Bostan, Alin, Salvy, Bruno, and Schost, Éric. Power series composition and change of basis. In ISSAC 2008, pages 269-276. ACM, New York, 2008. [ http ]
@incollection{MR2513515,
 author = {Bostan, Alin and Salvy, Bruno and Schost, \'Eric},
 booktitle = {I{SSAC} 2008},
 doi = {10.1145/1390768.1390806},
 pages = {269--276},
 publisher = {ACM, New York},
 title = {Power series composition and change of basis},
 url = {http://dx.doi.org/10.1145/1390768.1390806},
 year = {2008}
}

[ 40 ]
Xin Li, Marc Moreno Maza, Raqeeb Rasheed, and Éric Schost. High-performance symbolic computation in a hybrid compiled-interpreted programming environment. In Marina L. Gavrilova, Osvaldo Gervasi, Antonio Laganà, Youngsong Mun, and Andrés Iglesias, editors, Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, ICCSA '08, Perugia, Italy, June 30 - July 3, 2008, pages 331-341. IEEE Computer Society, 2008. [ http ]
@inproceedings{DBLP:conf/iccsa/LiMRS08,
 author = {Xin Li and
Marc Moreno Maza and
Raqeeb Rasheed and
{\'{E}}ric Schost},
 booktitle = {Selected Papers of the Sixth International Conference on Computational
Sciences and Its Applications, {ICCSA} '08, Perugia, Italy, June 30
- July 3, 2008},
 doi = {10.1109/ICCSA.2008.68},
 editor = {Marina L. Gavrilova and
Osvaldo Gervasi and
Antonio Lagan{\`{a}} and
Youngsong Mun and
Andr{\'{e}}s Iglesias},
 pages = {331--341},
 publisher = {{IEEE} Computer Society},
 title = {High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted
Programming Environment},
 url = {http://dx.doi.org/10.1109/ICCSA.2008.68},
 year = {2008}
}

[ 39 ]
Éric Schost and Arash Hariri. Subquadratic polynomial multiplication over GF(2^m) using trinomial bases and chinese remaindering. In Roberto Maria Avanzi, Liam Keliher, and Francesco Sica, editors, Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers, volume 5381, pages 361-372. Springer, 2008. [ http ]
@inproceedings{DBLP:conf/sacrypt/SchostH08,
 author = {{\'{E}}ric Schost and
Arash Hariri},
 booktitle = {Selected Areas in Cryptography, 15th International Workshop, {SAC}
2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected
Papers},
 doi = {10.1007/978-3-642-04159-4_23},
 editor = {Roberto Maria Avanzi and
Liam Keliher and
Francesco Sica},
 pages = {361--372},
 publisher = {Springer},
 title = {Subquadratic Polynomial Multiplication over \emph{GF}(2\({}^{\mbox{\emph{m}}}\))
Using Trinomial Bases and Chinese Remaindering},
 url = {http://dx.doi.org/10.1007/978-3-642-04159-4_23},
 volume = {5381},
 year = {2008}
}



[ 2007 ]


[ 38 ]
Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, and Éric Schost. Differential equations for algebraic functions. CoRR, abs/cs/0703121, 2007. [ http ]
@article{DBLP:journals/corr/abs-cs-0703121,
 author = {Alin Bostan and
Fr{\'{e}}d{\'{e}}ric Chyzak and
Bruno Salvy and
Gr{\'{e}}goire Lecerf and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Differential Equations for Algebraic Functions},
 url = {http://arxiv.org/abs/cs/0703121},
 volume = {abs/cs/0703121},
 year = {2007}
}

[ 37 ]
Alin Bostan, Pierrick Gaudry, and Éric Schost. Linear recurrences with polynomial coefficients and application to integer factorization and cartier-manin operator. SIAM J. Comput., 36:1777-1806, 2007. [ http ]
@article{DBLP:journals/siamcomp/BostanGS07,
 author = {Alin Bostan and
Pierrick Gaudry and
{\'{E}}ric Schost},
 doi = {10.1137/S0097539704443793},
 journal = {{SIAM} J. Comput.},
 pages = {1777--1806},
 title = {Linear Recurrences with Polynomial Coefficients and Application to
Integer Factorization and Cartier-Manin Operator},
 url = {http://dx.doi.org/10.1137/S0097539704443793},
 volume = {36},
 year = {2007}
}

[ 36 ]
Bostan, Alin, Chyzak, Frédéric, Salvy, Bruno, Lecerf, Grégoire, and Schost, Éric. Differential equations for algebraic functions. In ISSAC 2007, pages 25-32. ACM, New York, 2007. [ http ]
@incollection{MR2396180,
 author = {Bostan, Alin and Chyzak, Fr\'ed\'eric and Salvy, Bruno and Lecerf, Gr\'egoire and Schost, \'Eric},
 booktitle = {I{SSAC} 2007},
 doi = {10.1145/1277548.1277553},
 pages = {25--32},
 publisher = {ACM, New York},
 title = {Differential equations for algebraic functions},
 url = {http://dx.doi.org/10.1145/1277548.1277553},
 year = {2007}
}

[ 35 ]
Bostan, Alin, Jeannerod, Claude-Pierre, and Schost, Éric. Solving Toeplitz- and Vandermonde-like linear systems with large displacement rank. In ISSAC 2007, pages 33-40. ACM, New York, 2007. [ http ]
@incollection{MR2396181,
 author = {Bostan, Alin and Jeannerod, Claude-Pierre and Schost, \'Eric},
 booktitle = {I{SSAC} 2007},
 doi = {10.1145/1277548.1277554},
 pages = {33--40},
 publisher = {ACM, New York},
 title = {Solving {T}oeplitz- and {V}andermonde-like linear systems with
large displacement rank},
 url = {http://dx.doi.org/10.1145/1277548.1277554},
 year = {2007}
}

[ 34 ]
Li, Xin, Maza, Marc Moreno, and Schost, Éric. Fast arithmetic for triangular sets: from theory to practice. In ISSAC 2007, pages 269-276. ACM, New York, 2007. [ http ]
@incollection{MR2402271,
 author = {Li, Xin and Maza, Marc Moreno and Schost, \'Eric},
 booktitle = {I{SSAC} 2007},
 doi = {10.1145/1277548.1277585},
 pages = {269--276},
 publisher = {ACM, New York},
 title = {Fast arithmetic for triangular sets: from theory to practice},
 url = {http://dx.doi.org/10.1145/1277548.1277585},
 year = {2007}
}

[ 33 ]
Mih} ailescu, P., Morain, F., and Schost, É. Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts. In ISSAC 2007, pages 285-292. ACM, New York, 2007.http ]
@incollection{MR2402273,
 author = {Mih\u ailescu, P. and Morain, F. and Schost, \'E.},
 booktitle = {I{SSAC} 2007},
 doi = {10.1145/1277548.1277587},
 pages = {285--292},
 publisher = {ACM, New York},
 title = {Computing the eigenvalue in the {S}choof-{E}lkies-{A}tkin
algorithm using abelian lifts},
 url = {http://dx.doi.org/10.1145/1277548.1277587},
 year = {2007}
}

[ 32 ]
Xin Li, Marc Moreno Maza, and Éric Schost. On the virtues of generic programming for symbolic computation. In Yong Shi, G. Dick van Albada, Jack Dongarra, and Peter M. A. Sloot, editors, Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part II, volume 4488, pages 251-258. Springer, 2007. [ http ]
@inproceedings{DBLP:conf/iccS/LiMS07,
 author = {Xin Li and
Marc Moreno Maza and
{\'{E}}ric Schost},
 booktitle = {Computational Science - {ICCS} 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part {II}},
 doi = {10.1007/978-3-540-72586-2_35},
 editor = {Yong Shi and
G. Dick van Albada and
Jack Dongarra and
Peter M. A. Sloot},
 pages = {251--258},
 publisher = {Springer},
 title = {On the Virtues of Generic Programming for Symbolic Computation},
 url = {http://dx.doi.org/10.1007/978-3-540-72586-2_35},
 volume = {4488},
 year = {2007}
}

[ 31 ]
Bostan, A., Chyzak, F., Ollivier, F., Salvy, B., Schost, É., and Sedoglavic, A. Fast computation of power series solutions of systems of differential equations. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1012-1021. ACM, New York, 2007.
@inproceedings{MR2485252,
 author = {Bostan, A. and Chyzak, F. and Ollivier, F. and Salvy, B. and
Schost, \'E. and Sedoglavic, A.},
 booktitle = {Proceedings of the {E}ighteenth {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms},
 pages = {1012--1021},
 publisher = {ACM, New York},
 title = {Fast computation of power series solutions of systems of
differential equations},
 year = {2007}
}



[ 2006 ]


[ 30 ]
Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, and Alexandre Sedoglavic. Fast computation of power series solutions of systems of differential equations. CoRR, abs/cs/0604101, 2006. [ http ]
@article{DBLP:journals/corr/abs-cs-0604101,
 author = {Alin Bostan and
Fr{\'{e}}d{\'{e}}ric Chyzak and
Fran{\c{c}}ois Ollivier and
Bruno Salvy and
{\'{E}}ric Schost and
Alexandre Sedoglavic},
 journal = {CoRR},
 title = {Fast computation of power series solutions of systems of differential
equations},
 url = {http://arxiv.org/abs/cs/0604101},
 volume = {abs/cs/0604101},
 year = {2006}
}

[ 29 ]
Alin Bostan, Bruno Salvy, François Morain, and Éric Schost. Fast algorithms for computing isogenies between elliptic curves. CoRR, abs/cs/0609020, 2006. [ http ]
@article{DBLP:journals/corr/abs-cs-0609020,
 author = {Alin Bostan and
Bruno Salvy and
Fran{\c{c}}ois Morain and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Fast algorithms for computing isogenies between elliptic curves},
 url = {http://arxiv.org/abs/cs/0609020},
 volume = {abs/cs/0609020},
 year = {2006}
}

[ 28 ]
Pierrick Gaudry, Éric Schost, and Nicolas M. Thiéry. Evaluation properties of symmetric polynomials. IJAC, 16:505-524, 2006. [ http ]
@article{DBLP:journals/ijac/GaudryST06,
 author = {Pierrick Gaudry and
{\'{E}}ric Schost and
Nicolas M. Thi{\'{e}}ry},
 doi = {10.1142/S0218196706003128},
 journal = {IJAC},
 pages = {505--524},
 title = {Evaluation Properties of Symmetric Polynomials},
 url = {http://dx.doi.org/10.1142/S0218196706003128},
 volume = {16},
 year = {2006}
}

[ 27 ]
Alin Bostan, Philippe Flajolet, Bruno Salvy, and Éric Schost. Fast computation of special resultants. J. Symb. Comput., 41:1-29, 2006. [ http ]
@article{DBLP:journals/jsc/BostanFSS06,
 author = {Alin Bostan and
Philippe Flajolet and
Bruno Salvy and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2005.07.001},
 journal = {J. Symb. Comput.},
 pages = {1--29},
 title = {Fast computation of special resultants},
 url = {http://dx.doi.org/10.1016/j.jsc.2005.07.001},
 volume = {41},
 year = {2006}
}

[ 26 ]
Filatei, Akpodigha, Li, Xin, Moreno Maza, Marc, and Schost, Éric. Implementation techniques for fast polynomial arithmetic in a high-level programming environment. In ISSAC 2006, pages 93-100. ACM, New York, 2006. [ http ]
@incollection{MR2289106,
 author = {Filatei, Akpodigha and Li, Xin and Moreno Maza, Marc and
Schost, \'Eric},
 booktitle = {I{SSAC} 2006},
 doi = {10.1145/1145768.1145789},
 pages = {93--100},
 publisher = {ACM, New York},
 title = {Implementation techniques for fast polynomial arithmetic in a
high-level programming environment},
 url = {http://dx.doi.org/10.1145/1145768.1145789},
 year = {2006}
}

[ 25 ]
Pascal, Cyril and Schost, Éric. Change of order for bivariate triangular sets. In ISSAC 2006, pages 277-284. ACM, New York, 2006. [ http ]
@incollection{MR2289131,
 author = {Pascal, Cyril and Schost, \'Eric},
 booktitle = {I{SSAC} 2006},
 doi = {10.1145/1145768.1145814},
 pages = {277--284},
 publisher = {ACM, New York},
 title = {Change of order for bivariate triangular sets},
 url = {http://dx.doi.org/10.1145/1145768.1145814},
 year = {2006}
}

[ 24 ]
Éric Schost, Alin Bostan, and Claude-Pierre Jeannerod. Using fast matrix multiplication to solve structured linear systems. In Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt, editors, Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, volume 06271. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [ http ]
@inproceedings{DBLP:conf/dagstuhl/SchostBJ06,
 author = {{\'{E}}ric Schost and
Alin Bostan and
Claude{-}Pierre Jeannerod},
 booktitle = {Challenges in Symbolic Computation Software, 02.07. - 07.07.2006},
 editor = {Wolfram Decker and
Mike Dewar and
Erich Kaltofen and
Stephen M. Watt},
 publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
 title = {Using fast matrix multiplication to solve structured linear systems},
 url = {http://drops.dagstuhl.de/opus/volltexte/2006/778},
 volume = {06271},
 year = {2006}
}



[ 2005 ]


[ 23 ]
Alin Bostan and Éric Schost. Polynomial evaluation and interpolation on special sets of points. J. Complexity, 21:420-446, 2005. [ http ]
@article{DBLP:journals/jc/BostanS05,
 author = {Alin Bostan and
{\'{E}}ric Schost},
 doi = {10.1016/j.jco.2004.09.009},
 journal = {J. Complexity},
 pages = {420--446},
 title = {Polynomial evaluation and interpolation on special sets of points},
 url = {http://dx.doi.org/10.1016/j.jco.2004.09.009},
 volume = {21},
 year = {2005}
}

[ 22 ]
Pierrick Gaudry and Éric Schost. Modular equations for hyperelliptic curves. Math. Comput., 74:429-454, 2005. [ http ]
@article{DBLP:journals/moc/GaudryS05,
 author = {Pierrick Gaudry and
{\'{E}}ric Schost},
 doi = {10.1090/S0025-5718-04-01682-5},
 journal = {Math. Comput.},
 pages = {429--454},
 title = {Modular equations for hyperelliptic curves},
 url = {http://dx.doi.org/10.1090/S0025-5718-04-01682-5},
 volume = {74},
 year = {2005}
}

[ 21 ]
Éric Schost. There is no efficient reverse derivation mode for discrete derivatives. Theor. Comput. Sci., 347:299-305, 2005. [ http ]
@article{DBLP:journals/tcs/Schost05,
 author = {{\'{E}}ric Schost},
 doi = {10.1016/j.tcs.2005.07.031},
 journal = {Theor. Comput. Sci.},
 pages = {299--305},
 title = {There is no efficient reverse derivation mode for discrete derivatives},
 url = {http://dx.doi.org/10.1016/j.tcs.2005.07.031},
 volume = {347},
 year = {2005}
}

[ 20 ]
Dahan, Xavier, Moreno Maza, Marc, Schost, Eric, Wu, Wenyuan, and Xie, Yuzhen. Lifting techniques for triangular decompositions. In ISSAC'05, pages 108-115. ACM, New York, 2005. [ http ]
@incollection{MR2280536,
 author = {Dahan, Xavier and Moreno Maza, Marc and Schost, Eric and Wu, Wenyuan and Xie, Yuzhen},
 booktitle = {I{SSAC}'05},
 doi = {10.1145/1073884.1073901},
 pages = {108--115},
 publisher = {ACM, New York},
 title = {Lifting techniques for triangular decompositions},
 url = {http://dx.doi.org/10.1145/1073884.1073901},
 year = {2005}
}

[ 19 ]
Schost, Éric. Multivariate power series multiplication. In ISSAC'05, pages 293-300. ACM, New York, 2005. [ http ]
@incollection{MR2280560,
 author = {Schost, \'Eric},
 booktitle = {I{SSAC}'05},
 doi = {10.1145/1073884.1073925},
 pages = {293--300},
 publisher = {ACM, New York},
 title = {Multivariate power series multiplication},
 url = {http://dx.doi.org/10.1145/1073884.1073925},
 year = {2005}
}



[ 2004 ]


[ 18 ]
Mohab Safey El Din and Éric Schost. Properness defects of projections and computation of at least one point in each connected component of a real algebraic set. Discrete & Computational Geometry, 32:417-430, 2004. [ http ]
@article{DBLP:journals/dcg/DinS04,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 journal = {Discrete {\&} Computational Geometry},
 pages = {417--430},
 title = {Properness Defects of Projections and Computation of at Least One
Point in Each Connected Component of a Real Algebraic Set},
 url = {http://www.springerlink.com/index/10.1007/s00454-004-1107-5},
 volume = {32},
 year = {2004}
}

[ 17 ]
Alin Bostan and Éric Schost. On the complexities of multipoint evaluation and interpolation. Theor. Comput. Sci., 329:223-235, 2004. [ http ]
@article{DBLP:journals/tcs/BostanS04,
 author = {Alin Bostan and
{\'{E}}ric Schost},
 doi = {10.1016/j.tcs.2004.09.002},
 journal = {Theor. Comput. Sci.},
 pages = {223--235},
 title = {On the complexities of multipoint evaluation and interpolation},
 url = {http://dx.doi.org/10.1016/j.tcs.2004.09.002},
 volume = {329},
 year = {2004}
}

[ 16 ]
Safey El Din, Mohab and Schost, Éric. Properness defects of projections and computation of at least one point in each connected component of a real algebraic set. Discrete Comput. Geom., 32:417-430, 2004. [ http ]
@article{MR2081634,
 author = {Safey El Din, Mohab and Schost, \'Eric},
 doi = {10.1007/s00454-004-1107-5},
 journal = {Discrete Comput. Geom.},
 pages = {417--430},
 title = {Properness defects of projections and computation of at least
one point in each connected component of a real algebraic set},
 url = {http://dx.doi.org/10.1007/s00454-004-1107-5},
 volume = {32},
 year = {2004}
}

[ 15 ]
Kulesz, L., Matera, G., and Schost, E. Uniform bounds on the number of rational points of a family of curves of genus 2. J. Number Theory, 108:241-267, 2004. [ http ]
@article{MR2098638,
 author = {Kulesz, L. and Matera, G. and Schost, E.},
 doi = {10.1016/j.jnt.2004.05.013},
 journal = {J. Number Theory},
 pages = {241--267},
 title = {Uniform bounds on the number of rational points of a family of
curves of genus 2},
 url = {http://dx.doi.org/10.1016/j.jnt.2004.05.013},
 volume = {108},
 year = {2004}
}

[ 14 ]
Bostan, A., Lecerf, G., Salvy, B., Schost, É., and Wiebelt, B. Complexity issues in bivariate polynomial factorization. In ISSAC 2004, pages 42-49. ACM, New York, 2004. [ http ]
@incollection{MR2126923,
 author = {Bostan, A. and Lecerf, G. and Salvy, B. and Schost, \'E. and
Wiebelt, B.},
 booktitle = {I{SSAC} 2004},
 doi = {10.1145/1005285.1005294},
 pages = {42--49},
 publisher = {ACM, New York},
 title = {Complexity issues in bivariate polynomial factorization},
 url = {http://dx.doi.org/10.1145/1005285.1005294},
 year = {2004}
}

[ 13 ]
Dahan, Xavier and Schost, Éric. Sharp estimates for triangular sets. In ISSAC 2004, pages 103-110. ACM, New York, 2004. [ http ]
@incollection{MR2126931,
 author = {Dahan, Xavier and Schost, \'Eric},
 booktitle = {I{SSAC} 2004},
 doi = {10.1145/1005285.1005302},
 pages = {103--110},
 publisher = {ACM, New York},
 title = {Sharp estimates for triangular sets},
 url = {http://dx.doi.org/10.1145/1005285.1005302},
 year = {2004}
}

[ 12 ]
Gaudry, Pierrick and Schost, Éric. A low-memory parallel version of Matsuo, Chao, and Tsujii's algorithm. In Algorithmic number theory, volume 3076, pages 208-222. Springer, Berlin, 2004. [ http ]
@incollection{MR2137355,
 author = {Gaudry, Pierrick and Schost, \'Eric},
 booktitle = {Algorithmic number theory},
 doi = {10.1007/978-3-540-24847-7_15},
 pages = {208--222},
 publisher = {Springer, Berlin},
 title = {A low-memory parallel version of {M}atsuo, {C}hao, and
{T}sujii's algorithm},
 url = {http://dx.doi.org/10.1007/978-3-540-24847-7_15},
 volume = {3076},
 year = {2004}
}

[ 11 ]
Gaudry, Pierrick and Schost, Éric. Construction of secure random curves of genus 2 over prime fields. In Advances in cryptology-EUROCRYPT 2004, volume 3027, pages 239-256. Springer, Berlin, 2004. [ http ]
@incollection{MR2153176,
 author = {Gaudry, Pierrick and Schost, \'Eric},
 booktitle = {Advances in cryptology---{EUROCRYPT} 2004},
 doi = {10.1007/978-3-540-24676-3_15},
 pages = {239--256},
 publisher = {Springer, Berlin},
 title = {Construction of secure random curves of genus 2 over prime
fields},
 url = {http://dx.doi.org/10.1007/978-3-540-24676-3_15},
 volume = {3027},
 year = {2004}
}



[ 2003 ]


[ 10 ]
Alin Bostan, Bruno Salvy, and Éric Schost. Fast algorithms for zero-dimensional polynomial systems using duality. Appl. Algebra Eng. Commun. Comput., 14:239-272, 2003. [ http ]
@article{DBLP:journals/aaecc/BostanSS03,
 author = {Alin Bostan and
Bruno Salvy and
{\'{E}}ric Schost},
 doi = {10.1007/s00200-003-0133-5},
 journal = {Appl. Algebra Eng. Commun. Comput.},
 pages = {239--272},
 title = {Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality},
 url = {http://dx.doi.org/10.1007/s00200-003-0133-5},
 volume = {14},
 year = {2003}
}

[ 9 ]
Éric Schost. Computing parametric geometric resolutions. Appl. Algebra Eng. Commun. Comput., 13:349-393, 2003. [ http ]
@article{DBLP:journals/aaecc/Schost03,
 author = {{\'{E}}ric Schost},
 doi = {10.1007/s00200-002-0109-x},
 journal = {Appl. Algebra Eng. Commun. Comput.},
 pages = {349--393},
 title = {Computing Parametric Geometric Resolutions},
 url = {http://dx.doi.org/10.1007/s00200-002-0109-x},
 volume = {13},
 year = {2003}
}

[ 8 ]
Éric Schost. Complexity results for triangular sets. J. Symb. Comput., 36:555-594, 2003. [ http ]
@article{DBLP:journals/jsc/Schost03,
 author = {{\'{E}}ric Schost},
 doi = {10.1016/S0747-7171(03)00095-6},
 journal = {J. Symb. Comput.},
 pages = {555--594},
 title = {Complexity results for triangular sets},
 url = {http://dx.doi.org/10.1016/S0747-7171(03)00095-6},
 volume = {36},
 year = {2003}
}

[ 7 ]
Alin Bostan, Pierrick Gaudry, and Éric Schost. Linear recurrences with polynomial coefficients and computation of the cartier-manin operator on hyperelliptic curves. In Gary L. Mullen, Alain Poli, and Henning Stichtenoth, editors, Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers, volume 2948, pages 40-58. Springer, 2003. [ http ]
@inproceedings{DBLP:conf/fq/BostanGS03,
 author = {Alin Bostan and
Pierrick Gaudry and
{\'{E}}ric Schost},
 booktitle = {Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers},
 doi = {10.1007/978-3-540-24633-6_4},
 editor = {Gary L. Mullen and
Alain Poli and
Henning Stichtenoth},
 pages = {40--58},
 publisher = {Springer},
 title = {Linear Recurrences with Polynomial Coefficients and Computation of
the Cartier-Manin Operator on Hyperelliptic Curves},
 url = {http://dx.doi.org/10.1007/978-3-540-24633-6_4},
 volume = {2948},
 year = {2003}
}

[ 6 ]
Alin Bostan, Grégoire Lecerf, and Éric Schost. Tellegen's principle into practice. In J. Rafael Sendra, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pages 37-44. ACM, 2003. [ http ]
@inproceedings{DBLP:conf/issac/BostanLS03,
 author = {Alin Bostan and
Gr{\'{e}}goire Lecerf and
{\'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings},
 doi = {10.1145/860854.860870},
 editor = {J. Rafael Sendra},
 pages = {37--44},
 publisher = {ACM},
 title = {Tellegen's principle into practice},
 url = {http://doi.acm.org/10.1145/860854.860870},
 year = {2003}
}

[ 5 ]
Mohab Safey El Din and Éric Schost. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In J. Rafael Sendra, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pages 224-231. ACM, 2003. [ http ]
@inproceedings{DBLP:conf/issac/DinS03,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings},
 doi = {10.1145/860854.860901},
 editor = {J. Rafael Sendra},
 pages = {224--231},
 publisher = {ACM},
 title = {Polar varieties and computation of one point in each connected component
of a smooth real algebraic set},
 url = {http://doi.acm.org/10.1145/860854.860901},
 year = {2003}
}



[ 2002 ]


[ 4 ]
Éric Schost. Degree bounds and lifting techniques for triangular sets. In Teo Mora, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pages 238-245. ACM, 2002. [ http ]
@inproceedings{DBLP:conf/issac/Schost02,
 author = {{\'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2002, Lille, France, July 7-10, 2002, Proceedings},
 doi = {10.1145/780506.780537},
 editor = {Teo Mora},
 pages = {238--245},
 publisher = {ACM},
 title = {Degree bounds and lifting techniques for triangular sets},
 url = {http://doi.acm.org/10.1145/780506.780537},
 year = {2002}
}



[ 2001 ]


[ 3 ]
Gaudry, P. and Schost, É. On the invariants of the quotients of the Jacobian of a curve of genus 2. In Applied algebra, algebraic algorithms and error-correcting codes (Melbourne, 2001), volume 2227, pages 373-386. Springer, Berlin, 2001. [ http ]
@incollection{MR1913484,
 author = {Gaudry, P. and Schost, \'E.},
 booktitle = {Applied algebra, algebraic algorithms and error-correcting
codes ({M}elbourne, 2001)},
 doi = {10.1007/3-540-45624-4_39},
 pages = {373--386},
 publisher = {Springer, Berlin},
 title = {On the invariants of the quotients of the {J}acobian of a
curve of genus 2},
 url = {http://dx.doi.org/10.1007/3-540-45624-4_39},
 volume = {2227},
 year = {2001}
}



[ 2000 ]


[ 2 ]
Fabrice Rouillier, Mohab Safey El Din, and Éric Schost. Solving the birkhoff interpolation problem via the critical point method: An experimental study. In Jürgen Richter-Gebert and Dongming Wang, editors, Automated Deduction in Geometry, Third International Workshop, ADG 2000, Zurich, Switzerland, September 25-27, 2000, Revised Papers, volume 2061, pages 26-40. Springer, 2000. [ http ]
@inproceedings{DBLP:conf/adg/RouillierDS00,
 author = {Fabrice Rouillier and
Mohab Safey El Din and
{\'{E}}ric Schost},
 booktitle = {Automated Deduction in Geometry, Third International Workshop, {ADG}
2000, Zurich, Switzerland, September 25-27, 2000, Revised Papers},
 doi = {10.1007/3-540-45410-1_3},
 editor = {J{\"{u}}rgen Richter{-}Gebert and
Dongming Wang},
 pages = {26--40},
 publisher = {Springer},
 title = {Solving the Birkhoff Interpolation Problem via the Critical Point
Method: An Experimental Study},
 url = {http://dx.doi.org/10.1007/3-540-45410-1_3},
 volume = {2061},
 year = {2000}
}



[ 1999 ]


[ 1 ]
Marc Giusti and Éric Schost. Solving some overdetermined polynomial systems. In Keith O. Geddes, Bruno Salvy, and Samuel S. Dooley, editors, Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC '99, Vancouver, B.C., Canada, July 29-31, 1999, pages 1-8. ACM, 1999. [ http ]
@inproceedings{DBLP:conf/issac/GiustiS99,
 author = {Marc Giusti and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the 1999 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '99, Vancouver, B.C., Canada, July 29-31, 1999},
 doi = {10.1145/309831.309838},
 editor = {Keith O. Geddes and
Bruno Salvy and
Samuel S. Dooley},
 pages = {1--8},
 publisher = {ACM},
 title = {Solving Some Overdetermined Polynomial Systems},
 url = {http://doi.acm.org/10.1145/309831.309838},
 year = {1999}
}



[ 1998 ]




[ 1997 ]