Hervé Fournier

	2012
23		Hervé Fournier, Guillaume Malod, Stefan Mengel: Monomials in arithmetic circuits: Complete problems in the counting hierarchy. STACS 2012: 362-373
22		Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger: The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms 40(3): 317-349 (2012)
	2011
21		Hervé Fournier, Olivier Teytaud: Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica 59(3): 387-408 (2011)
20		Hervé Fournier, Antoine Vigneron: Fitting a Step Function to a Point Set. Algorithmica 60(1): 95-109 (2011)
19		Hervé Fournier, Antoine Vigneron: A deterministic algorithm for fitting a step function to a weighted point-set CoRR abs/1109.1152: (2011)
18		Hervé Fournier, Guillaume Malod, Stefan Mengel: Monomials in arithmetic circuits: Complete problems in the counting hierarchy CoRR abs/1110.6271: (2011)
	2010
17		Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc: Tautologies over implication with negative literals. Math. Log. Q. 56(4): 388-396 (2010)
	2009
16		Dominique Barth, Hervé Fournier, Romain Ravaux: On the shape of decomposable trees. Discrete Mathematics 309(12): 3882-3887 (2009)
	2008
15		Hervé Fournier, Antoine Vigneron: Fitting a Step Function to a Point Set. ESA 2008: 442-453
14		Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger: Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS 2008: 347-362
13		Olivier Teytaud, Hervé Fournier: Lower Bounds for Evolution Strategies Using VC-Dimension. PPSN 2008: 102-111
12		Hervé Fournier, Guillaume Malod: Universal relations and #P-completeness. Theor. Comput. Sci. 407(1-3): 97-109 (2008)
	2007
11		Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc: Classical and Intuitionistic Logic Are Asymptotically Identical. CSL 2007: 177-193
10		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		Hervé Fournier, Guillaume Malod: Universal Relations and #P-Completeness. CIAC 2006: 368-379
8		Hervé Fournier, Antoine Vigneron: Lower Bounds for Geometric Diameter Problems. LATIN 2006: 467-478
7		Dominique Barth, Hervé Fournier: A degree bound on decomposable trees. Discrete Mathematics 306(5): 469-477 (2006)
	2003
6		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		Hervé Fournier: Quantifier rank for parity of embedded finite models. Theor. Comput. Sci. 295: 153-169 (2003)
	2001
4		Hervé Fournier: Quantifier Rank for Parity of Embedded Finite Models. MFCS 2001: 375-386
3		Hervé Fournier: Sparse NP-complete problems over the reals with addition. Theor. Comput. Sci. 255(1-2): 607-610 (2001)
	2000
2		Hervé Fournier, Pascal Koiran: Lower Bounds Are Not Easier over the Reals: Inside PH. ICALP 2000: 832-843
	1998
1		Hervé Fournier, Pascal Koiran: Are Lower Bounds Easier over the Reals? STOC 1998: 507-513

Coauthor Index

1	Dominique Barth	[7] [16]
2	Alexander L. Chistov	[6]
3	Danièle Gardy	[11] [14] [17] [22]
4	Antoine Genitrini	[11] [14] [17] [22]
5	Bernhard Gittenberger	[14] [22]
6	Leonid Gurvits	[6]
7	Pascal Koiran	[1] [2] [6]
8	Guillaume Malod	[9] [12] [18] [23]
9	Stefan Mengel	[18] [23]
10	Romain Ravaux	[16]
11	Olivier Teytaud	[13] [21]
12	Antoine Vigneron	[8] [10] [15] [19] [20]
13	Marek Zaionc	[11] [17]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page