Pierre-Jean Spaenlehauer

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 17

Top Venues

CoRR

ISSAC

IACR Cryptol. ePrint Arch.

Found. Comput. Math.

Pierre and Marie Curie University, Paris, France (PHD)

Education History

Pierre and Marie Curie University, Paris, France

PHD

Publications

Antoine Leudière, Pierre-Jean Spaenlehauer
Computing a group action from the class field theory of imaginary hyperelliptic function fields. J. Symb. Comput. 125 (2024)
Matías R. Bender, Pierre-Jean Spaenlehauer
Dimension results for extremal-generic polynomial systems over complete toric varieties. CoRR (2023)
Antoine Leudière, Pierre-Jean Spaenlehauer
Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields. IACR Cryptol. ePrint Arch. 2022 (2022)
Antoine Leudière, Pierre-Jean Spaenlehauer
Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields. CoRR (2022)
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. IACR Cryptol. ePrint Arch. 2020 (2020)
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. CoRR (2020)
Aude Le Gluher, Pierre-Jean Spaenlehauer
A fast randomized geometric algorithm for computing Riemann-Roch spaces. Math. Comput. 89 (325) (2020)
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Found. Comput. Math. 19 (3) (2019)
Aude Le Gluher, Pierre-Jean Spaenlehauer
A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces. CoRR (2018)
Frédéric Bihan, Francisco Santos, Pierre-Jean Spaenlehauer
A Polyhedral Method for Sparse Systems with Many Positive Solutions. SIAM J. Appl. Algebra Geom. 2 (4) (2018)
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
Counting points on genus-3 hyperelliptic curves with explicit real multiplication. CoRR (2018)
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. CoRR (2017)
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. ISSAC (2016)
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. CoRR (2016)
Éric Schost, Pierre-Jean Spaenlehauer
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. Found. Comput. Math. 16 (2) (2016)
Mohab Safey El Din, Pierre-Jean Spaenlehauer
Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds. ISSAC (2016)
Mohab Safey El Din, Pierre-Jean Spaenlehauer
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds. CoRR (2016)
Frédéric Bihan, Pierre-Jean Spaenlehauer
Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes. CoRR (2015)
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
Sparse Gröbner bases: algorithms and complexity. ACM Commun. Comput. Algebra 49 (2) (2015)
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
Sparse Gröbner bases: the unmixed case. ISSAC (2014)
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
Sparse Gröbner Bases: the Unmixed Case. CoRR (2014)
Pierre-Jean Spaenlehauer
On the Complexity of Computing Critical Points with Gröbner Bases. SIAM J. Optim. 24 (3) (2014)
Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels
Exact Solutions in Structured Low-Rank Approximation. SIAM J. Matrix Anal. Appl. 35 (4) (2014)
Éric Schost, Pierre-Jean Spaenlehauer
Newton-like iteration for determinantal systems and structured low rank approximation. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer
On the complexity of solving quadratic Boolean systems. J. Complex. 29 (1) (2013)
Pierre-Jean Spaenlehauer
Complexity Bounds for Computing Critical Points with Gröbner Bases Algorithms: the Mixed Case. CoRR (2013)
Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels
Algebraic Methods for Structured Low-Rank Approximation. CoRR (2013)
Éric Schost, Pierre-Jean Spaenlehauer
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. CoRR (2013)
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
On the complexity of the generalized MinRank problem. J. Symb. Comput. 55 (2013)
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Critical Points and Gröbner Bases: the Unmixed Case CoRR (2012)
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Critical points and Gröbner bases: the unmixed case. ISSAC (2012)
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. J. Symb. Comput. 46 (4) (2011)
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
On the Complexity of the Generalized MinRank Problem CoRR (2011)
Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer
On the Complexity of Solving Quadratic Boolean Systems CoRR (2011)
Jean-Charles Faugère, Pierre-Jean Spaenlehauer
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem. Public Key Cryptography (2010)
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity CoRR (2010)
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. ISSAC (2010)

Pierre-Jean Spaenlehauer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierre-Jean Spaenlehauer