| 2024 | STOC | On the Power of Homogeneous Algebraic Formulas. | Herv Fournier, Nutan Limaye, Srikanth Srinivasan, Sbastien Tavenas |
| 2015 | MFCS | The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. | Herv Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan |
| 2014 | STOC | Lower bounds for depth 4 formulas computing iterated matrix multiplication. | Herv Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan |
| 2013 | MFCS | On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. | Herv Fournier, Sylvain Perifel, Rmi de Joannis de Verclos |
| 2012 | STACS | Monomials in arithmetic circuits: Complete problems in the counting hierarchy. | Herv Fournier, Guillaume Malod, Stefan Mengel |
| 2008 | ESA | Fitting a Step Function to a Point Set. | Herv Fournier, Antoine Vigneron |
| 2008 | MFCS | Complexity and Limiting Ratio of Boolean Functions over Implication. | Herv Fournier, Danile Gardy, Antoine Genitrini, Bernhard Gittenberger |
| 2008 | PPSN | Lower Bounds for Evolution Strategies Using VC-Dimension. | Olivier Teytaud, Herv Fournier |
| 2007 | CSL | Classical and Intuitionistic Logic Are Asymptotically Identical. | Herv Fournier, Danile Gardy, Antoine Genitrini, Marek Zaionc |
| 2006 | CIAC | Universal Relations and #P-Completeness. | Herv Fournier, Guillaume Malod |
| 2006 | LATIN | Lower Bounds for Geometric Diameter Problems. | Herv Fournier, Antoine Vigneron |
| 2001 | MFCS | Quantifier Rank for Parity of Embedded Finite Models. | Herv Fournier |
| 2000 | ICALP | Lower Bounds Are Not Easier over the Reals: Inside PH. | Herv Fournier, Pascal Koiran |
| 1998 | STOC | Are Lower Bounds Easier over the Reals? | Herv Fournier, Pascal Koiran |