[ 2018 ]


[ 134 ]
Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Solving determinantal systems using homotopy techniques. CoRR, abs/1802.10409, 2018. [ http ]
@article{DBLP:journals/corr/abs-1802-10409,
 author = {Jonathan D. Hauenstein and
Mohab Safey El Din and
{'{E}}ric Schost and
Thi Xuan Vu},
 journal = {CoRR},
 title = {Solving determinantal systems using homotopy techniques},
 url = {http://arxiv.org/abs/1802.10409},
 volume = {abs/1802.10409},
 year = {2018}
}

[ 133 ]
Mohab Safey El Din and Éric Schost. Bit complexity for multi-homogeneous polynomial system solving - application to polynomial minimization. J. Symb. Comput., 87:176--206, 2018. [ http ]
@article{DBLP:journals/jsc/DinS18,
 author = {Mohab Safey El Din and
{'{E}}ric Schost},
 doi = {10.1016/j.jsc.2017.08.001},
 journal = {J. Symb. Comput.},
 pages = {176--206},
 title = {Bit complexity for multi-homogeneous polynomial system solving - Application
to polynomial minimization},
 url = {https://doi.org/10.1016/j.jsc.2017.08.001},
 volume = {87},
 year = {2018}
}

[ 132 ]
Dorian Nogneng and Éric Schost. On the evaluation of some sparse polynomials. Math. Comput., 87:893--904, 2018. [ http ]
@article{DBLP:journals/moc/NognengS18,
 author = {Dorian Nogneng and
{'{E}}ric Schost},
 doi = {10.1090/mcom/3231},
 journal = {Math. Comput.},
 pages = {893--904},
 title = {On the evaluation of some sparse polynomials},
 url = {https://doi.org/10.1090/mcom/3231},
 volume = {87},
 year = {2018}
}



[ 2017 ]


[ 131 ]
Javad Doliskani, Anand Kumar Narayanan, and Éric Schost. Drinfeld modules with complex multiplication, hasse invariants and factoring polynomials over finite fields. CoRR, abs/1712.00669, 2017. [ http ]
@article{DBLP:journals/corr/abs-1712-00669,
 author = {Javad Doliskani and
Anand Kumar Narayanan and
{'{E}}ric Schost},
 journal = {CoRR},
 title = {Drinfeld Modules with Complex Multiplication, Hasse Invariants and
Factoring Polynomials over Finite Fields},
 url = {http://arxiv.org/abs/1712.00669},
 volume = {abs/1712.00669},
 year = {2017}
}

[ 130 ]
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, and Éric Schost. Block-krylov techniques in the context of sparse-fglm algorithms. CoRR, abs/1712.04177, 2017. [ http ]
@article{DBLP:journals/corr/abs-1712-04177,
 author = {Seung Gyu Hyun and
Vincent Neiger and
Hamid Rahkooy and
{'{E}}ric Schost},
 journal = {CoRR},
 title = {Block-Krylov techniques in the context of sparse-FGLM algorithms},
 url = {http://arxiv.org/abs/1712.04177},
 volume = {abs/1712.04177},
 year = {2017}
}

[ 129 ]
Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, and Éric Schost. On matrices with displacement structure: generalized operators and faster algorithms. CoRR, abs/1703.03734, 2017. [ http ]
@article{DBLP:journals/corr/BostanJMS17,
 author = {Alin Bostan and
Claude{-}Pierre Jeannerod and
Christophe Mouilleron and
{'{E}}ric Schost},
 journal = {CoRR},
 title = {On matrices with displacement structure: generalized operators and
faster algorithms},
 url = {http://arxiv.org/abs/1703.03734},
 volume = {abs/1703.03734},
 year = {2017}
}

[ 128 ]
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, and Éric Schost. Computing isomorphisms and embeddings of finite fields. CoRR, abs/1705.01221, 2017. [ http ]
@article{DBLP:journals/corr/BrieulleFDFS17,
 author = {Ludovic Brieulle and
Luca De Feo and
Javad Doliskani and
Jean{-}Pierre Flori and
{'{E}}ric Schost},
 journal = {CoRR},
 title = {Computing isomorphisms and embeddings of finite fields},
 url = {http://arxiv.org/abs/1705.01221},
 volume = {abs/1705.01221},
 year = {2017}
}

[ 127 ]
Vincent Neiger, Hamid Rahkooy, and Éric Schost. Algorithms for zero-dimensional ideals using linear recurrent sequences. CoRR, abs/1707.01971, 2017. [ http ]
@article{DBLP:journals/corr/NeigerRS17aa,
 author = {Vincent Neiger and
Hamid Rahkooy and
{'{E}}ric Schost},
 journal = {CoRR},
 title = {Algorithms for zero-dimensional ideals using linear recurrent sequences},
 url = {http://arxiv.org/abs/1707.01971},
 volume = {abs/1707.01971},
 year = {2017}
}

[ 126 ]
Vincent Neiger, Johan Rosenkilde, and Éric Schost. Fast computation of the roots of polynomials over the ring of power series. CoRR, abs/1705.10658, 2017. [ http ]
@article{DBLP:journals/corr/NeigerRS17,
 author = {Vincent Neiger and
Johan Rosenkilde and
{'{E}}ric Schost},
 journal = {CoRR},
 title = {Fast Computation of the Roots of Polynomials Over the Ring of Power
Series},
 url = {http://arxiv.org/abs/1705.10658},
 volume = {abs/1705.10658},
 year = {2017}
}

[ 125 ]
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}
}

[ 124 ]
Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, and Gilles Villard. Computing minimal interpolation bases. J. Symb. Comput., 83:272--314, 2017. [ http ]
@article{DBLP:journals/jsc/JeannerodNSV17,
 author = {Claude{-}Pierre Jeannerod and
Vincent Neiger and
{'{E}}ric Schost and
Gilles Villard},
 doi = {10.1016/j.jsc.2016.11.015},
 journal = {J. Symb. Comput.},
 pages = {272--314},
 title = {Computing minimal interpolation bases},
 url = {https://doi.org/10.1016/j.jsc.2016.11.015},
 volume = {83},
 year = {2017}
}

[ 123 ]
Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, and Éric Schost. On matrices with displacement structure: Generalized operators and faster algorithms. SIAM J. Matrix Analysis Applications, 38:733--775, 2017. [ http ]
@article{DBLP:journals/siammax/BostanJMS17,
 author = {Alin Bostan and
Claude{-}Pierre Jeannerod and
Christophe Mouilleron and
{'{E}}ric Schost},
 doi = {10.1137/16M1062855},
 journal = {{SIAM} J. Matrix Analysis Applications},
 pages = {733--775},
 title = {On Matrices With Displacement Structure: Generalized Operators and
Faster Algorithms},
 url = {https://doi.org/10.1137/16M1062855},
 volume = {38},
 year = {2017}
}

[ 122 ]
Vincent Neiger, Hamid Rahkooy, and Éric Schost. Algorithms for zero-dimensional ideals using linear recurrent sequences. In Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 19th International Workshop, CASC 2017, Beijing, China, September 18-22, 2017, Proceedings, volume 10490, pages 313--328. Springer, 2017. [ http ]
@inproceedings{DBLP:conf/casc/NeigerRS17,
 author = {Vincent Neiger and
Hamid Rahkooy and
{'{E}}ric Schost},
 booktitle = {Computer Algebra in Scientific Computing - 19th International Workshop,
{CASC} 2017, Beijing, China, September 18-22, 2017, Proceedings},
 doi = {10.1007/978-3-319-66320-3_23},
 editor = {Vladimir P. Gerdt and
Wolfram Koepf and
Werner M. Seiler and
Evgenii V. Vorozhtsov},
 pages = {313--328},
 publisher = {Springer},
 title = {Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences},
 url = {https://doi.org/10.1007/978-3-319-66320-3_23},
 volume = {10490},
 year = {2017}
}

[ 121 ]
Seung Gyu Hyun, Romain Lebreton, and Éric Schost. Algorithms for structured linear systems solving and their implementation. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, pages 205--212. ACM, 2017. [ http ]
@inproceedings{DBLP:conf/issac/HyunLS17,
 author = {Seung Gyu Hyun and
Romain Lebreton and
{'{E}}ric Schost},
 booktitle = {Proceedings of the 2017 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2017, Kaiserslautern, Germany,
July 25-28, 2017},
 doi = {10.1145/3087604.3087659},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {205--212},
 publisher = {{ACM}},
 title = {Algorithms for Structured Linear Systems Solving and Their Implementation},
 url = {http://doi.acm.org/10.1145/3087604.3087659},
 year = {2017}
}

[ 120 ]
Angelos Mantzaflaris, Éric Schost, and Elias P. Tsigaridas. Sparse rational univariate representation. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, pages 301--308. ACM, 2017. [ http ]
@inproceedings{DBLP:conf/issac/MantzaflarisST17,
 author = {Angelos Mantzaflaris and
{'{E}}ric Schost and
Elias P. Tsigaridas},
 booktitle = {Proceedings of the 2017 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2017, Kaiserslautern, Germany,
July 25-28, 2017},
 doi = {10.1145/3087604.3087653},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {301--308},
 publisher = {{ACM}},
 title = {Sparse Rational Univariate Representation},
 url = {http://doi.acm.org/10.1145/3087604.3087653},
 year = {2017}
}

[ 119 ]
Vincent Neiger, Johan Rosenkilde, and Éric Schost. Fast computation of the roots of polynomials over the ring of power series. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, pages 349--356. ACM, 2017. [ http ]
@inproceedings{DBLP:conf/issac/NeigerRS17,
 author = {Vincent Neiger and
Johan Rosenkilde and
{'{E}}ric Schost},
 booktitle = {Proceedings of the 2017 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2017, Kaiserslautern, Germany,
July 25-28, 2017},
 doi = {10.1145/3087604.3087642},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {349--356},
 publisher = {{ACM}},
 title = {Fast Computation of the Roots of Polynomials Over the Ring of Power
Series},
 url = {http://doi.acm.org/10.1145/3087604.3087642},
 year = {2017}
}



[ 2016 ]


[ 118 ]
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}
}

[ 117 ]
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}
}

[ 116 ]
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}
}

[ 115 ]
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}
}

[ 114 ]
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}
}

[ 113 ]
É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 = {https://doi.org/10.1007/s10208-015-9256-x},
 volume = {16},
 year = {2016}
}

[ 112 ]
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 = {https://doi.org/10.1016/j.jco.2015.11.009},
 volume = {34},
 year = {2016}
}

[ 111 ]
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 = {https://doi.org/10.1016/j.jsc.2015.03.001},
 volume = {72},
 year = {2016}
}

[ 110 ]
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}
}

[ 109 ]
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}
}

[ 108 ]
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 ]


[ 107 ]
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}
}

[ 106 ]
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}
}

[ 105 ]
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 = {https://doi.org/10.1007/s10623-013-9875-7},
 volume = {74},
 year = {2015}
}

[ 104 ]
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 = {https://doi.org/10.1109/TIT.2015.2416068},
 volume = {61},
 year = {2015}
}

[ 103 ]
Parisa Alvandi, Marc Moreno Maza, Éric Schost, and Paul Vrbik. A standard basis free algorithm for computing the tangent cones of a space curve. In Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 17th International Workshop, CASC 2015, Aachen, Germany, September 14-18, 2015, Proceedings, volume 9301, pages 45--60. Springer, 2015. [ http ]
@inproceedings{DBLP:conf/casc/AlvandiMSV15,
 author = {Parisa Alvandi and
Marc Moreno Maza and
{'{E}}ric Schost and
Paul Vrbik},
 booktitle = {Computer Algebra in Scientific Computing - 17th International Workshop,
{CASC} 2015, Aachen, Germany, September 14-18, 2015, Proceedings},
 doi = {10.1007/978-3-319-24021-3_4},
 editor = {Vladimir P. Gerdt and
Wolfram Koepf and
Werner M. Seiler and
Evgenii V. Vorozhtsov},
 pages = {45--60},
 publisher = {Springer},
 title = {A Standard Basis Free Algorithm for Computing the Tangent Cones of
a Space Curve},
 url = {https://doi.org/10.1007/978-3-319-24021-3_4},
 volume = {9301},
 year = {2015}
}

[ 102 ]
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}
}

[ 101 ]
É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 ]


[ 100 ]
Andrew Arnold and Éric Schost. A truncated fourier transform middle product. ACM Comm. Computer Algebra, 48:98--99, 2014. [ http ]
@article{DBLP:journals/cca/ArnoldS14,
 author = {Andrew Arnold and
{'{E}}ric Schost},
 doi = {10.1145/2733693.2733698},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {98--99},
 title = {A Truncated Fourier Transform middle product},
 url = {http://doi.acm.org/10.1145/2733693.2733698},
 volume = {48},
 year = {2014}
}

[ 99 ]
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}
}

[ 98 ]
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}
}

[ 97 ]
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 = {https://doi.org/10.1007/s10208-014-9212-1},
 volume = {14},
 year = {2014}
}

[ 96 ]
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 = {https://doi.org/10.1090/S0025-5718-2013-02715-9},
 volume = {83},
 year = {2014}
}

[ 95 ]
Parisa Alvandi, Changbo Chen, Steffen Marcus, Marc Moreno Maza, Éric Schost, and Paul Vrbik. Doing algebraic geometry with the regularchains library. In Hoon Hong and Chee Yap, editors, Mathematical Software - ICMS 2014 - 4th International Congress, Seoul, South Korea, August 5-9, 2014. Proceedings, volume 8592, pages 472--479. Springer, 2014. [ http ]
@inproceedings{DBLP:conf/icms/AlvandiCMMSV14,
 author = {Parisa Alvandi and
Changbo Chen and
Steffen Marcus and
Marc Moreno Maza and
{'{E}}ric Schost and
Paul Vrbik},
 booktitle = {Mathematical Software - {ICMS} 2014 - 4th International Congress,
Seoul, South Korea, August 5-9, 2014. Proceedings},
 doi = {10.1007/978-3-662-44199-2_71},
 editor = {Hoon Hong and
Chee Yap},
 pages = {472--479},
 publisher = {Springer},
 title = {Doing Algebraic Geometry with the RegularChains Library},
 url = {https://doi.org/10.1007/978-3-662-44199-2_71},
 volume = {8592},
 year = {2014}
}

[ 94 ]
Alin Bostan, Xavier Caruso, and Éric Schost. A fast algorithm for computing the characteristic polynomial of the p-curvature. In Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, and Ágnes Szántó, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014, pages 59--66. ACM, 2014. [ http ]
@inproceedings{DBLP:conf/issac/BostanCS14,
 author = {Alin Bostan and
Xavier Caruso and
{'{E}}ric Schost},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, {ISSAC}
'14, Kobe, Japan, July 23-25, 2014},
 doi = {10.1145/2608628.2608650},
 editor = {Katsusuke Nabeshima and
Kosaku Nagasaka and
Franz Winkler and
{'{A}}gnes Sz{'{a}}nt{'{o}}},
 pages = {59--66},
 publisher = {{ACM}},
 title = {A fast algorithm for computing the characteristic polynomial of the
p-curvature},
 url = {http://doi.acm.org/10.1145/2608628.2608650},
 year = {2014}
}

[ 93 ]
Luca De Feo, Javad Doliskani, and Éric Schost. Fast arithmetic for the algebraic closure of finite fields. In Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, and Ágnes Szántó, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014, pages 122--129. ACM, 2014. [ http ]
@inproceedings{DBLP:conf/issac/FeoDS14,
 author = {Luca De Feo and
Javad Doliskani and
{'{E}}ric Schost},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, {ISSAC}
'14, Kobe, Japan, July 23-25, 2014},
 doi = {10.1145/2608628.2608672},
 editor = {Katsusuke Nabeshima and
Kosaku Nagasaka and
Franz Winkler and
{'{A}}gnes Sz{'{a}}nt{'{o}}},
 pages = {122--129},
 publisher = {{ACM}},
 title = {Fast arithmetic for the algebraic closure of finite fields},
 url = {http://doi.acm.org/10.1145/2608628.2608672},
 year = {2014}
}



[ 2013 ]


[ 92 ]
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 = {https://doi.org/10.1007/s00200-012-0179-3},
 volume = {24},
 year = {2013}
}

[ 91 ]
Éric Schost and Pierre-Jean Spaenlehauer. Newton-like iteration for determinantal systems and structured low rank approximation. ACM Comm. Computer Algebra, 47:96--97, 2013. [ http ]
@article{DBLP:journals/cca/SchostS13,
 author = {{'{E}}ric Schost and
Pierre{-}Jean Spaenlehauer},
 doi = {10.1145/2576802.2576811},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {96--97},
 title = {Newton-like iteration for determinantal systems and structured low
rank approximation},
 url = {http://doi.acm.org/10.1145/2576802.2576811},
 volume = {47},
 year = {2013}
}

[ 90 ]
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 = {https://doi.org/10.1007/s00037-013-0063-y},
 volume = {22},
 year = {2013}
}

[ 89 ]
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}
}

[ 88 ]
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}
}

[ 87 ]
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}
}

[ 86 ]
É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}
}

[ 85 ]
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 = {https://doi.org/10.1016/j.jsc.2012.06.005},
 volume = {52},
 year = {2013}
}

[ 84 ]
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 = {https://doi.org/10.1016/j.jsc.2012.05.008},
 volume = {50},
 year = {2013}
}

[ 83 ]
Luca De Feo, Javad Doliskani, and Éric Schost. Fast algorithms for l-adic towers over finite fields. In Manuel Kauers, editor, International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013, pages 165--172. ACM, 2013. [ http ]
@inproceedings{DBLP:conf/issac/FeoDS13,
 author = {Luca De Feo and
Javad Doliskani and
{'{E}}ric Schost},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'13,
Boston, MA, USA, June 26-29, 2013},
 doi = {10.1145/2465506.2465956},
 editor = {Manuel Kauers},
 pages = {165--172},
 publisher = {{ACM}},
 title = {Fast algorithms for mph{l}-adic towers over finite fields},
 url = {http://doi.acm.org/10.1145/2465506.2465956},
 year = {2013}
}

[ 82 ]
Joris van der Hoeven, Romain Lebreton, and Éric Schost. Structured FFT and TFT: symmetric and lattice polynomials. In Manuel Kauers, editor, International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013, pages 355--362. ACM, 2013. [ http ]
@inproceedings{DBLP:conf/issac/HoevenLS13,
 author = {Joris van der Hoeven and
Romain Lebreton and
{'{E}}ric Schost},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'13,
Boston, MA, USA, June 26-29, 2013},
 doi = {10.1145/2465506.2465526},
 editor = {Manuel Kauers},
 pages = {355--362},
 publisher = {{ACM}},
 title = {Structured {FFT} and {TFT:} symmetric and lattice polynomials},
 url = {http://doi.acm.org/10.1145/2465506.2465526},
 year = {2013}
}

[ 81 ]
Romain Lebreton, Esmaeil Mehrabi, and Éric Schost. On the complexity of solving bivariate systems: the case of non-singular solutions. In Manuel Kauers, editor, International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013, pages 251--258. ACM, 2013. [ http ]
@inproceedings{DBLP:conf/issac/LebretonMS13,
 author = {Romain Lebreton and
Esmaeil Mehrabi and
{'{E}}ric Schost},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'13,
Boston, MA, USA, June 26-29, 2013},
 doi = {10.1145/2465506.2465950},
 editor = {Manuel Kauers},
 pages = {251--258},
 publisher = {{ACM}},
 title = {On the complexity of solving bivariate systems: the case of non-singular
solutions},
 url = {http://doi.acm.org/10.1145/2465506.2465950},
 year = {2013}
}



[ 2012 ]


[ 80 ]
Romain Lebreton, Esmaeil Mehrabi, and Éric Schost. On the complexity of computing certain resultants. ACM Comm. Computer Algebra, 46:108--109, 2012. [ http ]
@article{DBLP:journals/cca/LebretonMS12,
 author = {Romain Lebreton and
Esmaeil Mehrabi and
{'{E}}ric Schost},
 doi = {10.1145/2429135.2429157},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {108--109},
 title = {On the complexity of computing certain resultants},
 url = {http://doi.acm.org/10.1145/2429135.2429157},
 volume = {46},
 year = {2012}
}

[ 79 ]
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}
}

[ 78 ]
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}
}

[ 77 ]
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 = {https://doi.org/10.1016/j.jco.2011.05.001},
 volume = {28},
 year = {2012}
}

[ 76 ]
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 = {https://doi.org/10.1016/j.jsc.2011.12.008},
 volume = {47},
 year = {2012}
}

[ 75 ]
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 = {https://doi.org/10.1016/j.jsc.2011.09.003},
 volume = {47},
 year = {2012}
}

[ 74 ]
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 = {https://doi.org/10.1007/978-3-642-32973-9_19},
 volume = {7442},
 year = {2012}
}

[ 73 ]
Alin Bostan, Bruno Salvy, Muhammad F. I. Chowdhury, Éric Schost, and Romain Lebreton. Power series solutions of singular (q)-differential equations. In Joris van der Hoeven and Mark van Hoeij, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012, pages 107--114. ACM, 2012. [ http ]
@inproceedings{DBLP:conf/issac/BostanSCSL12,
 author = {Alin Bostan and
Bruno Salvy and
Muhammad F. I. Chowdhury and
{'{E}}ric Schost and
Romain Lebreton},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'12,
Grenoble, France - July 22 - 25, 2012},
 doi = {10.1145/2442829.2442848},
 editor = {Joris van der Hoeven and
Mark van Hoeij},
 pages = {107--114},
 publisher = {{ACM}},
 title = {Power series solutions of singular (q)-differential equations},
 url = {http://doi.acm.org/10.1145/2442829.2442848},
 year = {2012}
}

[ 72 ]
Romain Lebreton and Éric Schost. Algorithms for the universal decomposition algebra. In Joris van der Hoeven and Mark van Hoeij, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012, pages 234--241. ACM, 2012. [ http ]
@inproceedings{DBLP:conf/issac/LebretonS12,
 author = {Romain Lebreton and
{'{E}}ric Schost},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'12,
Grenoble, France - July 22 - 25, 2012},
 doi = {10.1145/2442829.2442864},
 editor = {Joris van der Hoeven and
Mark van Hoeij},
 pages = {234--241},
 publisher = {{ACM}},
 title = {Algorithms for the universal decomposition algebra},
 url = {http://doi.acm.org/10.1145/2442829.2442864},
 year = {2012}
}



[ 2011 ]


[ 71 ]
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}
}

[ 70 ]
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}
}

[ 69 ]
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 = {https://doi.org/10.1007/s00454-009-9239-2},
 volume = {45},
 year = {2011}
}

[ 68 ]
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 = {https://doi.org/10.1016/j.jsc.2011.08.015},
 volume = {46},
 year = {2011}
}

[ 67 ]
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 = {https://doi.org/10.1016/j.jsc.2010.08.016},
 volume = {46},
 year = {2011}
}

[ 66 ]
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 = {https://doi.org/10.1016/j.tcs.2010.12.012},
 volume = {412},
 year = {2011}
}

[ 65 ]
É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 ]


[ 64 ]
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 = {https://doi.org/10.1007/s00200-009-0117-1},
 volume = {21},
 year = {2010}
}

[ 63 ]
Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, and Éric Schost. Complexity and performance results for non fft-based univariate polynomial multiplication. ACM Comm. Computer Algebra, 44:99--100, 2010. [ http ]
@article{DBLP:journals/cca/ChowdhuryMPS10,
 author = {Muhammad F. I. Chowdhury and
Marc Moreno Maza and
Wei Pan and
{'{E}}ric Schost},
 doi = {10.1145/1940475.1940484},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {99--100},
 title = {Complexity and performance results for non FFT-based univariate polynomial
multiplication},
 url = {http://doi.acm.org/10.1145/1940475.1940484},
 volume = {44},
 year = {2010}
}

[ 62 ]
Xavier Dahan, Marc Moreno Maza, Éric Schost, and Adrien Poteaux. Almost linear time operations with triangular sets. ACM Comm. Computer Algebra, 44:103--104, 2010. [ http ]
@article{DBLP:journals/cca/DahanMSP10,
 author = {Xavier Dahan and
Marc Moreno Maza and
{'{E}}ric Schost and
Adrien Poteaux},
 doi = {10.1145/1940475.1940486},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {103--104},
 title = {Almost linear time operations with triangular sets},
 url = {http://doi.acm.org/10.1145/1940475.1940486},
 volume = {44},
 year = {2010}
}

[ 61 ]
Charles-Éric Drevet, Md. Nazrul Islam, and Éric Schost. Optimization techniques for small matrix multiplication. ACM Comm. Computer Algebra, 44:107--108, 2010. [ http ]
@article{DBLP:journals/cca/DrevetIS10,
 author = {Charles{-}{'{E}}ric Drevet and
Md. Nazrul Islam and
{'{E}}ric Schost},
 doi = {10.1145/1940475.1940488},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {107--108},
 title = {Optimization techniques for small matrix multiplication},
 url = {http://doi.acm.org/10.1145/1940475.1940488},
 volume = {44},
 year = {2010}
}

[ 60 ]
Luca De Feo and Éric Schost. transalpyne: a language for automatic transposition. ACM Comm. Computer Algebra, 44:105--106, 2010. [ http ]
@article{DBLP:journals/cca/FeoS10a,
 author = {Luca De Feo and
{'{E}}ric Schost},
 doi = {10.1145/1940475.1940487},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {105--106},
 title = {transalpyne: a language for automatic transposition},
 url = {http://doi.acm.org/10.1145/1940475.1940487},
 volume = {44},
 year = {2010}
}

[ 59 ]
Luca De Feo and Éric Schost. transalpyne: a language for automatic transposition. ACM Comm. Computer Algebra, 44:59--71, 2010. [ http ]
@article{DBLP:journals/cca/FeoS10,
 author = {Luca De Feo and
{'{E}}ric Schost},
 doi = {10.1145/1838599.1838624},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {59--71},
 title = {transalpyne: a language for automatic transposition},
 url = {http://doi.acm.org/10.1145/1838599.1838624},
 volume = {44},
 year = {2010}
}

[ 58 ]
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}
}

[ 57 ]
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}
}



[ 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 = {https://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 = {https://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 = {https://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 = {https://doi.org/10.1016/j.tcs.2009.03.030},
 volume = {410},
 year = {2009}
}

[ 49 ]
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 = {https://doi.org/10.1007/978-3-642-04103-7_6},
 volume = {5743},
 year = {2009}
}

[ 48 ]
Alin Bostan and Éric Schost. Fast algorithms for differential equations in positive characteristic. In Jeremy R. Johnson, Hyungju Park, and Erich Kaltofen, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pages 47--54. ACM, 2009. [ http ]
@inproceedings{DBLP:conf/issac/BostanS09,
 author = {Alin Bostan and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings},
 doi = {10.1145/1576702.1576712},
 editor = {Jeremy R. Johnson and
Hyungju Park and
Erich Kaltofen},
 pages = {47--54},
 publisher = {{ACM}},
 title = {Fast algorithms for differential equations in positive characteristic},
 url = {http://doi.acm.org/10.1145/1576702.1576712},
 year = {2009}
}

[ 47 ]
Luca De Feo and Éric Schost. Fast arithmetics in artin-schreier towers over finite fields. In Jeremy R. Johnson, Hyungju Park, and Erich Kaltofen, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pages 127--134. ACM, 2009. [ http ]
@inproceedings{DBLP:conf/issac/FeoS09,
 author = {Luca De Feo and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings},
 doi = {10.1145/1576702.1576722},
 editor = {Jeremy R. Johnson and
Hyungju Park and
Erich Kaltofen},
 pages = {127--134},
 publisher = {{ACM}},
 title = {Fast arithmetics in artin-schreier towers over finite fields},
 url = {http://doi.acm.org/10.1145/1576702.1576722},
 year = {2009}
}



[ 2008 ]


[ 46 ]
Xin Li, Marc Moreno Maza, Raqeeb Rasheed, and Éric Schost. The modpn library: bringing fast polynomial arithmetic into MAPLE. ACM Comm. Computer Algebra, 42:172--174, 2008. [ http ]
@article{DBLP:journals/cca/0009MRS08,
 author = {Xin Li and
Marc Moreno Maza and
Raqeeb Rasheed and
{'{E}}ric Schost},
 doi = {10.1145/1504347.1504374},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {172--174},
 title = {The modpn library: bringing fast polynomial arithmetic into {MAPLE}},
 url = {http://doi.acm.org/10.1145/1504347.1504374},
 volume = {42},
 year = {2008}
}

[ 45 ]
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}
}

[ 44 ]
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}
}

[ 43 ]
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 = {https://doi.org/10.1090/S0025-5718-08-02066-8},
 volume = {77},
 year = {2008}
}

[ 42 ]
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 = {https://doi.org/10.1016/j.tcs.2008.05.014},
 volume = {407},
 year = {2008}
}

[ 41 ]
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 = {https://doi.org/10.1016/j.tcs.2007.10.003},
 volume = {392},
 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 = {https://doi.org/10.1109/ICCSA.2008.68},
 year = {2008}
}

[ 39 ]
Alin Bostan, Bruno Salvy, and Éric Schost. Power series composition and change of basis. In J. Rafael Sendra and Laureano González-Vega, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings, pages 269--276. ACM, 2008. [ http ]
@inproceedings{DBLP:conf/issac/BostanSS08,
 author = {Alin Bostan and
Bruno Salvy and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings},
 doi = {10.1145/1390768.1390806},
 editor = {J. Rafael Sendra and
Laureano Gonz{'{a}}lez{-}Vega},
 pages = {269--276},
 publisher = {{ACM}},
 title = {Power series composition and change of basis},
 url = {http://doi.acm.org/10.1145/1390768.1390806},
 year = {2008}
}

[ 38 ]
É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 mph{GF}(2\({}^{\mbox{mph{m}}}\))
Using Trinomial Bases and Chinese Remaindering},
 url = {https://doi.org/10.1007/978-3-642-04159-4_23},
 volume = {5381},
 year = {2008}
}



[ 2007 ]


[ 37 ]
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}
}

[ 36 ]
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 = {https://doi.org/10.1137/S0097539704443793},
 volume = {36},
 year = {2007}
}

[ 35 ]
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 J. 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 J. Dongarra and
Peter M. A. Sloot},
 pages = {251--258},
 publisher = {Springer},
 title = {On the Virtues of Generic Programming for Symbolic Computation},
 url = {https://doi.org/10.1007/978-3-540-72586-2_35},
 volume = {4488},
 year = {2007}
}

[ 34 ]
Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, and Éric Schost. Differential equations for algebraic functions. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 25--32. ACM, 2007. [ http ]
@inproceedings{DBLP:conf/issac/BostanCSLS07,
 author = {Alin Bostan and
Fr{'{e}}d{'{e}}ric Chyzak and
Bruno Salvy and
Gr{'{e}}goire Lecerf and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings},
 doi = {10.1145/1277548.1277553},
 editor = {Dongming Wang},
 pages = {25--32},
 publisher = {{ACM}},
 title = {Differential equations for algebraic functions},
 url = {http://doi.acm.org/10.1145/1277548.1277553},
 year = {2007}
}

[ 33 ]
Alin Bostan, Claude-Pierre Jeannerod, and Éric Schost. Solving toeplitz- and vandermonde-like linear systems with large displacement rank. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 33--40. ACM, 2007. [ http ]
@inproceedings{DBLP:conf/issac/BostanJS07,
 author = {Alin Bostan and
Claude{-}Pierre Jeannerod and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings},
 doi = {10.1145/1277548.1277554},
 editor = {Dongming Wang},
 pages = {33--40},
 publisher = {{ACM}},
 title = {Solving toeplitz- and vandermonde-like linear systems with large displacement
rank},
 url = {http://doi.acm.org/10.1145/1277548.1277554},
 year = {2007}
}

[ 32 ]
Xin Li, Marc Moreno Maza, and Éric Schost. Fast arithmetic for triangular sets: from theory to practice. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 269--276. ACM, 2007. [ http ]
@inproceedings{DBLP:conf/issac/LiMS07,
 author = {Xin Li and
Marc Moreno Maza and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings},
 doi = {10.1145/1277548.1277585},
 editor = {Dongming Wang},
 pages = {269--276},
 publisher = {{ACM}},
 title = {Fast arithmetic for triangular sets: from theory to practice},
 url = {http://doi.acm.org/10.1145/1277548.1277585},
 year = {2007}
}

[ 31 ]
P. Mihailescu, François Morain, and Éric Schost. Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 285--292. ACM, 2007. [ http ]
@inproceedings{DBLP:conf/issac/MihailescuMS07,
 author = {P. Mihailescu and
Fran{\c{c}}ois Morain and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings},
 doi = {10.1145/1277548.1277587},
 editor = {Dongming Wang},
 pages = {285--292},
 publisher = {{ACM}},
 title = {Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using
Abelian lifts},
 url = {http://doi.acm.org/10.1145/1277548.1277587},
 year = {2007}
}



[ 2006 ]


[ 30 ]
Alin Bostan, Claude-Pierre Jeannerod, and Éric Schost. Solving structured linear systems of large displacement rank. ACM Comm. Computer Algebra, 40:42--44, 2006. [ http ]
@article{DBLP:journals/cca/BostanJS06,
 author = {Alin Bostan and
Claude{-}Pierre Jeannerod and
{'{E}}ric Schost},
 doi = {10.1145/1182553.1182558},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {42--44},
 title = {Solving structured linear systems of large displacement rank},
 url = {http://doi.acm.org/10.1145/1182553.1182558},
 volume = {40},
 year = {2006}
}

[ 29 ]
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}
}

[ 28 ]
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}
}

[ 27 ]
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 = {https://doi.org/10.1142/S0218196706003128},
 volume = {16},
 year = {2006}
}

[ 26 ]
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 = {https://doi.org/10.1016/j.jsc.2005.07.001},
 volume = {41},
 year = {2006}
}

[ 25 ]
É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}
}

[ 24 ]
Akpodigha Filatei, Xin Li, Marc Moreno Maza, and Éric Schost. Implementation techniques for fast polynomial arithmetic in a high-level programming environment. In Barry M. Trager, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pages 93--100. ACM, 2006. [ http ]
@inproceedings{DBLP:conf/issac/FilateiLMS06,
 author = {Akpodigha Filatei and
Xin Li and
Marc Moreno Maza and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2006, Genoa, Italy, July 9-12, 2006, Proceedings},
 doi = {10.1145/1145768.1145789},
 editor = {Barry M. Trager},
 pages = {93--100},
 publisher = {{ACM}},
 title = {Implementation techniques for fast polynomial arithmetic in a high-level
programming environment},
 url = {http://doi.acm.org/10.1145/1145768.1145789},
 year = {2006}
}

[ 23 ]
Cyril Pascal and Éric Schost. Change of order for bivariate triangular sets. In Barry M. Trager, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pages 277--284. ACM, 2006. [ http ]
@inproceedings{DBLP:conf/issac/PascalS06,
 author = {Cyril Pascal and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2006, Genoa, Italy, July 9-12, 2006, Proceedings},
 doi = {10.1145/1145768.1145814},
 editor = {Barry M. Trager},
 pages = {277--284},
 publisher = {{ACM}},
 title = {Change of order for bivariate triangular sets},
 url = {http://doi.acm.org/10.1145/1145768.1145814},
 year = {2006}
}



[ 2005 ]


[ 22 ]
Xavier Dahan, Éric Schost, Marc Moreno Maza, Wenyuan Wu, and Yuzhen Xie. On the complexity of the D5 principle. ACM SIGSAM Bulletin, 39:97--98, 2005. [ http ]
@article{DBLP:journals/cca/DahanSMWX05,
 author = {Xavier Dahan and
{'{E}}ric Schost and
Marc Moreno Maza and
Wenyuan Wu and
Yuzhen Xie},
 doi = {10.1145/1113439.1113457},
 journal = {{ACM} {SIGSAM} Bulletin},
 pages = {97--98},
 title = {On the complexity of the {D5} principle},
 url = {http://doi.acm.org/10.1145/1113439.1113457},
 volume = {39},
 year = {2005}
}

[ 21 ]
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 = {https://doi.org/10.1016/j.jco.2004.09.009},
 volume = {21},
 year = {2005}
}

[ 20 ]
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 = {https://doi.org/10.1090/S0025-5718-04-01682-5},
 volume = {74},
 year = {2005}
}

[ 19 ]
É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 = {https://doi.org/10.1016/j.tcs.2005.07.031},
 volume = {347},
 year = {2005}
}

[ 18 ]
Xavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, and Yuzhen Xie. Lifting techniques for triangular decompositions. In Manuel Kauers, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pages 108--115. ACM, 2005. [ http ]
@inproceedings{DBLP:conf/issac/DahanMSWX05,
 author = {Xavier Dahan and
Marc Moreno Maza and
{'{E}}ric Schost and
Wenyuan Wu and
Yuzhen Xie},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2005, Beijing, China, July 24-27, 2005, Proceedings},
 doi = {10.1145/1073884.1073901},
 editor = {Manuel Kauers},
 pages = {108--115},
 publisher = {{ACM}},
 title = {Lifting techniques for triangular decompositions},
 url = {http://doi.acm.org/10.1145/1073884.1073901},
 year = {2005}
}

[ 17 ]
Éric Schost. Multivariate power series multiplication. In Manuel Kauers, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pages 293--300. ACM, 2005. [ http ]
@inproceedings{DBLP:conf/issac/Schost05,
 author = {{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2005, Beijing, China, July 24-27, 2005, Proceedings},
 doi = {10.1145/1073884.1073925},
 editor = {Manuel Kauers},
 pages = {293--300},
 publisher = {{ACM}},
 title = {Multivariate power series multiplication},
 url = {http://doi.acm.org/10.1145/1073884.1073925},
 year = {2005}
}



[ 2004 ]


[ 16 ]
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}
}

[ 15 ]
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 = {https://doi.org/10.1016/j.tcs.2004.09.002},
 volume = {329},
 year = {2004}
}

[ 14 ]
Pierrick Gaudry and Éric Schost. A low-memory parallel version of matsuo, chao, and tsujii?s algorithm. In Duncan A. Buell, editor, Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings, volume 3076, pages 208--222. Springer, 2004. [ http ]
@inproceedings{DBLP:conf/ants/GaudryS04,
 author = {Pierrick Gaudry and
{'{E}}ric Schost},
 booktitle = {Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington,
VT, USA, June 13-18, 2004, Proceedings},
 doi = {10.1007/978-3-540-24847-7_15},
 editor = {Duncan A. Buell},
 pages = {208--222},
 publisher = {Springer},
 title = {A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm},
 url = {https://doi.org/10.1007/978-3-540-24847-7_15},
 volume = {3076},
 year = {2004}
}

[ 13 ]
Pierrick Gaudry and Éric Schost. Construction of secure random curves of genus 2 over prime fields. In Christian Cachin and Jan Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, volume 3027, pages 239--256. Springer, 2004. [ http ]
@inproceedings{DBLP:conf/eurocrypt/GaudryS04,
 author = {Pierrick Gaudry and
{'{E}}ric Schost},
 booktitle = {Advances in Cryptology - {EUROCRYPT} 2004, International Conference
on the Theory and Applications of Cryptographic Techniques, Interlaken,
Switzerland, May 2-6, 2004, Proceedings},
 doi = {10.1007/978-3-540-24676-3_15},
 editor = {Christian Cachin and
Jan Camenisch},
 pages = {239--256},
 publisher = {Springer},
 title = {Construction of Secure Random Curves of Genus 2 over Prime Fields},
 url = {https://doi.org/10.1007/978-3-540-24676-3_15},
 volume = {3027},
 year = {2004}
}

[ 12 ]
Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, and B. Wiebelt. Complexity issues in bivariate polynomial factorization. In Jaime Gutierrez, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pages 42--49. ACM, 2004. [ http ]
@inproceedings{DBLP:conf/issac/BostanLSSW04,
 author = {Alin Bostan and
Gr{'{e}}goire Lecerf and
Bruno Salvy and
{'{E}}ric Schost and
B. Wiebelt},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2004, Santander, Spain, July 4-7, 2004, Proceedings},
 doi = {10.1145/1005285.1005294},
 editor = {Jaime Gutierrez},
 pages = {42--49},
 publisher = {{ACM}},
 title = {Complexity issues in bivariate polynomial factorization},
 url = {http://doi.acm.org/10.1145/1005285.1005294},
 year = {2004}
}

[ 11 ]
Xavier Dahan and Éric Schost. Sharp estimates for triangular sets. In Jaime Gutierrez, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pages 103--110. ACM, 2004. [ http ]
@inproceedings{DBLP:conf/issac/DahanS04,
 author = {Xavier Dahan and
{'{E}}ric Schost},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2004, Santander, Spain, July 4-7, 2004, Proceedings},
 doi = {10.1145/1005285.1005302},
 editor = {Jaime Gutierrez},
 pages = {103--110},
 publisher = {{ACM}},
 title = {Sharp estimates for triangular sets},
 url = {http://doi.acm.org/10.1145/1005285.1005302},
 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 = {https://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 = {https://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 = {https://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 = {https://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 ]
Pierrick Gaudry and Éric Schost. On the invariants of the quotients of the jacobian of a curve of genus 2. In Serdar Boztas and Igor E. Shparlinski, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings, volume 2227, pages 373--386. Springer, 2001. [ http ]
@inproceedings{DBLP:conf/aaecc/GaudryS01,
 author = {Pierrick Gaudry and
{'{E}}ric Schost},
 booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
14th International Symposium, AAECC-14, Melbourne, Australia November
26-30, 2001, Proceedings},
 doi = {10.1007/3-540-45624-4_39},
 editor = {Serdar Boztas and
Igor E. Shparlinski},
 pages = {373--386},
 publisher = {Springer},
 title = {On the Invariants of the Quotients of the Jacobian of a Curve of Genus
2},
 url = {https://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 = {https://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 ]