Hervé Fournier

Most-cited papers

Lower bounds for depth 4 formulas computing iterated matrix multiplication
Hervé Fournier, N. Limaye, Guillaume Malod, Srikanth Srinivasan
2014SIAM journal on computing (Print)92 citations
Semantic Scholar
Computing the Gromov hyperbolicity of a discrete metric space
Hervé Fournier, Anas Ismail, A. Vigneron
2012Information Processing Letters92 citations Open access
Semantic Scholar
A degree bound on decomposable trees
D. Barth, Hervé Fournier
2006Discrete Mathematics51 citations Open access
Semantic Scholar
Classical and Intuitionistic Logic Are Asymptotically Identical
Hervé Fournier, Danièle Gardy, Antoine Genitrini, M. Zaionc
2007Annual Conference for Computer Science Logic35 citations
Semantic Scholar
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns
Hervé Fournier, O. Teytaud
2011Algorithmica34 citations Open access
Semantic Scholar
Fitting a Step Function to a Point Set
Hervé Fournier, A. Vigneron
2008Algorithmica33 citations Open access
Semantic Scholar
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
A. Chistov, Hervé Fournier, L. Gurvits, P. Koiran
2003Foundations of Computational Mathematics30 citations
Semantic Scholar
Lower Bounds Are Not Easier over the Reals: Inside PH
Hervé Fournier, P. Koiran
2000International Colloquium on Automata, Languages and Programming25 citations
Semantic Scholar
Are lower bounds easier over the reals?
Hervé Fournier, P. Koiran
1998Symposium on the Theory of Computing22 citations Open access
Semantic Scholar
Lower Bounds for Evolution Strategies Using VC-Dimension
O. Teytaud, Hervé Fournier
2008Parallel Problem Solving from Nature20 citations Open access
Semantic Scholar
The fraction of large random trees representing a given Boolean function in implicational logic
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
2012Random Struct. Algorithms15 citations Open access
Semantic Scholar
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy
Hervé Fournier, Guillaume Malod, Stefan Mengel
2011Computational Complexity12 citations
Semantic Scholar
A deterministic algorithm for fitting a step function to a weighted point-set
Hervé Fournier, A. Vigneron
2011Information Processing Letters12 citations Open access
Semantic Scholar
On the shape of decomposable trees
D. Barth, Hervé Fournier, Romain Ravaux
2009Discrete Mathematics10 citations Open access
Semantic Scholar
Balanced And/Or Trees and Linear Threshold Functions
Hervé Fournier, Danièle Gardy, Antoine Genitrini
2009Workshop on Analytic Algorithmics and Combinatorics9 citations
Semantic Scholar
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
Hervé Fournier, N. Limaye, M. Mahajan, Srikanth Srinivasan
2015Theory of Computing8 citations Open access
Semantic Scholar
Tautologies over implication with negative literals
Hervé Fournier, Danièle Gardy, Antoine Genitrini, M. Zaionc
2010Mathematical Logic Quarterly7 citations Open access
Semantic Scholar
Complexity and Limiting Ratio of Boolean Functions over Implication
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
2008International Symposium on Mathematical Foundations of Computer Science6 citations
Semantic Scholar
On the construction of a family of transversal subspaces over finite fields
A. Chistov, Hervé Fournier, P. Koiran, Sylvain Perifel
20084 citations Open access
Semantic Scholar
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
Hervé Fournier, A. Vigneron
2007Algorithmica4 citations
Semantic Scholar
Quantifier rank for parity of embedded finite models
Hervé Fournier
2003Theoretical Computer Science4 citations Open access
Semantic Scholar
Towards Optimal Depth-Reductions for Algebraic Formulas
Hervé Fournier, N. Limaye, Guillaume Malod, Srikanth Srinivasan +1 more
2023Computational Complexity3 citations
Semantic Scholar
Sparse NP-complete problems over the reals with addition
Hervé Fournier
2001Theoretical Computer Science3 citations Open access
Semantic Scholar
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
2013Information and Computation1 citations Open access
Semantic Scholar
Universal relations and #P-completeness
Hervé Fournier, Guillaume Malod
2006Theoretical Computer Science0 citations Open access
Semantic Scholar
Lower Bounds for Geometric Diameter Problems
Hervé Fournier, A. Vigneron
2006Latin American Symposium on Theoretical Informatics0 citations Open access
Semantic Scholar