| 2008 |
|---|
| 15 | EE | Hervé Fournier,
Antoine Vigneron:
Fitting a Step Function to a Point Set.
ESA 2008: 442-453 |
| 14 | EE | Hervé Fournier,
Danièle Gardy,
Antoine Genitrini,
Bernhard Gittenberger:
Complexity and Limiting Ratio of Boolean Functions over Implication.
MFCS 2008: 347-362 |
| 13 | EE | Olivier Teytaud,
Hervé Fournier:
Lower Bounds for Evolution Strategies Using VC-Dimension.
PPSN 2008: 102-111 |
| 12 | EE | Hervé Fournier,
Guillaume Malod:
Universal relations and #P-completeness.
Theor. Comput. Sci. 407(1-3): 97-109 (2008) |
| 2007 |
|---|
| 11 | EE | Hervé Fournier,
Danièle Gardy,
Antoine Genitrini,
Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical.
CSL 2007: 177-193 |
| 10 | EE | Hervé Fournier,
Antoine Vigneron:
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.
Algorithmica 49(3): 245-257 (2007) |
| 2006 |
|---|
| 9 | EE | Hervé Fournier,
Guillaume Malod:
Universal Relations and #P-Completeness.
CIAC 2006: 368-379 |
| 8 | EE | Hervé Fournier,
Antoine Vigneron:
Lower Bounds for Geometric Diameter Problems.
LATIN 2006: 467-478 |
| 7 | EE | Dominique Barth,
Hervé Fournier:
A degree bound on decomposable trees.
Discrete Mathematics 306(5): 469-477 (2006) |
| 2003 |
|---|
| 6 | EE | Alexander L. Chistov,
Hervé Fournier,
Leonid Gurvits,
Pascal Koiran:
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces.
Foundations of Computational Mathematics 3(4): 421-427 (2003) |
| 5 | EE | Hervé Fournier:
Quantifier rank for parity of embedded finite models.
Theor. Comput. Sci. 295: 153-169 (2003) |
| 2001 |
|---|
| 4 | EE | Hervé Fournier:
Quantifier Rank for Parity of Embedded Finite Models.
MFCS 2001: 375-386 |
| 3 | EE | Hervé Fournier:
Sparse NP-complete problems over the reals with addition.
Theor. Comput. Sci. 255(1-2): 607-610 (2001) |
| 2000 |
|---|
| 2 | EE | Hervé Fournier,
Pascal Koiran:
Lower Bounds Are Not Easier over the Reals: Inside PH.
ICALP 2000: 832-843 |
| 1998 |
|---|
| 1 | EE | Hervé Fournier,
Pascal Koiran:
Are Lower Bounds Easier over the Reals?
STOC 1998: 507-513 |
