Pierre-Jean Spaenlehauer

514 total citations
11 papers, 94 citations indexed

About

Pierre-Jean Spaenlehauer is a scholar working on Computational Theory and Mathematics, Algebra and Number Theory and Computational Mechanics. According to data from OpenAlex, Pierre-Jean Spaenlehauer has authored 11 papers receiving a total of 94 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 5 papers in Algebra and Number Theory and 5 papers in Computational Mechanics. Recurrent topics in Pierre-Jean Spaenlehauer's work include Polynomial and algebraic computation (8 papers), Commutative Algebra and Its Applications (5 papers) and Advanced Numerical Analysis Techniques (4 papers). Pierre-Jean Spaenlehauer is often cited by papers focused on Polynomial and algebraic computation (8 papers), Commutative Algebra and Its Applications (5 papers) and Advanced Numerical Analysis Techniques (4 papers). Pierre-Jean Spaenlehauer collaborates with scholars based in France, Canada and Germany. Pierre-Jean Spaenlehauer's co-authors include Jean‐Charles Faugère, Mohab Safey El Din, Bruno Salvy, Magali Bardet, Éric Schost, Bernd Sturmfels, Giorgio Ottaviani and Pierrick Gaudry and has published in prestigious journals such as Mathematics of Computation, SIAM Journal on Optimization and SIAM Journal on Matrix Analysis and Applications.

In The Last Decade

Pierre-Jean Spaenlehauer

9 papers receiving 85 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Pierre-Jean Spaenlehauer France 5 78 35 30 29 20 11 94
Clément Pernet France 5 65 0.8× 45 1.3× 8 0.3× 10 0.3× 18 0.9× 20 99
J. E. Morais Spain 6 231 3.0× 41 1.2× 122 4.1× 78 2.7× 17 0.8× 6 250
S. A. El-Sheikh Egypt 8 183 2.3× 19 0.5× 12 0.4× 8 0.3× 7 0.3× 38 270
François Boulier France 5 57 0.7× 8 0.2× 25 0.8× 17 0.6× 3 0.1× 27 101
Lenny Fukshansky United States 8 31 0.4× 31 0.9× 60 2.0× 7 0.2× 4 0.2× 34 140
Elisa Gorla Switzerland 8 54 0.7× 73 2.1× 71 2.4× 5 0.2× 8 0.4× 28 162
A. Kandil Egypt 11 212 2.7× 18 0.5× 20 0.7× 7 0.2× 5 0.3× 41 309
Jordi Guàrdia Spain 7 83 1.1× 34 1.0× 59 2.0× 14 0.5× 23 1.1× 22 198
Karl-Otto Stöhr Brazil 7 76 1.0× 69 2.0× 84 2.8× 14 0.5× 18 0.9× 15 231
Jaap Top Netherlands 9 42 0.5× 50 1.4× 62 2.1× 7 0.2× 30 1.5× 51 213

Countries citing papers authored by Pierre-Jean Spaenlehauer

Since Specialization
Citations

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

Fields of papers citing papers by Pierre-Jean Spaenlehauer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Pierre-Jean Spaenlehauer

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

All Works

11 of 11 papers shown
1.
Spaenlehauer, Pierre-Jean, et al.. (2024). Computing a group action from the class field theory of imaginary hyperelliptic function fields. Journal of Symbolic Computation. 125. 102311–102311.
2.
Spaenlehauer, Pierre-Jean, et al.. (2024). Dimension results for extremal-generic polynomial systems over complete toric varieties. Journal of Algebra. 646. 156–182. 1 indexed citations
3.
Spaenlehauer, Pierre-Jean, et al.. (2020). A fast randomized geometric algorithm for computing Riemann-Roch spaces. Mathematics of Computation. 89(325). 2399–2433. 4 indexed citations
4.
Gaudry, Pierrick, et al.. (2018). Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Foundations of Computational Mathematics. 19(3). 591–621.
5.
Schost, Éric & Pierre-Jean Spaenlehauer. (2015). A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. Foundations of Computational Mathematics. 16(2). 457–492. 10 indexed citations
6.
Faugère, Jean‐Charles, et al.. (2014). Sparse Gröbner Bases: the Unmixed Case. arXiv (Cornell University). 178–185. 3 indexed citations
7.
Spaenlehauer, Pierre-Jean. (2014). On the Complexity of Computing Critical Points with Gröbner Bases. SIAM Journal on Optimization. 24(3). 1382–1401. 9 indexed citations
8.
Ottaviani, Giorgio, Pierre-Jean Spaenlehauer, & Bernd Sturmfels. (2014). Exact Solutions in Structured Low-Rank Approximation. SIAM Journal on Matrix Analysis and Applications. 35(4). 1521–1542. 2 indexed citations
9.
Faugère, Jean‐Charles, Mohab Safey El Din, & Pierre-Jean Spaenlehauer. (2013). On the complexity of the generalized MinRank problem. Journal of Symbolic Computation. 55. 30–58. 13 indexed citations
10.
Bardet, Magali, Jean‐Charles Faugère, Bruno Salvy, & Pierre-Jean Spaenlehauer. (2012). On the complexity of solving quadratic Boolean systems. Journal of Complexity. 29(1). 53–75. 31 indexed citations
11.
Faugère, Jean‐Charles, Mohab Safey El Din, & Pierre-Jean Spaenlehauer. (2010). Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity. Journal of Symbolic Computation. 46(4). 406–437. 21 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