Natacha Portier

436 total citations
15 papers, 142 citations indexed

About

Natacha Portier is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Natacha Portier has authored 15 papers receiving a total of 142 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 8 papers in Artificial Intelligence and 2 papers in Geometry and Topology. Recurrent topics in Natacha Portier's work include Polynomial and algebraic computation (8 papers), Computability, Logic, AI Algorithms (4 papers) and Coding theory and cryptography (4 papers). Natacha Portier is often cited by papers focused on Polynomial and algebraic computation (8 papers), Computability, Logic, AI Algorithms (4 papers) and Coding theory and cryptography (4 papers). Natacha Portier collaborates with scholars based in France, Belgium and United Kingdom. Natacha Portier's co-authors include Vincent D. Blondel, Pascal Koiran, Emmanuel Jeandel, Vincent Nesme, Gilles Villard, Jürgen Landes, Stéphan Thomassé, Stéphane Gaubert and Arkadev Chattopadhyay and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Natacha Portier

14 papers receiving 132 citations

Peers

Natacha Portier

CTM

AI

GT

ANT

EEE

Pavel Hrubeš United States

John Abbott Italy

Katalin Friedl Hungary

Avishay Tal United States

Clément Pernet France

Clemens Lautemann Germany

N. Sabadini Italy

Gábor Braun United States

Ulrich Hertrampf Germany

Christian Michaux Belgium

Pavel Hrubeš United States

Natacha Portier

124 ×1.1

CTM

86 ×1.2

AI

13 ×0.8

GT

18 ×1.2

ANT

13 ×1.0

EEE

Citations per year, relative to Natacha Portier Natacha Portier (= 1×) peers Pavel Hrubeš

Countries citing papers authored by Natacha Portier

Since Specialization

Citations

This map shows the geographic impact of Natacha Portier'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 Natacha Portier with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Natacha Portier more than expected).

Fields of papers citing papers by Natacha Portier

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Natacha Portier. 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 Natacha Portier. The network helps show where Natacha Portier may publish in the future.

Co-authorship network of co-authors of Natacha Portier

This figure shows the co-authorship network connecting the top 25 collaborators of Natacha Portier. A scholar is included among the top collaborators of Natacha Portier 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 Natacha Portier. Natacha Portier is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

1.

Koiran, Pascal, et al.. (2014). A Wronskian approach to the real τ-conjecture. Journal of Symbolic Computation. 68. 195–214. 5 indexed citations

2.

Koiran, Pascal, et al.. (2014). On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem. Discrete & Computational Geometry. 53(1). 48–63. 3 indexed citations

3.

Koiran, Pascal, et al.. (2014). A $$\tau $$ τ -Conjecture for Newton Polygons. Foundations of Computational Mathematics. 15(1). 185–197. 3 indexed citations

4.

Chattopadhyay, Arkadev, et al.. (2013). Computing the multilinear factors of lacunary polynomials without\n heights. arXiv (Cornell University). 1 indexed citations

5.

Koiran, Pascal, et al.. (2011). The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations

6.

Blondel, Vincent D., Stéphane Gaubert, & Natacha Portier. (2010). The set of realizations of a max-plus linear sequence is semi-polyhedral. Journal of Computer and System Sciences. 77(4). 820–833.

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.

Portier, Natacha, et al.. (2007). Characterizing Valiant's algebraic complexity classes. Journal of Complexity. 24(1). 16–38. 38 indexed citations

9.

Koiran, Pascal, Vincent Nesme, & Natacha Portier. (2007). The quantum query complexity of the abelian hidden subgroup problem. Theoretical Computer Science. 380(1-2). 115–126. 8 indexed citations

10.

Blondel, Vincent D., Emmanuel Jeandel, Pascal Koiran, & Natacha Portier. (2005). Decidable and Undecidable Problems about Quantum Automata. SIAM Journal on Computing. 34(6). 1464–1473. 35 indexed citations

11.

Koiran, Pascal, Natacha Portier, & Gilles Villard. (2003). A rank theorem for Vandermonde matrices. Linear Algebra and its Applications. 378. 99–107. 6 indexed citations

12.

Blondel, Vincent D. & Natacha Portier. (2002). The presence of a zero in an integer linear recurrent sequence is NP-hard to decide. Linear Algebra and its Applications. 351-352. 91–98. 27 indexed citations

13.

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

14.

Portier, Natacha. (1999). Stabilité polynômiale des corps différentiels. Journal of Symbolic Logic. 64(2). 803–816. 1 indexed citations

15.

Portier, Natacha. (1998). Résolutions universelles pour des problèmes NP-complets. Theoretical Computer Science. 201(1-2). 137–150. 1 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