Are Lower Bounds Easier over the Reals? - Hervé Fournier; Pascal Koiran (STOC, 1998)

Lower Bounds Are Not Easier over the Reals: Inside PH. - Hervé Fournier; Pascal Koiran (ICALP, 2000)

Sparse NP-complete problems over the reals with addition. - Hervé Fournier (Theor. Comput. Sci., 2001)

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. - Alexander L. Chistov; Hervé Fournier; Leonid Gurvits; Pascal Koiran (Found. Comput. Math., 2003)

Quantifier rank for parity of embedded finite models. - Hervé Fournier (Theor. Comput. Sci., 2003)

Lower Bounds for Geometric Diameter Problems. - Hervé Fournier; Antoine Vigneron (LATIN, 2006)

A degree bound on decomposable trees. - Dominique Barth; Hervé Fournier (Discret. Math., 2006)

Classical and Intuitionistic Logic Are Asymptotically Identical. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Marek Zaionc (CSL, 2007)

A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. - Hervé Fournier; Antoine Vigneron (Algorithmica, 2007)

Complexity and Limiting Ratio of Boolean Functions over Implication. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Bernhard Gittenberger (MFCS, 2008)

Lower Bounds for Evolution Strategies Using VC-Dimension. - Olivier Teytaud; Hervé Fournier (PPSN, 2008)

Universal relations and #P-completeness. - Hervé Fournier; Guillaume Malod (Theor. Comput. Sci., 2008)

Balanced And/Or Trees and Linear Threshold Functions. - Hervé Fournier; Danièle Gardy; Antoine Genitrini (ANALCO, 2009)

On the shape of decomposable trees. - Dominique Barth; Hervé Fournier; Romain Ravaux (Discret. Math., 2009)

Tautologies over implication with negative literals. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Marek Zaionc (Math. Log. Q., 2010)

Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. - Hervé Fournier; Olivier Teytaud (Algorithmica, 2011)

Fitting a Step Function to a Point Set. - Hervé Fournier; Antoine Vigneron (Algorithmica, 2011)

The fraction of large random trees representing a given Boolean function in implicational logic. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Bernhard Gittenberger (Random Struct. Algorithms, 2012)

A deterministic algorithm for fitting a step function to a weighted point-set. - Hervé Fournier; Antoine Vigneron (Inf. Process. Lett., 2013)

Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. - Hervé Fournier; Guillaume Malod; Stefan Mengel (Comput. Complex., 2015)

The shifted partial derivative complexity of Elementary Symmetric Polynomials. - Hervé Fournier; Nutan Limaye; Meena Mahajan; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2015)

On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. - Hervé Fournier; Sylvain Perifel; Rémi de Joannis de Verclos (Inf. Comput., 2015)

Computing the Gromov hyperbolicity of a discrete metric space. - Hervé Fournier; Anas Ismail; Antoine Vigneron (Inf. Process. Lett., 2015)

Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. - Hervé Fournier; Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001 (SIAM J. Comput., 2015)

Nonnegative rank measures and monotone algebraic branching programs. - Hervé Fournier; Guillaume Malod; Maud Szusterman; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2019)

On the Power of Homogeneous Algebraic Formulas. - Hervé Fournier; Nutan Limaye; Srikanth Srinivasan 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2023)

Towards Optimal Depth-Reductions for Algebraic Formulas. - Hervé Fournier; Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2023)