| On the complexity of solving quadratic boolean systems M Bardet, JC Faugère, B Salvy, PJ Spaenlehauer Journal of Complexity 29 (1), 53-75, 2013 | 146 | 2013 |
| Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology JC Faugere, MS El Din, PJ Spaenlehauer Proceedings of the 2010 International Symposium on Symbolic and Algebraic …, 2010 | 123 | 2010 |
| Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity JC Faugere, MS El Din, PJ Spaenlehauer Journal of Symbolic Computation 46 (4), 406-437, 2011 | 118 | 2011 |
| On the complexity of the generalized MinRank problem JC Faugère, MS El Din, PJ Spaenlehauer Journal of Symbolic Computation 55, 30-58, 2013 | 69 | 2013 |
| Exact solutions in structured low-rank approximation G Ottaviani, PJ Spaenlehauer, B Sturmfels SIAM Journal on Matrix Analysis and Applications 35 (4), 1521-1542, 2014 | 57 | 2014 |
| Critical points and Gröbner bases: the unmixed case JC Faugère, MS El Din, PJ Spaenlehauer Proceedings of the 37th International Symposium on Symbolic and Algebraic …, 2012 | 40 | 2012 |
| A quadratically convergent algorithm for structured low-rank approximation É Schost, PJ Spaenlehauer Foundations of Computational Mathematics 16 (2), 457-492, 2016 | 36 | 2016 |
| Sparse Gröbner bases: the unmixed case JC Faugere, PJ Spaenlehauer, J Svartz Proceedings of the 39th International Symposium on Symbolic and Algebraic …, 2014 | 32 | 2014 |
| Solving multi-homogeneous and determinantal systems: algorithms, complexity, applications. PJ Spaenlehauer Université Pierre et Marie Curie (Univ. Paris 6), 2012 | 32 | 2012 |
| On the Complexity of Computing Critical Points with Gröbner Bases PJ Spaenlehauer SIAM Journal on Optimization 24 (3), 1382-1401, 2014 | 26 | 2014 |
| Algebraic cryptanalysis of the PKC’2009 algebraic surface cryptosystem JC Faugere, PJ Spaenlehauer Public Key Cryptography–PKC 2010, 35-52, 2010 | 26 | 2010 |
| Improved complexity bounds for counting points on hyperelliptic curves S Abelard, P Gaudry, PJ Spaenlehauer Foundations of Computational Mathematics 19, 591-621, 2019 | 22 | 2019 |
| A polyhedral method for sparse systems with many positive solutions F Bihan, F Santos, PJ Spaenlehauer SIAM Journal on Applied Algebra and Geometry 2 (4), 620-645, 2018 | 20 | 2018 |
| A fast randomized geometric algorithm for computing Riemann-Roch spaces A Le Gluher, PJ Spaenlehauer Mathematics of Computation 89 (325), 2399-2433, 2020 | 18 | 2020 |
| Critical point computations on smooth varieties: degree and complexity bounds M Safey El DIn, PJ Spaenlehauer Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016 | 17 | 2016 |
| Counting points on genus-3 hyperelliptic curves with explicit real multiplication S Abelard, P Gaudry, PJ Spaenlehauer The Open Book Series 2 (1), 1-19, 2019 | 14 | 2019 |
| Algebraic-differential cryptanalysis of DES JC Faugère, L Perret, PJ Spaenlehauer Western European Workshop on Research in Cryptology-WEWoRC 2009, 1-5, 2009 | 10 | 2009 |
| Computing small certificates of inconsistency of quadratic fewnomial systems JC Faugère, PJ Spaenlehauer, J Svartz Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016 | 7 | 2016 |
| Computing a group action from the class field theory of imaginary hyperelliptic function fields A Leudière, PJ Spaenlehauer Journal of Symbolic Computation 125, 102311, 2024 | 5 | 2024 |
| Résolution de systemes multi-homogenes et déterminantiels algorithmes-complexité-applications PJ Spaenlehauer Paris 6, 2012 | 4 | 2012 |
