Pascal Koiran
Impact in
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
- Polynomial and algebraic computation
- semigroups and automata theory
- Advanced Graph Theory Research
- Cellular Automata and Applications
- Computational Mathematics top 5%
Papers in
-
- Polynomial and algebraic computation 35
- Complexity and Algorithms in Graphs 31
- Computability, Logic, AI Algorithms 21
- Advanced Graph Theory Research 14
-
- Machine Learning and Algorithms 16
- Neural Networks and Applications 16
- Coding theory and cryptography 15
- Co-authors
- Michel Cosnard (5 shared papers)Natacha Portier (16 shared papers)Eduardo D. Sontag (2 shared papers)Max Garzón (2 shared papers)Vincent D. Blondel (5 shared papers)Felipe Cucker (5 shared papers)Cristopher Moore (2 shared papers)Erich Kaltofen (4 shared papers)
- Journals
- Theoretical Computer Science (11 papers)Journal of Complexity (9 papers)Journal of Computer and System Sciences (5 papers)Computational Complexity (4 papers)Foundations of Computational Mathematics (2 papers)
- Partner nations
- FranceUnited StatesGermany
In The Last Decade
Pascal Koiran
95 papers receiving 1.3k citations
Peers
Comparison fields: 5 of 74
- Computational Theory and Mathematics 967
- Computational Mathematics 28
- Algebra and Number Theory 114
- Artificial Intelligence 658
- Geometry and Topology 139
Countries citing papers authored by Pascal Koiran
This map shows the geographic impact of Pascal Koiran'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 Pascal Koiran with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascal Koiran more than expected).
Fields of papers citing papers by Pascal Koiran
This network shows the impact of papers produced by Pascal Koiran. 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 Pascal Koiran. The network helps show where Pascal Koiran may publish in the future.
Co-authors
The 25 scholars most cited alongside Pascal Koiran, 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 101 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 94 | |
| 2 | 1997 | 68 | |
| 3 | 2012 | 67 | |
| 4 | 1994 | 52 | |
| 5 | 1999 | 52 | |
| 6 | 1996 | 51 | |
| 7 | 2005 | 51 | |
| 8 | 2001 | 48 | |
| 9 | 2005 | 36 | |
| 10 | 2001 | 34 | |
| 11 | 1994 | 32 | |
| 12 | 1999 | 31 | |
| 13 | 1997 | 30 | |
| 14 | 1995 | 29 | |
| 15 | 1998 | 28 | |
| 16 | 1995 | 26 | |
| 17 | 1999 | 25 | |
| 18 | 1997 | 24 | |
| 19 | 2005 | 23 | |
| 20 | 2014 | 21 |
About Pascal Koiran
Pascal Koiran is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology, Algebra and Number Theory and Computational Mathematics, having authored 101 papers that have together received 1.4k indexed citations. Recurring topics across this work include Polynomial and algebraic computation (35 papers), Complexity and Algorithms in Graphs (31 papers), Computability, Logic, AI Algorithms (21 papers), Machine Learning and Algorithms (16 papers), Neural Networks and Applications (16 papers), Coding theory and cryptography (15 papers), Advanced Graph Theory Research (14 papers) and Commutative Algebra and Its Applications (9 papers). The work is most often cited by research in Computational Theory and Mathematics (967 citations), Computational Mathematics (28 citations), Algebra and Number Theory (114 citations), Artificial Intelligence (658 citations) and Geometry and Topology (139 citations). Pascal Koiran has collaborated with scholars based in France, United States and Germany. Frequent co-authors include Michel Cosnard, Natacha Portier, Eduardo D. Sontag, Max Garzón, Vincent D. Blondel, Felipe Cucker, Cristopher Moore, Erich Kaltofen, Leonid I Gurvits and Emmanuel Jeandel. Their work appears in journals such as Theoretical Computer Science, Journal of Complexity, Journal of Computer and System Sciences, 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.