Alin Bostan
Impact in
-
- Polynomial and algebraic computation
- Numerical Methods and Algorithms
- Computational Mathematics top 5%
Papers in
-
- Polynomial and algebraic computation 43
- Numerical Methods and Algorithms 12
-
- Algebraic Geometry and Number Theory 11
- Co-authors
- Éric Schost (24 shared papers)Bruno Salvy (17 shared papers)Grégoire Lecerf (3 shared papers)Frédéric Chyzak (10 shared papers)Pierrick Gaudry (2 shared papers)Shaoshi Chen (2 shared papers)Manuel Kauers (2 shared papers)Claude-Pierre Jeannerod (3 shared papers)
In The Last Decade
Alin Bostan
50 papers receiving 690 citations
Peers
Comparison fields: 5 of 47
- Computational Theory and Mathematics 527
- Computational Mathematics 17
- Discrete Mathematics and Combinatorics 73
- Algebra and Number Theory 102
- Geometry and Topology 161
Countries citing papers authored by Alin Bostan
This map shows the geographic impact of Alin Bostan'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 Alin Bostan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alin Bostan more than expected).
Fields of papers citing papers by Alin Bostan
This network shows the impact of papers produced by Alin Bostan. 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 Alin Bostan. The network helps show where Alin Bostan may publish in the future.
Co-authors
The 25 scholars most cited alongside Alin Bostan, 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 53 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 76 | |
| 2 | 2005 | 68 | |
| 3 | 2007 | 45 | |
| 4 | 2008 | 42 | |
| 5 | 2005 | 39 | |
| 6 | 2007 | 35 | |
| 7 | 2010 | 34 | |
| 8 | 2004 | 33 | |
| 9 | 2013 | 30 | |
| 10 | 2008 | 26 | |
| 11 | 2009 | 25 | |
| 12 | 2007 | 25 | |
| 13 | 2003 | 22 | |
| 14 | 2015 | 17 | |
| 15 | 2005 | 16 | |
| 16 | 2008 | 13 | |
| 17 | 2004 | 13 | |
| 18 | 2013 | 12 | |
| 19 | Low Complexity Algorithms for Linear Recurrences | 2006 | 10 |
| 20 | 2014 | 9 |
About Alin Bostan
Alin Bostan is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Algebra and Number Theory, Numerical Analysis and Artificial Intelligence, having authored 53 papers that have together received 722 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (43 papers), Coding theory and cryptography (13 papers), Numerical Methods and Algorithms (12 papers), Algebraic Geometry and Number Theory (11 papers), Cryptography and Residue Arithmetic (7 papers), Advanced Numerical Analysis Techniques (7 papers), Numerical methods for differential equations (6 papers) and Advanced Combinatorial Mathematics (6 papers). The work is most often cited by research in Computational Theory and Mathematics (527 citations), Computational Mathematics (17 citations), Discrete Mathematics and Combinatorics (73 citations), Algebra and Number Theory (102 citations) and Geometry and Topology (161 citations). Alin Bostan has collaborated with scholars based in France, Canada and Austria. Frequent co-authors include Éric Schost, Bruno Salvy, Grégoire Lecerf, Frédéric Chyzak, Pierrick Gaudry, Shaoshi Chen, Manuel Kauers, Claude-Pierre Jeannerod, François Morain and Philippe Flajolet. Their work appears in journals such as Mathematics of Computation, Theoretical Computer Science, SIAM Journal on Computing, Advances in Applied Mathematics and Bulletin of the American Mathematical Society.
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.