| Deterministic root finding over finite fields using Graeffe transforms B Grenet, J van Der Hoeven, G Lecerf Applicable Algebra in Engineering, Communication and Computing 27, 237-257, 2016 | 29 | 2016 |
| An Upper Bound for the Permanent versus Determinant Problem B Grenet | 27 | 2011 |
| Randomized root finding over finite FFT-fields using tangent Graeffe transforms B Grenet, J van Der Hoeven, G Lecerf Proceedings of the 2015 ACM on International Symposium on Symbolic and …, 2015 | 22 | 2015 |
| Bounded-degree factors of lacunary multivariate polynomials B Grenet Journal of Symbolic Computation 75, 171-192, 2016 | 19 | 2016 |
| The Multivariate Resultant is NP-hard in any Characteristic B Grenet, P Koiran, N Portier Mathematical Foundations of Computer Science 2010, 477-488, 2010 | 18 | 2010 |
| Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits B Grenet, EL Kaltofen, P Koiran, N Portier Contemporary Mathematics: Randomization, Relaxation, and Complexity in …, 2011 | 17 | 2011 |
| On the complexity of the multivariate resultant B Grenet, P Koiran, N Portier Journal of Complexity 29 (2), 142-157, 2013 | 16 | 2013 |
| The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent B Grenet, P Koiran, N Portier, Y Strozecki Proc. FSTTCS'11, 127-139, 2011 | 15 | 2011 |
| Essentially optimal sparse polynomial multiplication P Giorgi, B Grenet, AP Cray Proceedings of the 45th International Symposium on Symbolic and Algebraic …, 2020 | 14 | 2020 |
| Factoring bivariate lacunary polynomials without heights A Chattopadhyay, B Grenet, P Koiran, N Portier, Y Strozecki Proc. ISSAC'13, 141-148, 2013 | 13 | 2013 |
| Generic reductions for in-place polynomial multiplication P Giorgi, B Grenet, D Roche International Symposium on Symbolic and Algebraic Computation (ISSAC'19 …, 2019 | 11 | 2019 |
| Computing the multilinear factors of lacunary polynomials without heights A Chattopadhyay, B Grenet, P Koiran, N Portier, Y Strozecki Journal of Symbolic Computation, 2021 | 9* | 2021 |
| Fast in-place algorithms for polynomial operations: division, evaluation, interpolation P Giorgi, B Grenet, DS Roche Proceedings of the 45th International Symposium on Symbolic and Algebraic …, 2020 | 9 | 2020 |
| Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach B Grenet Proc. ISSAC'14, 224-231, 2014 | 7 | 2014 |
| Symmetric determinantal representations in characteristic 2 B Grenet, T Monteil, S Thomassé Linear Algebra and its Applications 439 (5), 1364-1381, 2013 | 7 | 2013 |
| Symmetric determinantal representation of weakly-skew circuits B Grenet, EL Kaltofen, P Koiran, N Portier STACS'11, in LIPIcs-Leibniz International Proceedings in Informatics 9, 2011 | 5 | 2011 |
| Sparse polynomial interpolation and division in soft-linear time P Giorgi, B Grenet, A Perret du Cray, DS Roche Proceedings of the 2022 International Symposium on Symbolic and Algebraic …, 2022 | 4 | 2022 |
| Difficulté du résultant et des grands déterminants B Grenet Laboratoire de l'Informatique du Parallélisme, 2009 | 4 | 2009 |
| Polynomial modular product verification and its implications P Giorgi, B Grenet, AP Du Cray Journal of Symbolic Computation 116, 98-129, 2023 | 3 | 2023 |
| On exact division and divisibility testing for sparse polynomials P Giorgi, B Grenet, A Perret du Cray Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …, 2021 | 3 | 2021 |
Pascal KoiranProfessor of Computer Science, Ecole Normale Supérieure de LyonVerified email at ens-lyon.fr
