[ 206 ]
Vincent Neiger, Bruno Salvy, Éric Schost, and Gilles Villard. Faster modular composition using two relation matrices. CoRR, abs/2601.17422, 2026. [ http ]
@article{DBLP:journals/corr/abs-2601-17422,
 author = {Vincent Neiger and
Bruno Salvy and
{\'{E}}ric Schost and
Gilles Villard},
 doi = {10.48550/arXiv.2601.17422},
 journal = {CoRR},
 title = {Faster modular composition using two relation matrices},
 url = {https://doi.org/10.48550/arXiv.2601.17422},
 volume = {abs/2601.17422},
 year = {2026}
}
[ 205 ]
Robert Andrews, Abhibhav Garg, and Éric Schost. Hilbert's nullstellensatz is in the counting hierarchy. CoRR, abs/2602.17904, 2026. [ http ]
@article{DBLP:journals/corr/abs-2602-17904,
 author = {Robert Andrews and
Abhibhav Garg and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2602.17904},
 journal = {CoRR},
 title = {Hilbert's Nullstellensatz is in the Counting Hierarchy},
 url = {https://doi.org/10.48550/arXiv.2602.17904},
 volume = {abs/2602.17904},
 year = {2026}
}
[ 204 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Fast deterministic normal bases and circulant polynomial determinants. CoRR, abs/2607.00313, 2026. [ http ]
@article{DBLP:journals/corr/abs-2607-00313,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2607.00313},
 journal = {CoRR},
 title = {Fast Deterministic Normal Bases and Circulant Polynomial Determinants},
 url = {https://doi.org/10.48550/arXiv.2607.00313},
 volume = {abs/2607.00313},
 year = {2026}
}
[ 203 ]
Robert Andrews, Abhibhav Garg, and Éric Schost. Hilbert's nullstellensatz is in the counting hierarchy. Electron. Colloquium Comput. Complex., TR26, 2026. [ http ]
@article{DBLP:journals/eccc/0003GS26,
 author = {Robert Andrews and
Abhibhav Garg and
{\'{E}}ric Schost},
 journal = {Electron. Colloquium Comput. Complex.},
 title = {Hilbert's Nullstellensatz is in the Counting Hierarchy},
 url = {https://eccc.weizmann.ac.il/report/2026/024},
 volume = {TR26},
 year = {2026}
}
[ 202 ]
Rémi Prébet, Mohab Safey El Din, and Éric Schost. Computing roadmaps in unbounded smooth real algebraic sets ii: Algorithm and complexity. J. Symb. Comput., 135:102532, 2026. [ http ]
@article{DBLP:journals/jsc/PrebetDS26,
 author = {R{\'{e}}mi Pr{\'{e}}bet and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2025.102532},
 journal = {J. Symb. Comput.},
 pages = {102532},
 title = {Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity},
 url = {https://doi.org/10.1016/j.jsc.2025.102532},
 volume = {135},
 year = {2026}
}
[ 201 ]
Vincent Neiger, Bruno Salvy, Éric Schost, and Gilles Villard. Faster modular composition using two relation matrices. In Christoph Koutschan, Alin Bostan, Clément Pernet, and Thi Xuan Vu, editors, Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation, ISSAC 2026, Oldenburg, Germany, July 13-17, 2026, pages 315--324. ACM, 2026. [ http ]
@inproceedings{DBLP:conf/issac/NeigerSSV26,
 author = {Vincent Neiger and
Bruno Salvy and
{\'{E}}ric Schost and
Gilles Villard},
 booktitle = {Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation, ISSAC 2026, Oldenburg, Germany, July 13-17, 2026},
 doi = {10.1145/3815436.3815451},
 editor = {Christoph Koutschan and
Alin Bostan and
Cl{\'{e}}ment Pernet and
Thi Xuan Vu},
 pages = {315--324},
 publisher = {ACM},
 title = {Faster Modular Composition Using Two Relation Matrices},
 url = {https://doi.org/10.1145/3815436.3815451},
 year = {2026}
}
[ 200 ]
Jesse Elliott and Éric Schost. Primes of bad reduction for systems of polynomial equations, 2026. Preprint, arXiv:2603.02279 [math.AC]. [ http ]
@misc{zbMATH902971690,
 author = {Jesse Elliott and {\'{E}}ric Schost},
 note = {Preprint, arXiv:2603.02279 [math.AC]},
 title = {Primes of bad reduction for systems of polynomial equations},
 url = {https://arxiv.org/abs/2603.02279},
 year = {2026}
}
[ 199 ]
Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din, and Éric Schost. Heights of degeneracy loci. ACM Commun. Comput. Algebra, 59:110--111, 2025. [ http ]
@article{DBLP:journals/cca/GopalakrishnanNDS25,
 author = {Sriram Gopalakrishnan and
Vincent Neiger and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1145/3832046.3832056},
 journal = {ACM Commun. Comput. Algebra},
 pages = {110--111},
 title = {Heights of Degeneracy Loci},
 url = {https://doi.org/10.1145/3832046.3832056},
 volume = {59},
 year = {2025}
}
[ 198 ]
Éric Schost. Modular composition for decomposable polynomials. ACM Commun. Comput. Algebra, 59:106--109, 2025. [ http ]
@article{DBLP:journals/cca/Schost25,
 author = {{\'{E}}ric Schost},
 doi = {10.1145/3832046.3832055},
 journal = {ACM Commun. Comput. Algebra},
 pages = {106--109},
 title = {Modular Composition for Decomposable Polynomials},
 url = {https://doi.org/10.1145/3832046.3832055},
 volume = {59},
 year = {2025}
}
[ 197 ]
Benjamin Hackl, Andrew Luo, Stephen Melczer, and Éric Schost. A sagemath package for analytic combinatorics in several variables: Beyond the smooth case. CoRR, abs/2504.09790, 2025. [ http ]
@article{DBLP:journals/corr/abs-2504-09790,
 author = {Benjamin Hackl and
Andrew Luo and
Stephen Melczer and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2504.09790},
 journal = {CoRR},
 title = {A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case},
 url = {https://doi.org/10.48550/arXiv.2504.09790},
 volume = {abs/2504.09790},
 year = {2025}
}
[ 196 ]
Jesse Elliott, Mark Giesbrecht, Edern Gillot, Mohab Safey El Din, and Éric Schost. Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set. CoRR, abs/2508.20607, 2025. [ http ]
@article{DBLP:journals/corr/abs-2508-20607,
 author = {Jesse Elliott and
Mark Giesbrecht and
Edern Gillot and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2508.20607},
 journal = {CoRR},
 title = {Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set},
 url = {https://doi.org/10.48550/arXiv.2508.20607},
 volume = {abs/2508.20607},
 year = {2025}
}
[ 195 ]
Éric Schost and Catherine St-Pierre. An m-adic algorithm for bivariate gröbner bases. J. Symb. Comput., 128:102389, 2025. [ http ]
@article{DBLP:journals/jsc/SchostS25,
 author = {{\'{E}}ric Schost and
Catherine St-Pierre},
 doi = {10.1016/j.jsc.2024.102389},
 journal = {J. Symb. Comput.},
 pages = {102389},
 title = {An m-adic algorithm for bivariate Gr{\"{o}}bner bases},
 url = {https://doi.org/10.1016/j.jsc.2024.102389},
 volume = {128},
 year = {2025}
}
[ 194 ]
Hackl, Benjamin, Luo, Andrew, Melczer, Stephen, and Schost, Éric. A sagemath package for analytic combinatorics in several variables: beyond the smooth case. Séminaire Lotharingien de Combinatoire, 93B, 2025. [ http ]
@article{zbMATH8267692,
 author = {Hackl, Benjamin and Luo, Andrew and Melczer, Stephen and Schost, {\'{E}}ric},
 journal = {S{\'{e}}minaire Lotharingien de Combinatoire},
 title = {A SageMath package for analytic combinatorics in several variables: beyond the smooth case},
 url = {https://arxiv.org/abs/2504.09790},
 volume = {93B},
 year = {2025}
}
[ 193 ]
Éric Schost and Jesse Elliott. Some applications of chinese remainder theorem codes with error-correction. In Carlos D'Andrea, Sonia Pérez-Díaz, and Santiago Laplagne, editors, Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation, ISSAC 2025, Guanajuato, Mexico, 28 July 2025 - 1 August 2025, pages 345--352. ACM, 2025. [ http ]
@inproceedings{DBLP:conf/issac/SchostE25,
 author = {{\'{E}}ric Schost and
Jesse Elliott},
 booktitle = {Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation, ISSAC 2025, Guanajuato, Mexico, 28 July 2025 - 1 August 2025},
 doi = {10.1145/3747199.3747579},
 editor = {Carlos D'Andrea and
Sonia P{\'{e}}rez-D{\'{i}}az and
Santiago Laplagne},
 pages = {345--352},
 publisher = {ACM},
 title = {Some Applications of Chinese Remainder Theorem Codes with Error-Correction},
 url = {https://doi.org/10.1145/3747199.3747579},
 year = {2025}
}
[ 192 ]
Rémi Prébet, Mohab Safey El Din, and Éric Schost. Computing roadmaps in unbounded smooth real algebraic sets ii: algorithm and complexity. CoRR, abs/2402.03111, 2024. [ http ]
@article{DBLP:journals/corr/abs-2402-03111,
 author = {R{\'{e}}mi Pr{\'{e}}bet and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2402.03111},
 journal = {CoRR},
 title = {Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity},
 url = {https://doi.org/10.48550/arXiv.2402.03111},
 volume = {abs/2402.03111},
 year = {2024}
}
[ 191 ]
Vincent Neiger, Bruno Salvy, Éric Schost, and Gilles Villard. Faster modular composition. J. ACM, 71:11:1--11:79, 2024. [ http ]
@article{DBLP:journals/jacm/NeigerSSV24,
 author = {Vincent Neiger and
Bruno Salvy and
{\'{E}}ric Schost and
Gilles Villard},
 doi = {10.1145/3638349},
 journal = {J. ACM},
 pages = {11:1--11:79},
 title = {Faster Modular Composition},
 url = {https://doi.org/10.1145/3638349},
 volume = {71},
 year = {2024}
}
[ 190 ]
Rémi Prébet, Mohab Safey El Din, and Éric Schost. Computing roadmaps in unbounded smooth real algebraic sets i: Connectivity results. J. Symb. Comput., 120:102234, 2024. [ http ]
@article{DBLP:journals/jsc/PrebetDS24,
 author = {R{\'{e}}mi Pr{\'{e}}bet and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2023.102234},
 journal = {J. Symb. Comput.},
 pages = {102234},
 title = {Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results},
 url = {https://doi.org/10.1016/j.jsc.2023.102234},
 volume = {120},
 year = {2024}
}
[ 189 ]
Schost, Éric and St-Pierre, Catherine. Newton iteration for lexicographic gröbner bases in two variables. Journal of Algebra, 653:325--377, 2024. [ http ]
@article{zbMATH7868231,
 author = {Schost, {\'{E}}ric and St-Pierre, Catherine},
 doi = {10.1016/j.jalgebra.2024.04.018},
 journal = {Journal of Algebra},
 pages = {325--377},
 title = {Newton iteration for lexicographic Gr{\"{o}}bner bases in two variables},
 url = {https://doi.org/10.1016/j.jalgebra.2024.04.018},
 volume = {653},
 year = {2024}
}
[ 188 ]
Jesse Elliott and Éric Schost. Some applications of chinese remainder theorem codes with error-correction. In Katsusuke Nabeshima and Stephen M. Watt, editors, Proceedings of the SCSS 2024 Work in Progress Workshop co-located with 10th International Symposium on Symbolic Computation in Software Science (SCSS 2024), Tokyo, Japan, Aug 28-30, 2024., volume 3754, pages 13--18. CEUR-WS.org, 2024. [ .pdf ]
@inproceedings{DBLP:conf/sycss/ElliottS24,
 author = {Jesse Elliott and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the SCSS 2024 Work in Progress Workshop co-located with 10th International Symposium on Symbolic Computation in Software Science (SCSS 2024), Tokyo, Japan, Aug 28-30, 2024.},
 editor = {Katsusuke Nabeshima and
Stephen M. Watt},
 pages = {13--18},
 publisher = {CEUR-WS.org},
 title = {Some applications of Chinese Remainder Theorem codes with error-correction},
 url = {https://ceur-ws.org/Vol-3754/paper03.pdf},
 volume = {3754},
 year = {2024}
}
[ 187 ]
Éric Schost and Catherine St-Pierre. Newton iteration for lexicographic gröbner bases in two variables. CoRR, abs/2302.03766, 2023. [ http ]
@article{DBLP:journals/corr/abs-2302-03766,
 author = {{\'{E}}ric Schost and
Catherine St-Pierre},
 doi = {10.48550/arXiv.2302.03766},
 journal = {CoRR},
 title = {Newton iteration for lexicographic Gr{\"{o}}bner bases in two variables},
 url = {https://doi.org/10.48550/arXiv.2302.03766},
 volume = {abs/2302.03766},
 year = {2023}
}
[ 186 ]
Yossef Musleh and Éric Schost. Computing the characteristic polynomial of endomorphisms of a finite drinfeld module using crystalline cohomology. CoRR, abs/2302.08611, 2023. [ http ]
@article{DBLP:journals/corr/abs-2302-08611,
 author = {Yossef Musleh and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2302.08611},
 journal = {CoRR},
 title = {Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology},
 url = {https://doi.org/10.48550/arXiv.2302.08611},
 volume = {abs/2302.08611},
 year = {2023}
}
[ 185 ]
George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Faster real root decision algorithm for symmetric polynomials. CoRR, abs/2306.03855, 2023. [ http ]
@article{DBLP:journals/corr/abs-2306-03855,
 author = {George Labahn and
Cordian Riener and
Mohab Safey El Din and
{\'{E}}ric Schost and
Thi Xuan Vu},
 doi = {10.48550/arXiv.2306.03855},
 journal = {CoRR},
 title = {Faster real root decision algorithm for symmetric polynomials},
 url = {https://doi.org/10.48550/arXiv.2306.03855},
 volume = {abs/2306.03855},
 year = {2023}
}
[ 184 ]
Éric Schost and Catherine St-Pierre. p-adic algorithm for bivariate gröbner bases. CoRR, abs/2312.14116, 2023. [ http ]
@article{DBLP:journals/corr/abs-2312-14116,
 author = {{\'{E}}ric Schost and
Catherine St-Pierre},
 doi = {10.48550/arXiv.2312.14116},
 journal = {CoRR},
 title = {p-adic algorithm for bivariate Gr{\"{o}}bner bases},
 url = {https://doi.org/10.48550/arXiv.2312.14116},
 volume = {abs/2312.14116},
 year = {2023}
}
[ 183 ]
Jesse Elliott, Mark Giesbrecht, and Éric Schost. Bit complexity for computing one point in each connected component of a smooth real algebraic set. J. Symb. Comput., 116:72--97, 2023. [ http ]
@article{DBLP:journals/jsc/ElliottGS23,
 author = {Jesse Elliott and
Mark Giesbrecht and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2022.08.010},
 journal = {J. Symb. Comput.},
 pages = {72--97},
 title = {Bit complexity for computing one point in each connected component of a smooth real algebraic set},
 url = {https://doi.org/10.1016/j.jsc.2022.08.010},
 volume = {116},
 year = {2023}
}
[ 182 ]
Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Computing critical points for invariant algebraic systems. J. Symb. Comput., 116:365--399, 2023. [ http ]
@article{DBLP:journals/jsc/FaugereLDSV23,
 author = {Jean-Charles Faug{\`{e}}re and
George Labahn and
Mohab Safey El Din and
{\'{E}}ric Schost and
Thi Xuan Vu},
 doi = {10.1016/j.jsc.2022.10.002},
 journal = {J. Symb. Comput.},
 pages = {365--399},
 title = {Computing critical points for invariant algebraic systems},
 url = {https://doi.org/10.1016/j.jsc.2022.10.002},
 volume = {116},
 year = {2023}
}
[ 181 ]
George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Faster real root decision algorithm for symmetric polynomials. In Alicia Dickenstein, Elias P. Tsigaridas, and Gabriela Jeronimo, editors, Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023, pages 452--460. ACM, 2023. [ http ]
@inproceedings{DBLP:conf/issac/LabahnRDSV23,
 author = {George Labahn and
Cordian Riener and
Mohab Safey El Din and
{\'{E}}ric Schost and
Thi Xuan Vu},
 booktitle = {Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Troms{\o}, Norway, July 24-27, 2023},
 doi = {10.1145/3597066.3597097},
 editor = {Alicia Dickenstein and
Elias P. Tsigaridas and
Gabriela Jeronimo},
 pages = {452--460},
 publisher = {ACM},
 title = {Faster real root decision algorithm for symmetric polynomials},
 url = {https://doi.org/10.1145/3597066.3597097},
 year = {2023}
}
[ 180 ]
Yossef Musleh and Éric Schost. Computing the characteristic polynomial of endomorphisms of a finite drinfeld module using crystalline cohomology. In Alicia Dickenstein, Elias P. Tsigaridas, and Gabriela Jeronimo, editors, Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023, pages 461--469. ACM, 2023. [ http ]
@inproceedings{DBLP:conf/issac/MuslehS23,
 author = {Yossef Musleh and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Troms{\o}, Norway, July 24-27, 2023},
 doi = {10.1145/3597066.3597080},
 editor = {Alicia Dickenstein and
Elias P. Tsigaridas and
Gabriela Jeronimo},
 pages = {461--469},
 publisher = {ACM},
 title = {Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology},
 url = {https://doi.org/10.1145/3597066.3597080},
 year = {2023}
}
[ 179 ]
Éric Schost and Catherine St-Pierre. p-adic algorithm for bivariate gröbner bases. In Alicia Dickenstein, Elias P. Tsigaridas, and Gabriela Jeronimo, editors, Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023, pages 508--516. ACM, 2023. [ http ]
@inproceedings{DBLP:conf/issac/SchostS23,
 author = {{\'{E}}ric Schost and
Catherine St-Pierre},
 booktitle = {Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Troms{\o}, Norway, July 24-27, 2023},
 doi = {10.1145/3597066.3597086},
 editor = {Alicia Dickenstein and
Elias P. Tsigaridas and
Gabriela Jeronimo},
 pages = {508--516},
 publisher = {ACM},
 title = {p-adic algorithm for bivariate Gr{\"{o}}bner bases},
 url = {https://doi.org/10.1145/3597066.3597086},
 year = {2023}
}
[ 178 ]
Rémi Prébet, Mohab Safey El Din, and Éric Schost. Computing roadmaps in unbounded smooth real algebraic sets i: connectivity results. CoRR, abs/2203.03961, 2022. [ http ]
@article{DBLP:journals/corr/abs-2203-03961,
 author = {R{\'{e}}mi Pr{\'{e}}bet and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2203.03961},
 journal = {CoRR},
 title = {Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results},
 url = {https://doi.org/10.48550/arXiv.2203.03961},
 volume = {abs/2203.03961},
 year = {2022}
}
[ 177 ]
Jesse Elliott, Mark Giesbrecht, and Éric Schost. Bit complexity for computing one point in each connected component of a smooth real algebraic set. CoRR, abs/2207.04289, 2022. [ http ]
@article{DBLP:journals/corr/abs-2207-04289,
 author = {Jesse Elliott and
Mark Giesbrecht and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2207.04289},
 journal = {CoRR},
 title = {Bit complexity for computing one point in each connected component of a smooth real algebraic set},
 url = {https://doi.org/10.48550/arXiv.2207.04289},
 volume = {abs/2207.04289},
 year = {2022}
}
[ 176 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Subquadratic-time algorithms for normal bases. Comput. Complex., 30:5, 2021. [ http ]
@article{DBLP:journals/cc/GiesbrechtJS21,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 doi = {10.1007/s00037-020-00204-9},
 journal = {Comput. Complex.},
 pages = {5},
 title = {Subquadratic-Time Algorithms for Normal Bases},
 url = {https://doi.org/10.1007/s00037-020-00204-9},
 volume = {30},
 year = {2021}
}
[ 175 ]
Seung Gyu Hyun, Vincent Neiger, and Éric Schost. Algorithms for linearly recurrent sequences of truncated polynomials. CoRR, abs/2102.03583, 2021. [ http ]
@article{DBLP:journals/corr/abs-2102-03583,
 author = {Seung Gyu Hyun and
Vincent Neiger and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2102.03583},
 journal = {CoRR},
 title = {Algorithms for Linearly Recurrent Sequences of Truncated Polynomials},
 url = {https://doi.org/10.48550/arXiv.2102.03583},
 volume = {abs/2102.03583},
 year = {2021}
}
[ 174 ]
Vincent Neiger, Bruno Salvy, Éric Schost, and Gilles Villard. Faster modular composition. CoRR, abs/2110.08354, 2021. [ http ]
@article{DBLP:journals/corr/abs-2110-08354,
 author = {Vincent Neiger and
Bruno Salvy and
{\'{E}}ric Schost and
Gilles Villard},
 doi = {10.48550/arXiv.2110.08354},
 journal = {CoRR},
 title = {Faster Modular Composition},
 url = {https://doi.org/10.48550/arXiv.2110.08354},
 volume = {abs/2110.08354},
 year = {2021}
}
[ 173 ]
George Labahn, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex., 66:101557, 2021. [ http ]
@article{DBLP:journals/jc/LabahnDSV21,
 author = {George Labahn and
Mohab Safey El Din and
{\'{E}}ric Schost and
Thi Xuan Vu},
 doi = {10.1016/j.jco.2021.101557},
 journal = {J. Complex.},
 pages = {101557},
 title = {Homotopy techniques for solving sparse column support determinantal polynomial systems},
 url = {https://doi.org/10.1016/j.jco.2021.101557},
 volume = {66},
 year = {2021}
}
[ 172 ]
Javad Doliskani, Anand Kumar Narayanan, and Éric Schost. Drinfeld modules with complex multiplication, hasse invariants and factoring polynomials over finite fields. J. Symb. Comput., 105:199--213, 2021. [ http ]
@article{DBLP:journals/jsc/DoliskaniNS21,
 author = {Javad Doliskani and
Anand Kumar Narayanan and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2020.06.007},
 journal = {J. Symb. Comput.},
 pages = {199--213},
 title = {Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields},
 url = {https://doi.org/10.1016/j.jsc.2020.06.007},
 volume = {105},
 year = {2021}
}
[ 171 ]
Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Solving determinantal systems using homotopy techniques. J. Symb. Comput., 104:754--804, 2021. [ http ]
@article{DBLP:journals/jsc/HauensteinDSV21,
 author = {Jonathan D. Hauenstein and
Mohab Safey El Din and
{\'{E}}ric Schost and
Thi Xuan Vu},
 doi = {10.1016/j.jsc.2020.09.008},
 journal = {J. Symb. Comput.},
 pages = {754--804},
 title = {Solving determinantal systems using homotopy techniques},
 url = {https://doi.org/10.1016/j.jsc.2020.09.008},
 volume = {104},
 year = {2021}
}
[ 170 ]
Manuel Kauers, Alexey Ovchinnikov, and Éric Schost. Foreword. J. Symb. Comput., 102:1--2, 2021. [ http ]
@article{DBLP:journals/jsc/KauersOS21,
 author = {Manuel Kauers and
Alexey Ovchinnikov and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2019.09.002},
 journal = {J. Symb. Comput.},
 pages = {1--2},
 title = {Foreword},
 url = {https://doi.org/10.1016/j.jsc.2019.09.002},
 volume = {102},
 year = {2021}
}
[ 169 ]
Mark Giesbrecht, Qiao-Long Huang, and Éric Schost. Sparse multiplication of multivariate linear differential operators. In Frédéric Chyzak and George Labahn, editors, ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021, pages 155--162. ACM, 2021. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHS21,
 author = {Mark Giesbrecht and
Qiao-Long Huang and
{\'{E}}ric Schost},
 booktitle = {ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021},
 doi = {10.1145/3452143.3465527},
 editor = {Fr{\'{e}}d{\'{e}}ric Chyzak and
George Labahn},
 pages = {155--162},
 publisher = {ACM},
 title = {Sparse Multiplication of Multivariate Linear Differential Operators},
 url = {https://doi.org/10.1145/3452143.3465527},
 year = {2021}
}
[ 168 ]
Seung Gyu Hyun, Vincent Neiger, and Éric Schost. Algorithms for linearly recurrent sequences of truncated polynomials. In Frédéric Chyzak and George Labahn, editors, ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021, pages 201--208. ACM, 2021. [ http ]
@inproceedings{DBLP:conf/issac/HyunNS21,
 author = {Seung Gyu Hyun and
Vincent Neiger and
{\'{E}}ric Schost},
 booktitle = {ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021},
 doi = {10.1145/3452143.3465533},
 editor = {Fr{\'{e}}d{\'{e}}ric Chyzak and
George Labahn},
 pages = {201--208},
 publisher = {ACM},
 title = {Algorithms for Linearly Recurrent Sequences of Truncated Polynomials},
 url = {https://doi.org/10.1145/3452143.3465533},
 year = {2021}
}
[ 167 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Subquadratic-time algorithms for normal bases. CoRR, abs/2005.03497, 2020. [ http ]
@article{DBLP:journals/corr/abs-2005-03497,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2005.03497},
 journal = {CoRR},
 title = {Subquadratic-Time Algorithms for Normal Bases},
 url = {https://doi.org/10.48550/arXiv.2005.03497},
 volume = {abs/2005.03497},
 year = {2020}
}
[ 166 ]
George Labahn, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR, abs/2009.00844, 2020. [ http ]
@article{DBLP:journals/corr/abs-2009-00844,
 author = {George Labahn and
Mohab Safey El Din and
{\'{E}}ric Schost and
Thi Xuan Vu},
 doi = {10.48550/arXiv.2009.00844},
 journal = {CoRR},
 title = {Homotopy techniques for solving sparse column support determinantal polynomial systems},
 url = {https://doi.org/10.48550/arXiv.2009.00844},
 volume = {abs/2009.00844},
 year = {2020}
}
[ 165 ]
Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, and Thi Xuan Vu. Computing critical points for invariant algebraic systems. CoRR, abs/2009.00847, 2020. [ http ]
@article{DBLP:journals/corr/abs-2009-00847,
 author = {Jean-Charles Faug{\`{e}}re and
George Labahn and
Mohab Safey El Din and
{\'{E}}ric Schost and
Thi Xuan Vu},
 doi = {10.48550/arXiv.2009.00847},
 journal = {CoRR},
 title = {Computing critical points for invariant algebraic systems},
 url = {https://doi.org/10.48550/arXiv.2009.00847},
 volume = {abs/2009.00847},
 year = {2020}
}
[ 164 ]
Hoon Hong, James Rohal, Mohab Safey El Din, and Éric Schost. Connectivity in semi-algebraic sets i. CoRR, abs/2011.02162, 2020. [ http ]
@article{DBLP:journals/corr/abs-2011-02162,
 author = {Hoon Hong and
James Rohal and
Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.2011.02162},
 journal = {CoRR},
 title = {Connectivity in Semi-Algebraic Sets I},
 url = {https://doi.org/10.48550/arXiv.2011.02162},
 volume = {abs/2011.02162},
 year = {2020}
}
[ 163 ]
Vincent Neiger and Éric Schost. Computing syzygies in finite dimension using fast linear algebra. J. Complex., 60:101502, 2020. [ http ]
@article{DBLP:journals/jc/NeigerS20,
 author = {Vincent Neiger and
{\'{E}}ric Schost},
 doi = {10.1016/j.jco.2020.101502},
 journal = {J. Complex.},
 pages = {101502},
 title = {Computing syzygies in finite dimension using fast linear algebra},
 url = {https://doi.org/10.1016/j.jco.2020.101502},
 volume = {60},
 year = {2020}
}
[ 162 ]
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, and Éric Schost. Block-krylov techniques in the context of sparse-fglm algorithms. J. Symb. Comput., 98:163--191, 2020. [ http ]
@article{DBLP:journals/jsc/HyunNRS20,
 author = {Seung Gyu Hyun and
Vincent Neiger and
Hamid Rahkooy and
{\'{E}}ric Schost},
 doi = {10.1016/j.jsc.2019.07.010},
 journal = {J. Symb. Comput.},
 pages = {163--191},
 title = {Block-Krylov techniques in the context of sparse-FGLM algorithms},
 url = {https://doi.org/10.1016/j.jsc.2019.07.010},
 volume = {98},
 year = {2020}
}
[ 161 ]
Jamshidpey, Armin, Lemire, Nicole, and Schost, Éric. Algebraic construction of quasi-split algebraic tori. Journal of Algebra and its Applications, 19, 2020. [ http ]
@article{zbMATH7272751,
 author = {Jamshidpey, Armin and Lemire, Nicole and Schost, {\'{E}}ric},
 doi = {10.1142/S0219498820502060},
 journal = {Journal of Algebra and its Applications},
 title = {Algebraic construction of quasi-split algebraic tori},
 url = {https://doi.org/10.1142/S0219498820502060},
 volume = {19},
 year = {2020}
}
[ 160 ]
Jesse Elliott, Mark Giesbrecht, and Éric Schost. On the bit complexity of finding points in connected components of a smooth real hypersurface. In Ioannis Z. Emiris and Lihong Zhi, editors, ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020, pages 170--177. ACM, 2020. [ http ]
@inproceedings{DBLP:conf/issac/ElliottGS20,
 author = {Jesse Elliott and
Mark Giesbrecht and
{\'{E}}ric Schost},
 booktitle = {ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020},
 doi = {10.1145/3373207.3404058},
 editor = {Ioannis Z. Emiris and
Lihong Zhi},
 pages = {170--177},
 publisher = {ACM},
 title = {On the bit complexity of finding points in connected components of a smooth real hypersurface},
 url = {https://doi.org/10.1145/3373207.3404058},
 year = {2020}
}
[ 159 ]
Mark Giesbrecht, Qiao-Long Huang, and Éric Schost. Sparse multiplication for skew polynomials. In Ioannis Z. Emiris and Lihong Zhi, editors, ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020, pages 194--201. ACM, 2020. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHS20,
 author = {Mark Giesbrecht and
Qiao-Long Huang and
{\'{E}}ric Schost},
 booktitle = {ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020},
 doi = {10.1145/3373207.3404023},
 editor = {Ioannis Z. Emiris and
Lihong Zhi},
 pages = {194--201},
 publisher = {ACM},
 title = {Sparse multiplication for skew polynomials},
 url = {https://doi.org/10.1145/3373207.3404023},
 year = {2020}
}
[ 158 ]
Jesse Elliott and Éric Schost. Bit complexity for critical point computation in smooth and compact real hypersurfaces. ACM Commun. Comput. Algebra, 53:114--117, 2019. [ http ]
@article{DBLP:journals/cca/ElliottS19,
 author = {Jesse Elliott and
{\'{E}}ric Schost},
 doi = {10.1145/3377006.3377014},
 journal = {ACM Commun. Comput. Algebra},
 pages = {114--117},
 title = {Bit complexity for critical point computation in smooth and compact real hypersurfaces},
 url = {https://doi.org/10.1145/3377006.3377014},
 volume = {53},
 year = {2019}
}
[ 157 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Quadratic probabilistic algorithms for normal bases. CoRR, abs/1903.03278, 2019. [ http ]
@article{DBLP:journals/corr/abs-1903-03278,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.1903.03278},
 journal = {CoRR},
 title = {Quadratic Probabilistic Algorithms for Normal Bases},
 url = {https://doi.org/10.48550/arXiv.1903.03278},
 volume = {abs/1903.03278},
 year = {2019}
}
[ 156 ]
Seung Gyu Hyun, Vincent Neiger, and Éric Schost. Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. CoRR, abs/1905.04356, 2019. [ http ]
@article{DBLP:journals/corr/abs-1905-04356,
 author = {Seung Gyu Hyun and
Vincent Neiger and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.1905.04356},
 journal = {CoRR},
 title = {Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants},
 url = {https://doi.org/10.48550/arXiv.1905.04356},
 volume = {abs/1905.04356},
 year = {2019}
}
[ 155 ]
Seung Gyu Hyun, Stephen Melczer, Éric Schost, and Catherine St-Pierre. Change of basis for m-primary ideals in one and two variables. CoRR, abs/1905.04614, 2019. [ http ]
@article{DBLP:journals/corr/abs-1905-04614,
 author = {Seung Gyu Hyun and
Stephen Melczer and
{\'{E}}ric Schost and
Catherine St-Pierre},
 doi = {10.48550/arXiv.1905.04614},
 journal = {CoRR},
 title = {Change of basis for m-primary ideals in one and two variables},
 url = {https://doi.org/10.48550/arXiv.1905.04614},
 volume = {abs/1905.04614},
 year = {2019}
}
[ 154 ]
Yossef Musleh and Éric Schost. Computing the characteristic polynomial of a finite rank two drinfeld module. CoRR, abs/1907.12731, 2019. [ http ]
@article{DBLP:journals/corr/abs-1907-12731,
 author = {Yossef Musleh and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.1907.12731},
 journal = {CoRR},
 title = {Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module},
 url = {https://doi.org/10.48550/arXiv.1907.12731},
 volume = {abs/1907.12731},
 year = {2019}
}
[ 153 ]
Vincent Neiger and Éric Schost. Computing syzygies in finite dimension using fast linear algebra. CoRR, abs/1912.01848, 2019. [ http ]
@article{DBLP:journals/corr/abs-1912-01848,
 author = {Vincent Neiger and
{\'{E}}ric Schost},
 doi = {10.48550/arXiv.1912.01848},
 journal = {CoRR},
 title = {Computing syzygies in finite dimension using fast linear algebra},
 url = {https://doi.org/10.48550/arXiv.1912.01848},
 volume = {abs/1912.01848},
 year = {2019}
}
[ 152 ]
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, and Éric Schost. Computing isomorphisms and embeddings of finite fields. Math. Comput., 88:1391--1426, 2019. [ http ]
@article{DBLP:journals/moc/BrieulleFDFS19,
 author = {Ludovic Brieulle and
Luca De Feo and
Javad Doliskani and
Jean-Pierre Flori and
{\'{E}}ric Schost},
 doi = {10.1090/mcom/3363},
 journal = {Math. Comput.},
 pages = {1391--1426},
 title = {Computing isomorphisms and embeddings of finite fields},
 url = {https://doi.org/10.1090/mcom/3363},
 volume = {88},
 year = {2019}
}
[ 151 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Quadratic-time algorithms for normal elements. In James H. Davenport, Dongming Wang, Manuel Kauers, and Russell J. Bradford, editors, Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019., pages 179--186. ACM, 2019. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtJS19,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019.},
 doi = {10.1145/3326229.3326260},
 editor = {James H. Davenport and
Dongming Wang and
Manuel Kauers and
Russell J. Bradford},
 pages = {179--186},
 publisher = {ACM},
 title = {Quadratic-Time Algorithms for Normal Elements},
 url = {https://doi.org/10.1145/3326229.3326260},
 year = {2019}
}
[ 150 ]
Seung Gyu Hyun, Stephen Melczer, Éric Schost, and Catherine St-Pierre. Change of basis for m-primary ideals in one and two variables. In James H. Davenport, Dongming Wang, Manuel Kauers, and Russell J. Bradford, editors, Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019., pages 227--234. ACM, 2019. [ http ]
@inproceedings{DBLP:conf/issac/HyunMSS19,
 author = {Seung Gyu Hyun and
Stephen Melczer and
{\'{E}}ric Schost and
Catherine St-Pierre},
 booktitle = {Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019.},
 doi = {10.1145/3326229.3326268},
 editor = {James H. Davenport and
Dongming Wang and
Manuel Kauers and
Russell J. Bradford},
 pages = {227--234},
 publisher = {ACM},
 title = {Change of Basis for m-primary Ideals in One and Two Variables},
 url = {https://doi.org/10.1145/3326229.3326268},
 year = {2019}
}
[ 149 ]
Seung Gyu Hyun, Vincent Neiger, and Éric Schost. Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. In James H. Davenport, Dongming Wang, Manuel Kauers, and Russell J. Bradford, editors, Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019., pages 235--242. ACM, 2019. [ http ]
@inproceedings{DBLP:conf/issac/HyunNS19,
 author = {Seung Gyu Hyun and
Vincent Neiger and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019.},
 doi = {10.1145/3326229.3326272},
 editor = {James H. Davenport and
Dongming Wang and
Manuel Kauers and
Russell J. Bradford},
 pages = {235--242},
 publisher = {ACM},
 title = {Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants},
 url = {https://doi.org/10.1145/3326229.3326272},
 year = {2019}
}
[ 148 ]
Yossef Musleh and Éric Schost. Computing the characteristic polynomial of a finite rank two drinfeld module. In James H. Davenport, Dongming Wang, Manuel Kauers, and Russell J. Bradford, editors, Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019., pages 307--314. ACM, 2019. [ http ]
@inproceedings{DBLP:conf/issac/MuslehS19,
 author = {Yossef Musleh and
{\'{E}}ric Schost},
 booktitle = {Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019.},
 doi = {10.1145/3326229.3326256},
 editor = {James H. Davenport and
Dongming Wang and
Manuel Kauers and
Russell J. Bradford},
 pages = {307--314},
 publisher = {ACM},
 title = {Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module},
 url = {https://doi.org/10.1145/3326229.3326256},
 year = {2019}
}
[ 147 ]
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, and Éric Schost. Computing isomorphisms and embeddings of finite fields. ACM Commun. Comput. Algebra, 52:117--119, 2018. [ http ]
@article{DBLP:journals/cca/BrieulleFDFS18,
 author = {Ludovic Brieulle and
Luca De Feo and
Javad Doliskani and
Jean-Pierre Flori and
{\'{E}}ric Schost},
 doi = {10.1145/3338637.3338639},
 journal = {ACM Commun. Comput. Algebra},
 pages = {117--119},
 title = {Computing isomorphisms and embeddings of finite fields},
 url = {https://doi.org/10.1145/3338637.3338639},
 volume = {52},
 year = {2018}
}
[ 146 ]
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, and Éric Schost. Sparse fglm using the block wiedemann algorithm. ACM Commun. Comput. Algebra, 52:123--125, 2018. [ http ]
@article{DBLP:journals/cca/HyunNRS18,
 author = {Seung Gyu Hyun and
Vincent Neiger and
Hamid Rahkooy and
{\'{E}}ric Schost},
 doi = {10.1145/3338637.3338641},
 journal = {ACM Commun. Comput. Algebra},
 pages = {123--125},
 title = {Sparse FGLM using the block Wiedemann algorithm},
 url = {https://doi.org/10.1145/3338637.3338641},
 volume = {52},
 year = {2018}
}
[ 145 ]
Sergey Fomin, Dima Grigoriev, Dorian Nogneng, and Éric Schost. On semiring complexity of schur polynomials. Comput. Complex., 27:595--616, 2018. [ http ]
@article{DBLP:journals/cc/FominGNS18,
 author = {Sergey Fomin and
Dima Grigoriev and
Dorian Nogneng and
{\'{E}}ric Schost},
 doi = {10.1007/s00037-018-0169-3},
 journal = {Comput. Complex.},
 pages = {595--616},
 title = {On semiring complexity of Schur polynomials},
 url = {https://doi.org/10.1007/s00037-018-0169-3},
 volume = {27},
 year = {2018}
}
[ 144 ]
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},
 doi = {10.48550/arXiv.1802.10409},
 journal = {CoRR},
 title = {Solving determinantal systems using homotopy techniques},
 url = {https://doi.org/10.48550/arXiv.1802.10409},
 volume = {abs/1802.10409},
 year = {2018}
}
[ 143 ]
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}
}
[ 142 ]
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}
}
[ 141 ]
Javad Doliskani, Pascal Giorgi, Romain Lebreton, and Éric Schost. Simultaneous conversions with the residue number system using linear algebra. ACM Trans. Math. Softw., 44:27:1--27:21, 2018. [ http ]
@article{DBLP:journals/toms/DoliskaniGLS18,
 author = {Javad Doliskani and
Pascal Giorgi and
Romain Lebreton and
{\'{E}}ric Schost},
 doi = {10.1145/3145573},
 journal = {ACM Trans. Math. Softw.},
 pages = {27:1--27:21},
 title = {Simultaneous Conversions with the Residue Number System Using Linear Algebra},
 url = {https://doi.org/10.1145/3145573},
 volume = {44},
 year = {2018}
}
[ 140 ]
Manuel Kauers, Alexey Ovchinnikov, and Éric Schost, editors. Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018. ACM, 2018. [ http ]
@proceedings{DBLP:conf/issac/2018,
 booktitle = {ISSAC},
 doi = {10.1145/3208976},
 editor = {Manuel Kauers and
Alexey Ovchinnikov and
{\'{E}}ric Schost},
 publisher = {ACM},
 title = {Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018},
 url = {https://doi.org/10.1145/3208976},
 year = {2018}
}
[ 139 ]
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},
 doi = {10.48550/arXiv.1712.00669},
 journal = {CoRR},
 title = {Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields},
 url = {https://doi.org/10.48550/arXiv.1712.00669},
 volume = {abs/1712.00669},
 year = {2017}
}
[ 138 ]
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},
 doi = {10.48550/arXiv.1712.04177},
 journal = {CoRR},
 title = {Block-Krylov techniques in the context of sparse-FGLM algorithms},
 url = {https://doi.org/10.48550/arXiv.1712.04177},
 volume = {abs/1712.04177},
 year = {2017}
}
[ 137 ]
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},
 doi = {10.48550/arXiv.1703.03734},
 journal = {CoRR},
 title = {On matrices with displacement structure: generalized operators and faster algorithms},
 url = {https://doi.org/10.48550/arXiv.1703.03734},
 volume = {abs/1703.03734},
 year = {2017}
}
[ 136 ]
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},
 doi = {10.48550/arXiv.1705.01221},
 journal = {CoRR},
 title = {Computing isomorphisms and embeddings of finite fields},
 url = {https://doi.org/10.48550/arXiv.1705.01221},
 volume = {abs/1705.01221},
 year = {2017}
}
[ 135 ]
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},
 doi = {10.48550/arXiv.1707.01971},
 journal = {CoRR},
 title = {Algorithms for zero-dimensional ideals using linear recurrent sequences},
 url = {https://doi.org/10.48550/arXiv.1707.01971},
 volume = {abs/1707.01971},
 year = {2017}
}
[ 134 ]
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},
 doi = {10.48550/arXiv.1705.10658},
 journal = {CoRR},
 title = {Fast Computation of the Roots of Polynomials Over the Ring of Power Series},
 url = {https://doi.org/10.48550/arXiv.1705.10658},
 volume = {abs/1705.10658},
 year = {2017}
}
[ 133 ]
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 = {https://doi.org/10.1145/2996450},
 volume = {63},
 year = {2017}
}
[ 132 ]
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}
}
[ 131 ]
Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, and Éric Schost. On matrices with displacement structure: Generalized operators and faster algorithms. SIAM J. Matrix Anal. Appl., 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 Anal. Appl.},
 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}
}
[ 130 ]
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}
}
[ 129 ]
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 = {https://doi.org/10.1145/3087604.3087659},
 year = {2017}
}
[ 128 ]
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 = {https://doi.org/10.1145/3087604.3087653},
 year = {2017}
}
[ 127 ]
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 = {https://doi.org/10.1145/3087604.3087642},
 year = {2017}
}
[ 126 ]
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},
 doi = {10.48550/arXiv.1605.06126},
 journal = {CoRR},
 title = {Computation of the Similarity Class of the p-Curvature},
 url = {https://doi.org/10.48550/arXiv.1605.06126},
 volume = {abs/1605.06126},
 year = {2016}
}
[ 125 ]
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},
 doi = {10.48550/arXiv.1605.07433},
 journal = {CoRR},
 title = {Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization},
 url = {https://doi.org/10.48550/arXiv.1605.07433},
 volume = {abs/1605.07433},
 year = {2016}
}
[ 124 ]
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},
 doi = {10.48550/arXiv.1608.05043},
 journal = {CoRR},
 title = {On semiring complexity of Schur polynomials},
 url = {https://doi.org/10.48550/arXiv.1608.05043},
 volume = {abs/1608.05043},
 year = {2016}
}
[ 123 ]
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},
 doi = {10.48550/arXiv.1602.00651},
 journal = {CoRR},
 title = {Fast computation of minimal interpolation bases in Popov form for arbitrary shifts},
 url = {https://doi.org/10.48550/arXiv.1602.00651},
 volume = {abs/1602.00651},
 year = {2016}
}
[ 122 ]
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},
 doi = {10.48550/arXiv.1609.04259},
 journal = {CoRR},
 title = {A Fast Algorithm for Computing the Truncated Resultant},
 url = {https://doi.org/10.48550/arXiv.1609.04259},
 volume = {abs/1609.04259},
 year = {2016}
}
[ 121 ]
Éric Schost and Pierre-Jean Spaenlehauer. A quadratically convergent algorithm for structured low-rank approximation. Found. Comput. Math., 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 = {Found. Comput. Math.},
 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}
}
[ 120 ]
Esmaeil Mehrabi and Éric Schost. A softly optimal monte carlo algorithm for solving bivariate polynomial systems over the integers. J. Complex., 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. Complex.},
 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}
}
[ 119 ]
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}
}
[ 118 ]
Luca De Feo, Cyril Hugounenq, Jérôme Plût, and Éric Schost. Explicit isogenies in quadratic time in any characteristic. LMS J. Comput. Math., 19:267--282, 2016. [ http ]
@article{DBLP:journals/lmsjcm/FeoHPS16,
 author = {Luca De Feo and
Cyril Hugounenq and
J{\'{e}}r{\^{o}}me Pl{\^{u}}t and
{\'{E}}ric Schost},
 doi = {10.1112/s146115701600036x},
 journal = {LMS J. Comput. Math.},
 pages = {267--282},
 title = {Explicit isogenies in quadratic time in any characteristic},
 url = {https://doi.org/10.1112/s146115701600036x},
 volume = {19},
 year = {2016}
}
[ 117 ]
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 = {https://doi.org/10.1145/2930889.2930897},
 year = {2016}
}
[ 116 ]
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 = {https://doi.org/10.1145/2930889.2930928},
 year = {2016}
}
[ 115 ]
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 = {https://doi.org/10.1145/2930889.2930931},
 year = {2016}
}
[ 114 ]
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},
 doi = {10.48550/arXiv.1506.05645},
 journal = {CoRR},
 title = {A Fast Algorithm for Computing the p-Curvature},
 url = {https://doi.org/10.48550/arXiv.1506.05645},
 volume = {abs/1506.05645},
 year = {2015}
}
[ 113 ]
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},
 doi = {10.48550/arXiv.1512.03503},
 journal = {CoRR},
 title = {Computing minimal interpolation bases},
 url = {https://doi.org/10.48550/arXiv.1512.03503},
 volume = {abs/1512.03503},
 year = {2015}
}
[ 112 ]
Javad Doliskani and Éric Schost. Computing in degree 2k-extensions of finite fields of odd characteristic. Des. Codes Cryptogr., 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 Cryptogr.},
 pages = {559--569},
 title = {Computing in degree 2k-extensions of finite fields of odd characteristic},
 url = {https://doi.org/10.1007/s10623-013-9875-7},
 volume = {74},
 year = {2015}
}
[ 111 ]
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. Inf. 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. Inf. 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}
}
[ 110 ]
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}
}
[ 109 ]
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 = {https://doi.org/10.1145/2755996.2756674},
 year = {2015}
}
[ 108 ]
É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 = {https://doi.org/10.1145/2755996.2756637},
 year = {2015}
}
[ 107 ]
Andrew Arnold and Éric Schost. A truncated fourier transform middle product. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {98--99},
 title = {A Truncated Fourier Transform middle product},
 url = {https://doi.org/10.1145/2733693.2733698},
 volume = {48},
 year = {2014}
}
[ 106 ]
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},
 doi = {10.48550/arXiv.1405.5341},
 journal = {CoRR},
 title = {A fast algorithm for computing the characteristic polynomial of the p-curvature},
 url = {https://doi.org/10.48550/arXiv.1405.5341},
 volume = {abs/1405.5341},
 year = {2014}
}
[ 105 ]
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},
 doi = {10.48550/arXiv.1402.0643},
 journal = {CoRR},
 title = {Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations},
 url = {https://doi.org/10.48550/arXiv.1402.0643},
 volume = {abs/1402.0643},
 year = {2014}
}
[ 104 ]
Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, and Éric Schost. A baby step-giant step roadmap algorithm for general algebraic sets. Found. Comput. Math., 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 = {Found. Comput. Math.},
 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}
}
[ 103 ]
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}
}
[ 102 ]
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}
}
[ 101 ]
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 = {https://doi.org/10.1145/2608628.2608650},
 year = {2014}
}
[ 100 ]
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 = {https://doi.org/10.1145/2608628.2608672},
 year = {2014}
}
[ 99 ]
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}
}
[ 98 ]
Éric Schost and Pierre-Jean Spaenlehauer. Newton-like iteration for determinantal systems and structured low rank approximation. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {96--97},
 title = {Newton-like iteration for determinantal systems and structured low rank approximation},
 url = {https://doi.org/10.1145/2576802.2576811},
 volume = {47},
 year = {2013}
}
[ 97 ]
Adrien Poteaux and Éric Schost. Modular composition modulo triangular sets and applications. Comput. Complex., 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 = {Comput. Complex.},
 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}
}
[ 96 ]
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},
 doi = {10.48550/arXiv.1301.5804},
 journal = {CoRR},
 title = {A simple and fast algorithm for computing exponentials of power series},
 url = {https://doi.org/10.48550/arXiv.1301.5804},
 volume = {abs/1301.5804},
 year = {2013}
}
[ 95 ]
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},
 doi = {10.48550/arXiv.1301.6021},
 journal = {CoRR},
 title = {Fast algorithms for ell-adic towers over finite fields},
 url = {https://doi.org/10.48550/arXiv.1301.6021},
 volume = {abs/1301.6021},
 year = {2013}
}
[ 94 ]
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},
 doi = {10.48550/arXiv.1307.7836},
 journal = {CoRR},
 title = {A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets},
 url = {https://doi.org/10.48550/arXiv.1307.7836},
 volume = {abs/1307.7836},
 year = {2013}
}
[ 93 ]
É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},
 doi = {10.48550/arXiv.1312.7279},
 journal = {CoRR},
 title = {A Quadratically Convergent Algorithm for Structured Low-Rank Approximation},
 url = {https://doi.org/10.48550/arXiv.1312.7279},
 volume = {abs/1312.7279},
 year = {2013}
}
[ 92 ]
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}
}
[ 91 ]
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}
}
[ 90 ]
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 l-adic towers over finite fields},
 url = {https://doi.org/10.1145/2465506.2465956},
 year = {2013}
}
[ 89 ]
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 = {https://doi.org/10.1145/2465506.2465526},
 year = {2013}
}
[ 88 ]
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 = {https://doi.org/10.1145/2465506.2465950},
 year = {2013}
}
[ 87 ]
Ioannis Z. Emiris and Éric Schost, editors. Special issue: Symbolic and algebraic computation. Selected papers based on the presentations at the international symposium, ISSAC 2011, San Jose, CA, USA, June 2011, 2013.
@proceedings{zbMATH6139443,
 editor = {Emiris, Ioannis Z. and Schost, {\'{E}}ric},
 title = {Special issue: Symbolic and algebraic computation. Selected papers based on the presentations at the international symposium, ISSAC 2011, San Jose, CA, USA, June 2011},
 year = {2013}
}
[ 86 ]
Romain Lebreton, Esmaeil Mehrabi, and Éric Schost. On the complexity of computing certain resultants. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {108--109},
 title = {On the complexity of computing certain resultants},
 url = {https://doi.org/10.1145/2429135.2429157},
 volume = {46},
 year = {2012}
}
[ 85 ]
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},
 doi = {10.48550/arXiv.1201.6439},
 journal = {CoRR},
 title = {A baby step-giant step roadmap algorithm for general algebraic sets},
 url = {https://doi.org/10.48550/arXiv.1201.6439},
 volume = {abs/1201.6439},
 year = {2012}
}
[ 84 ]
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},
 doi = {10.48550/arXiv.1205.3414},
 journal = {CoRR},
 title = {Power Series Solutions of Singular (q)-Differential Equations},
 url = {https://doi.org/10.48550/arXiv.1205.3414},
 volume = {abs/1205.3414},
 year = {2012}
}
[ 83 ]
Xavier Dahan, Abdulilah Kadri, and Éric Schost. Bit-size estimates for triangular sets in positive dimension. J. Complex., 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. Complex.},
 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}
}
[ 82 ]
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}
}
[ 81 ]
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}
}
[ 80 ]
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}
}
[ 79 ]
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 = {https://doi.org/10.1145/2442829.2442848},
 year = {2012}
}
[ 78 ]
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 = {https://doi.org/10.1145/2442829.2442864},
 year = {2012}
}
[ 77 ]
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},
 doi = {10.48550/arXiv.1109.4323},
 journal = {CoRR},
 title = {On the complexity of computing with zero-dimensional triangular sets},
 url = {https://doi.org/10.48550/arXiv.1109.4323},
 volume = {abs/1109.4323},
 year = {2011}
}
[ 76 ]
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},
 doi = {10.48550/arXiv.1110.4350},
 journal = {CoRR},
 title = {Taking Roots over High Extensions of Finite Fields},
 url = {https://doi.org/10.48550/arXiv.1110.4350},
 volume = {abs/1110.4350},
 year = {2011}
}
[ 75 ]
Mohab Safey El Din and Éric Schost. A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface. Discret. Comput. Geom., 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 = {Discret. Comput. Geom.},
 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}
}
[ 74 ]
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}
}
[ 73 ]
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}
}
[ 72 ]
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}
}
[ 71 ]
É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,
 booktitle = {ISSAC},
 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}
}
[ 70 ]
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}
}
[ 69 ]
Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, and Éric Schost. Complexity and performance results for non fft-based univariate polynomial multiplication. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {99--100},
 title = {Complexity and performance results for non FFT-based univariate polynomial multiplication},
 url = {https://doi.org/10.1145/1940475.1940484},
 volume = {44},
 year = {2010}
}
[ 68 ]
Xavier Dahan, Marc Moreno Maza, Éric Schost, and Adrien Poteaux. Almost linear time operations with triangular sets. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {103--104},
 title = {Almost linear time operations with triangular sets},
 url = {https://doi.org/10.1145/1940475.1940486},
 volume = {44},
 year = {2010}
}
[ 67 ]
Charles-Éric Drevet, Md. Nazrul Islam, and Éric Schost. Optimization techniques for small matrix multiplication. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {107--108},
 title = {Optimization techniques for small matrix multiplication},
 url = {https://doi.org/10.1145/1940475.1940488},
 volume = {44},
 year = {2010}
}
[ 66 ]
Luca De Feo and Éric Schost. transalpyne: a language for automatic transposition. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {105--106},
 title = {transalpyne: a language for automatic transposition},
 url = {https://doi.org/10.1145/1940475.1940487},
 volume = {44},
 year = {2010}
}
[ 65 ]
Luca De Feo and Éric Schost. transalpyne: a language for automatic transposition. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {59--71},
 title = {transalpyne: a language for automatic transposition},
 url = {https://doi.org/10.1145/1838599.1838624},
 volume = {44},
 year = {2010}
}
[ 64 ]
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},
 doi = {10.48550/arXiv.1002.2594},
 journal = {CoRR},
 title = {Fast Arithmetics in Artin-Schreier Towers over Finite Fields},
 url = {https://doi.org/10.48550/arXiv.1002.2594},
 volume = {abs/1002.2594},
 year = {2010}
}
[ 63 ]
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},
 doi = {10.48550/arXiv.1008.3459},
 journal = {CoRR},
 title = {Bit-size estimates for triangular sets in positive dimension},
 url = {https://doi.org/10.48550/arXiv.1008.3459},
 volume = {abs/1008.3459},
 year = {2010}
}
[ 62 ]
Bostan, Alin, Salvy, Bruno, and Schost, Éric. Fast conversion algorithms for orthogonal polynomials. Linear Algebra and its Applications, 432:249--258, 2010. [ http ]
@article{zbMATH5650034,
 author = {Bostan, Alin and Salvy, Bruno and Schost, {\'{E}}ric},
 doi = {10.1016/j.laa.2009.08.002},
 journal = {Linear Algebra and its Applications},
 pages = {249--258},
 title = {Fast conversion algorithms for orthogonal polynomials},
 url = {https://doi.org/10.1016/j.laa.2009.08.002},
 volume = {432},
 year = {2010}
}
[ 61 ]
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},
 doi = {10.48550/arXiv.0901.3657},
 journal = {CoRR},
 title = {Homotopy methods for multiplication modulo triangular sets},
 url = {https://doi.org/10.48550/arXiv.0901.3657},
 volume = {abs/0901.3657},
 year = {2009}
}
[ 60 ]
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},
 doi = {10.48550/arXiv.0901.3843},
 journal = {CoRR},
 title = {Fast algorithms for differential equations in positive characteristic},
 url = {https://doi.org/10.48550/arXiv.0901.3843},
 volume = {abs/0901.3843},
 year = {2009}
}
[ 59 ]
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},
 doi = {10.48550/arXiv.0902.1612},
 journal = {CoRR},
 title = {A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces},
 url = {https://doi.org/10.48550/arXiv.0902.1612},
 volume = {abs/0902.1612},
 year = {2009}
}
[ 58 ]
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}
}
[ 57 ]
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}
}
[ 56 ]
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}
}
[ 55 ]
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}
}
[ 54 ]
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}
}
[ 53 ]
Alin Bostan and Éric Schost. Fast algorithms for differential equations in positive characteristic. In Jeremy R. Johnson, Hyungju Park, and Erich L. 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 L. Kaltofen},
 pages = {47--54},
 publisher = {ACM},
 title = {Fast algorithms for differential equations in positive characteristic},
 url = {https://doi.org/10.1145/1576702.1576712},
 year = {2009}
}
[ 52 ]
Luca De Feo and Éric Schost. Fast arithmetics in artin-schreier towers over finite fields. In Jeremy R. Johnson, Hyungju Park, and Erich L. 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 L. Kaltofen},
 pages = {127--134},
 publisher = {ACM},
 title = {Fast arithmetics in artin-schreier towers over finite fields},
 url = {https://doi.org/10.1145/1576702.1576722},
 year = {2009}
}
[ 51 ]
Xin Li, Marc Moreno Maza, Raqeeb Rasheed, and Éric Schost. The modpn library: bringing fast polynomial arithmetic into maple. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {172--174},
 title = {The modpn library: bringing fast polynomial arithmetic into MAPLE},
 url = {https://doi.org/10.1145/1504347.1504374},
 volume = {42},
 year = {2008}
}
[ 50 ]
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},
 doi = {10.48550/arXiv.0804.2337},
 journal = {CoRR},
 title = {Power Series Composition and Change of Basis},
 url = {https://doi.org/10.48550/arXiv.0804.2337},
 volume = {abs/0804.2337},
 year = {2008}
}
[ 49 ]
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},
 doi = {10.48550/arXiv.0804.2373},
 journal = {CoRR},
 title = {Fast Conversion Algorithms for Orthogonal Polynomials},
 url = {https://doi.org/10.48550/arXiv.0804.2373},
 volume = {abs/0804.2373},
 year = {2008}
}
[ 48 ]
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}
}
[ 47 ]
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}
}
[ 46 ]
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}
}
[ 45 ]
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}
}
[ 44 ]
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 = {https://doi.org/10.1145/1390768.1390806},
 year = {2008}
}
[ 43 ]
Éric Schost and Arash Hariri. Subquadratic polynomial multiplication over gf(2m) 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 GF(2m) Using Trinomial Bases and Chinese Remaindering},
 url = {https://doi.org/10.1007/978-3-642-04159-4_23},
 volume = {5381},
 year = {2008}
}
[ 42 ]
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},
 doi = {10.48550/arXiv.cs/0703121},
 journal = {CoRR},
 title = {Differential Equations for Algebraic Functions},
 url = {https://doi.org/10.48550/arXiv.cs/0703121},
 volume = {abs/cs/0703121},
 year = {2007}
}
[ 41 ]
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}
}
[ 40 ]
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}
}
[ 39 ]
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 = {https://doi.org/10.1145/1277548.1277553},
 year = {2007}
}
[ 38 ]
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 = {https://doi.org/10.1145/1277548.1277554},
 year = {2007}
}
[ 37 ]
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 = {https://doi.org/10.1145/1277548.1277585},
 year = {2007}
}
[ 36 ]
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 = {https://doi.org/10.1145/1277548.1277587},
 year = {2007}
}
[ 35 ]
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. In Nikhil Bansal, Kirk Pruhs, and Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pages 1012--1021. SIAM, 2007. [ http ]
@inproceedings{DBLP:conf/soda/BostanCOSSS07,
 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},
 booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007},
 editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
 pages = {1012--1021},
 publisher = {SIAM},
 title = {Fast computation of power series solutions of systems of differential equations},
 url = {http://dl.acm.org/citation.cfm?id=1283383.1283492},
 year = {2007}
}
[ 34 ]
Alin Bostan, Claude-Pierre Jeannerod, and Éric Schost. Solving structured linear systems of large displacement rank. ACM Commun. Comput. 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 Commun. Comput. Algebra},
 pages = {42--44},
 title = {Solving structured linear systems of large displacement rank},
 url = {https://doi.org/10.1145/1182553.1182558},
 volume = {40},
 year = {2006}
}
[ 33 ]
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},
 doi = {10.48550/arXiv.cs/0604101},
 journal = {CoRR},
 title = {Fast computation of power series solutions of systems of differential equations},
 url = {https://doi.org/10.48550/arXiv.cs/0604101},
 volume = {abs/cs/0604101},
 year = {2006}
}
[ 32 ]
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},
 doi = {10.48550/arXiv.cs/0609020},
 journal = {CoRR},
 title = {Fast algorithms for computing isogenies between elliptic curves},
 url = {https://doi.org/10.48550/arXiv.cs/0609020},
 volume = {abs/cs/0609020},
 year = {2006}
}
[ 31 ]
Pierrick Gaudry, Éric Schost, and Nicolas M. Thiéry. Evaluation properties of symmetric polynomials. Int. J. Algebra Comput., 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 = {Int. J. Algebra Comput.},
 pages = {505--524},
 title = {Evaluation Properties of Symmetric Polynomials},
 url = {https://doi.org/10.1142/S0218196706003128},
 volume = {16},
 year = {2006}
}
[ 30 ]
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}
}
[ 29 ]
Éric Schost, Alin Bostan, and Claude-Pierre Jeannerod. Using fast matrix multiplication to solve structured linear systems. In Wolfram Decker, Mike Dewar, Erich L. 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 L. 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}
}
[ 28 ]
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 = {https://doi.org/10.1145/1145768.1145789},
 year = {2006}
}
[ 27 ]
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 = {https://doi.org/10.1145/1145768.1145814},
 year = {2006}
}
[ 26 ]
Dahan, X., Jin, X., Moreno Maza, M., and Schost, É. Change of ordering for regular chains in positive dimension. In Kotsireas, Ilias (ed.) et al., Maple conference 2006. Proceedings of the conference, Waterloo, Ontario, Canada, July 23--26, 2006. Waterloo: Maplesoft (ISBN 1-897310-13-7/pbk). 26-34, pages 26--34, 2006.
@inproceedings{zbMATH5117574,
 author = {Dahan, X. and Jin, X. and Moreno Maza, M. and Schost, {\'{E}}.},
 booktitle = {Kotsireas, Ilias (ed.) et al., Maple conference 2006. Proceedings of the conference, Waterloo, Ontario, Canada, July 23--26, 2006. Waterloo: Maplesoft (ISBN 1-897310-13-7/pbk). 26-34},
 pages = {26--34},
 title = {Change of ordering for regular chains in positive dimension},
 year = {2006}
}
[ 25 ]
Xavier Dahan, Éric Schost, Marc Moreno Maza, Wenyuan Wu, and Yuzhen Xie. On the complexity of the d5 principle. SIGSAM Bull., 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 = {SIGSAM Bull.},
 pages = {97--98},
 title = {On the complexity of the D5 principle},
 url = {https://doi.org/10.1145/1113439.1113457},
 volume = {39},
 year = {2005}
}
[ 24 ]
Alin Bostan and Éric Schost. Polynomial evaluation and interpolation on special sets of points. J. Complex., 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. Complex.},
 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}
}
[ 23 ]
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}
}
[ 22 ]
É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}
}
[ 21 ]
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 = {https://doi.org/10.1145/1073884.1073901},
 year = {2005}
}
[ 20 ]
É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 = {https://doi.org/10.1145/1073884.1073925},
 year = {2005}
}
[ 19 ]
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. Discret. Comput. Geom., 32:417--430, 2004. [ http ]
@article{DBLP:journals/dcg/DinS04,
 author = {Mohab Safey El Din and
{\'{E}}ric Schost},
 doi = {10.1007/s00454-004-1107-5},
 journal = {Discret. 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 = {https://doi.org/10.1007/s00454-004-1107-5},
 volume = {32},
 year = {2004}
}
[ 18 ]
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}
}
[ 17 ]
Kulesz, L., Matera, G., and Schost, E. Uniform bounds on the number of rational points of a family of curves of genus 2. Journal of Number Theory, 108:241--267, 2004. [ http ]
@article{zbMATH2162039,
 author = {Kulesz, L. and Matera, G. and Schost, E.},
 doi = {10.1016/j.jnt.2004.05.013},
 journal = {Journal of Number Theory},
 pages = {241--267},
 title = {Uniform bounds on the number of rational points of a family of curves of genus 2},
 url = {https://doi.org/10.1016/j.jnt.2004.05.013},
 volume = {108},
 year = {2004}
}
[ 16 ]
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}
}
[ 15 ]
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}
}
[ 14 ]
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 = {https://doi.org/10.1145/1005285.1005294},
 year = {2004}
}
[ 13 ]
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 = {https://doi.org/10.1145/1005285.1005302},
 year = {2004}
}
[ 12 ]
Gaudry, Pierrick and Schost, Éric. Construction of secure random curves of genus 2 over prime fields. In Cachin, Christian (ed.) et al., Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21935-8/pbk). Lecture Notes in Computer Science 3027, 239-256, pages 239--256, 2004. [ http ]
@inproceedings{zbMATH5195469,
 author = {Gaudry, Pierrick and Schost, {\'{E}}ric},
 booktitle = {Cachin, Christian (ed.) et al., Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21935-8/pbk). Lecture Notes in Computer Science 3027, 239-256},
 doi = {10.1007/b97182},
 pages = {239--256},
 title = {Construction of secure random curves of genus 2 over prime fields},
 url = {https://doi.org/10.1007/b97182},
 year = {2004}
}
[ 11 ]
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}
}
[ 10 ]
É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}
}
[ 9 ]
É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}
}
[ 8 ]
Lecerf, G. and Schost, É. Fast multivariate power series multiplication in characteristic zero. Electronic Journal of SADIO, 5:1--10, 2003.
@article{zbMATH5842401,
 author = {Lecerf, G. and Schost, {\'{E}}.},
 journal = {Electronic Journal of SADIO},
 pages = {1--10},
 title = {Fast multivariate power series multiplication in characteristic zero},
 volume = {5},
 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 = {https://doi.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 = {https://doi.org/10.1145/860854.860901},
 year = {2003}
}
[ 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 = {https://doi.org/10.1145/780506.780537},
 year = {2002}
}
[ 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}
}
[ 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}
}
[ 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 = {https://doi.org/10.1145/309831.309838},
 year = {1999}
}