Pascal Koiran
Impact in
-
- Polynomial and algebraic computation
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
- semigroups and automata theory
- Cellular Automata and Applications
- Computational Mathematics top 5%
Papers in
-
- Polynomial and algebraic computation 23
- Complexity and Algorithms in Graphs 18
- Computability, Logic, AI Algorithms 15
- Advanced Graph Theory Research 6
- semigroups and automata theory 6
-
- Machine Learning and Algorithms 15
- Coding theory and cryptography 14
- Neural Networks and Applications 12
- Co-authors
- Eduardo D. Sontag (2 shared papers)Felipe Cucker (4 shared papers)Erich Kaltofen (3 shared papers)Michel Cosnard (3 shared papers)Max Garzón (1 shared paper)Natacha Portier (10 shared papers)Vincent D. Blondel (3 shared papers)Emmanuel Jeandel (3 shared papers)
- Journals
- Theoretical Computer Science (10 papers)Journal of Complexity (9 papers)Journal of Computer and System Sciences (5 papers)Computational Complexity (3 papers)Foundations of Computational Mathematics (2 papers)
- Partner nations
- FranceUnited StatesSpain
In The Last Decade
Pascal Koiran
64 papers receiving 797 citations
Peers
Comparison fields: 5 of 66
- Computational Theory and Mathematics 577
- Computational Mathematics 20
- Algebra and Number Theory 76
- Artificial Intelligence 427
- Geometry and Topology 91
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 67 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 65 | |
| 2 | 1997 | 56 | |
| 3 | 2012 | 49 | |
| 4 | 1996 | 40 | |
| 5 | 1994 | 37 | |
| 6 | 2005 | 35 | |
| 7 | 1999 | 32 | |
| 8 | 2001 | 31 | |
| 9 | 1994 | 29 | |
| 10 | 2005 | 25 | |
| 11 | 1999 | 24 | |
| 12 | 2001 | 22 | |
| 13 | 1997 | 21 | |
| 14 | 1995 | 21 | |
| 15 | 1995 | 20 | |
| 16 | 1998 | 19 | |
| 17 | 2003 | 18 | |
| 18 | 2005 | 17 | |
| 19 | 1999 | 17 | |
| 20 | 2006 | 17 |
About Pascal Koiran
Pascal Koiran is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology, Algebra and Number Theory and Electrical and Electronic Engineering, having authored 67 papers that have together received 868 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (23 papers), Complexity and Algorithms in Graphs (18 papers), Machine Learning and Algorithms (15 papers), Computability, Logic, AI Algorithms (15 papers), Coding theory and cryptography (14 papers), Neural Networks and Applications (12 papers), Advanced Graph Theory Research (6 papers) and semigroups and automata theory (6 papers). The work is most often cited by research in Computational Theory and Mathematics (577 citations), Computational Mathematics (20 citations), Algebra and Number Theory (76 citations), Artificial Intelligence (427 citations) and Geometry and Topology (91 citations). Pascal Koiran has collaborated with scholars based in France, United States and Spain. Frequent co-authors include Eduardo D. Sontag, Felipe Cucker, Erich Kaltofen, Michel Cosnard, Max Garzón, Natacha Portier, Vincent D. Blondel, Emmanuel Jeandel, Cristopher Moore and Leonid Gurvits. 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.