Pascal Koiran

2.3k total citations
67 papers, 868 citations indexed

About

Pascal Koiran is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Pascal Koiran has authored 67 papers receiving a total of 868 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Computational Theory and Mathematics, 41 papers in Artificial Intelligence and 7 papers in Geometry and Topology. Recurrent topics in Pascal Koiran's work include Polynomial and algebraic computation (23 papers), Complexity and Algorithms in Graphs (18 papers) and Machine Learning and Algorithms (15 papers). Pascal Koiran is often cited by papers focused on Polynomial and algebraic computation (23 papers), Complexity and Algorithms in Graphs (18 papers) and Machine Learning and Algorithms (15 papers). Pascal Koiran collaborates with scholars based in France, United States and Belgium. Pascal Koiran's 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 and has published in prestigious journals such as IEEE Transactions on Information Theory, Neural Computation and Neural Networks.

In The Last Decade

Pascal Koiran

64 papers receiving 797 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Pascal Koiran France 18 577 427 91 76 73 67 868
Czesław Byliński Poland 4 372 0.6× 259 0.6× 205 2.3× 76 1.0× 53 0.7× 4 734
Paul C. Kainen United States 15 299 0.5× 272 0.6× 55 0.6× 31 0.4× 95 1.3× 56 718
Barry Trager United States 12 629 1.1× 244 0.6× 263 2.9× 191 2.5× 59 0.8× 33 887
Dmitrii V. Ṗasechnik Netherlands 14 448 0.8× 161 0.4× 114 1.3× 50 0.7× 164 2.2× 66 777
Jean Berstel France 20 1.4k 2.4× 1.1k 2.5× 156 1.7× 109 1.4× 72 1.0× 57 1.7k
Kazuhiro Yokoyama Japan 12 228 0.4× 333 0.8× 97 1.1× 89 1.2× 42 0.6× 36 588
Andrzej Trybulec Poland 17 734 1.3× 362 0.8× 364 4.0× 186 2.4× 109 1.5× 55 1.4k
Ivo G. Rosenberg Canada 13 491 0.9× 170 0.4× 107 1.2× 139 1.8× 83 1.1× 115 758
Amir Yehudayoff Israel 15 514 0.9× 410 1.0× 42 0.5× 46 0.6× 74 1.0× 88 755
George Havas Australia 14 181 0.3× 283 0.7× 153 1.7× 58 0.8× 148 2.0× 62 610

Countries citing papers authored by Pascal Koiran

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Pascal Koiran

This figure shows the co-authorship network connecting the top 25 collaborators of Pascal Koiran. A scholar is included among the top collaborators of Pascal Koiran based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pascal Koiran. Pascal Koiran is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Koiran, Pascal. (2019). Orthogonal tensor decomposition and orbit closures from a linear\n algebraic perspective. arXiv (Cornell University). 2 indexed citations
2.
Koiran, Pascal, et al.. (2017). On the linear independence of shifted powers. Journal of Complexity. 45. 67–82. 2 indexed citations
3.
Koiran, Pascal. (2017). Root Separation for Trinomials. HAL (Le Centre pour la Communication Scientifique Directe). 4 indexed citations
4.
Koiran, Pascal, et al.. (2014). A Wronskian approach to the real τ-conjecture. Journal of Symbolic Computation. 68. 195–214. 5 indexed citations
5.
Chattopadhyay, Arkadev, et al.. (2013). Computing the multilinear factors of lacunary polynomials without\n heights. arXiv (Cornell University). 1 indexed citations
6.
Koiran, Pascal, et al.. (2010). On the expressive power of CNF formulas of bounded tree- and clique-width. Discrete Applied Mathematics. 159(1). 1–14. 4 indexed citations
7.
Koiran, Pascal, et al.. (2009). Adversary lower bounds for nonadaptive quantum algorithms. Journal of Computer and System Sciences. 76(5). 347–355. 3 indexed citations
8.
Chistov, A. L., et al.. (2008). On the construction of a family of transversal subspaces over finite fields. Linear Algebra and its Applications. 429(2-3). 589–600. 2 indexed citations
9.
Charbit, Pierre, et al.. (2007). Finding a vector orthogonal to roughly half a collection of vectors. Journal of Complexity. 24(1). 39–53. 3 indexed citations
10.
Koiran, Pascal, Natacha Portier, & Gilles Villard. (2003). A rank theorem for Vandermonde matrices. Linear Algebra and its Applications. 378. 99–107. 6 indexed citations
11.
Koiran, Pascal & Natacha Portier. (2001). Back-and-forth systems for generic curves and a decision algorithm for the limit theory. Annals of Pure and Applied Logic. 111(3). 257–275. 3 indexed citations
12.
Blondel, Vincent D., Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, & John N. Tsitsiklis. (2001). Deciding stability and mortality of piecewise affine dynamical systems. Theoretical Computer Science. 255(1-2). 687–696. 31 indexed citations
13.
Koiran, Pascal. (2000). The Complexity of Local Dimensions for Constructible Sets. Journal of Complexity. 16(1). 311–323. 3 indexed citations
14.
Koiran, Pascal, et al.. (1998). Vapnik-Chervonenkis dimension of recurrent neural networks. Discrete Applied Mathematics. 86(1). 63–79. 19 indexed citations
15.
Gurvits, Leonid & Pascal Koiran. (1997). Approximation and Learning of Convex Superpositions. Journal of Computer and System Sciences. 55(1). 161–170. 21 indexed citations
16.
Koiran, Pascal & Eduardo D. Sontag. (1997). Neural Networks with Quadratic VC Dimension. Journal of Computer and System Sciences. 54(1). 190–198. 56 indexed citations
17.
Koiran, Pascal & Eduardo D. Sontag. (1995). Neural Networks with Quadratic VC Dimension. SPIRE - Sciences Po Institutional REpository. 8. 197–203. 7 indexed citations
18.
Cucker, Felipe & Pascal Koiran. (1995). Computing over the Reals with Addition and Order: Higher Complexity Classes. Journal of Complexity. 11(3). 358–376. 21 indexed citations
19.
Koiran, Pascal. (1994). Computing over the reals with addition and order. Theoretical Computer Science. 133(1). 35–47. 37 indexed citations
20.
Cosnard, Michel, Pascal Koiran, & Hélène Paugam‐Moisy. (1994). Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. Journal of Complexity. 10(1). 57–63. 4 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026