| 2026 | EuroCrypt | Oblivious Ciphertext Compression via Linear Codes. | Pascal Giorgi, Bruno Grenet, Mark Simkin |
| 2025 | ACNS | Optimal Communication Unbalanced Private Set Union. | Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche |
| 2024 | ISSAC | In-place accumulation of fast multiplication formulae. | Jean-Guillaume Dumas, Bruno Grenet |
| 2024 | ISSAC | In-place fast polynomial modular remainder. | Jean-Guillaume Dumas, Bruno Grenet |
| 2024 | ISSAC | Fast interpolation and multiplication of unbalanced polynomials. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche |
| 2022 | ISSAC | Random Primes without Primality Testing. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche |
| 2022 | ISSAC | Sparse Polynomial Interpolation and Division in Soft-linear Time. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche |
| 2021 | ISSAC | On Exact Division and Divisibility Testing for Sparse Polynomials. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray |
| 2020 | ISSAC | Essentially optimal sparse polynomial multiplication. | Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray |
| 2020 | ISSAC | Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. | Pascal Giorgi, Bruno Grenet, Daniel S. Roche |
| 2020 | SODA | One (more) line on the most Ancient Algorithm in History. | Bruno Grenet, Ilya Volkovich |
| 2019 | ISSAC | Generic Reductions for In-place Polynomial Multiplication. | Pascal Giorgi, Bruno Grenet, Daniel S. Roche |
| 2015 | ISSAC | Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms. | Bruno Grenet, Joris van der Hoeven, Grgoire Lecerf |
| 2014 | ISSAC | Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach. | Bruno Grenet |
| 2013 | ISSAC | Factoring bivariate lacunary polynomials without heights. | Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki |
| 2011 | STACS | Symmetric Determinantal Representation of Weakly-Skew Circuits. | Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier |
| 2010 | MFCS | The Multivariate Resultant Is NP-hard in Any Characteristic. | Bruno Grenet, Pascal Koiran, Natacha Portier |