Éric Schost
Impact in
- Computational Theory and Mathematics top 0.2%
- Polynomial and algebraic computation
- Complexity and Algorithms in Graphs
- Matrix Theory and Algorithms
- Geometry and Topology top 5%
- Algebraic Geometry and Number Theory
Papers in
-
- Polynomial and algebraic computation 106
- Matrix Theory and Algorithms 7
- Complexity and Algorithms in Graphs 6
-
- Cryptography and Residue Arithmetic 21
- Co-authors
- Alin Bostan (25 shared papers)Mohab Safey El Din (12 shared papers)Pierrick Gaudry (9 shared papers)Marc Moreno Maza (15 shared papers)Grégoire Lecerf (5 shared papers)Bruno Salvy (12 shared papers)Vincent Neiger (11 shared papers)Claude-Pierre Jeannerod (6 shared papers)
- Journals
- Theoretical Computer Science (5 papers)Mathematics of Computation (5 papers)Journal of Complexity (4 papers)Computational Complexity (3 papers)Foundations of Computational Mathematics (2 papers)
- Partner nations
- CanadaFranceUnited States
In The Last Decade
Éric Schost
121 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 53
- Computational Theory and Mathematics 1.4k
- Geometry and Topology 132
- Information Systems 318
- Algebra and Number Theory 42
- Numerical Analysis 42
Countries citing papers authored by Éric Schost
This map shows the geographic impact of Éric Schost's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Éric Schost with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Éric Schost more than expected).
Fields of papers citing papers by Éric Schost
This network shows the impact of papers produced by Éric Schost. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Éric Schost. The network helps show where Éric Schost may publish in the future.
Co-authors
The 25 scholars most cited alongside Éric Schost, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 129 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 93 | |
| 2 | 2003 | 80 | |
| 3 | 2005 | 73 | |
| 4 | 2003 | 72 | |
| 5 | 2005 | 69 | |
| 6 | 2007 | 56 | |
| 7 | 2004 | 54 | |
| 8 | 2008 | 50 | |
| 9 | 2011 | 48 | |
| 10 | 2009 | 45 | |
| 11 | 2010 | 44 | |
| 12 | 2017 | 44 | |
| 13 | 2004 | 41 | |
| 14 | 2005 | 40 | |
| 15 | 2007 | 38 | |
| 16 | 2004 | 33 | |
| 17 | 2005 | 30 | |
| 18 | 2008 | 29 | |
| 19 | 2003 | 28 | |
| 20 | 2014 | 27 |
About Éric Schost
Éric Schost is a scholar working on Computational Theory and Mathematics, Information Systems, Geometry and Topology, Numerical Analysis and Applied Mathematics, having authored 129 papers that have together received 1.9k indexed citations. Recurring topics across this work include Polynomial and algebraic computation (106 papers), Cryptography and Residue Arithmetic (21 papers), Matrix Theory and Algorithms (7 papers), Complexity and Algorithms in Graphs (6 papers), Algebraic Geometry and Number Theory (6 papers), Mathematical functions and polynomials (3 papers), Coding theory and cryptography (2 papers) and Advanced Optimization Algorithms Research (2 papers). The work is most often cited by research in Computational Theory and Mathematics (1.4k citations), Geometry and Topology (132 citations), Information Systems (318 citations), Algebra and Number Theory (42 citations) and Numerical Analysis (42 citations). Éric Schost has collaborated with scholars based in Canada, France and United States. Frequent co-authors include Alin Bostan, Mohab Safey El Din, Pierrick Gaudry, Marc Moreno Maza, Grégoire Lecerf, Bruno Salvy, Vincent Neiger, Claude-Pierre Jeannerod, Wenyuan Wu and Gilles Villard. Their work appears in journals such as Theoretical Computer Science, Mathematics of Computation, Journal of Complexity, Computational Complexity and Foundations of Computational Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.