Rémi Gilleron

	2009
33		Lingbo Kong, Rémi Gilleron, Aurélien Lemay: ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. DASFAA 2009: 543-548
32		Lingbo Kong, Rémi Gilleron, Aurélien Lemay: Retrieving meaningful relaxed tightest fragments for XML keyword search. EDBT 2009: 815-826
31		Lingbo Kong, Rémi Gilleron, Aurélien Lemay: Retrieving valid matches for XML keyword search. SAC 2009: 1536-1540
30		Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Efficient inclusion checking for deterministic tree automata and XML Schemas. Inf. Comput. 207(11): 1181-1208 (2009)
	2008
29		Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Schema-Guided Induction of Monadic Queries. ICGI 2008: 15-28
28		Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA 2008: 184-195
27		Pierre Senellart, Avin Mittal, Daniel Muschick, Rémi Gilleron, Marc Tommasi: Automatic wrapper induction from hidden-web sources with domain knowledge. WIDM 2008: 9-16
26		François Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, Édouard Gilbert: On Probability Distributions for Trees: Representations, Inference and Learning CoRR abs/0807.2983: (2008)
	2007
25		Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Interactive learning of node selecting tree transducer. Machine Learning 66(1): 33-67 (2007)
	2006
24		Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre: Extraction de relations dans les documents Web. EGC 2006: 415-420
23		Aurélien Lemay, Joachim Niehren, Rémi Gilleron: Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI 2006: 253-267
22		Rémi Gilleron, Florent Jousse, Isabelle Tellier, Marc Tommasi: XML Document Transformation with Conditional Random Fields. INEX 2006: 525-539
21		Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre: Interactive Tuples Extraction from Semi-Structured Data. Web Intelligence 2006: 997-1004
20		Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata CoRR abs/cs/0609015: (2006)
	2005
19		François Denis, Rémi Gilleron, Fabien Letouzey: Learning from positive and unlabeled examples. Theor. Comput. Sci. 348(1): 70-83 (2005)
	2003
18		Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182
17		Francesco De Comité, Rémi Gilleron, Marc Tommasi: Learning Multi-label Alternating Decision Trees from Texts and Data. MLDM 2003: 35-49
	2001
16		François Denis, Rémi Gilleron: PAC Learning under Helpful Distributions. ITA 35(2): 129-148 (2001)
	2000
15		Fabien Letouzey, François Denis, Rémi Gilleron: Learning from Positive and Unlabeled Examples. ALT 2000: 71-85
	1999
14		Francesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey: Positive and Unlabeled Examples Help Learning. ATL 1999: 219-230
13		Rémi Gilleron, Sophie Tison, Marc Tommasi: Set Constraints and Automata. Inf. Comput. 149(1): 1-41 (1999)
	1997
12		François Denis, Rémi Gilleron: PAC Learning under Helpful Distributions. ALT 1997: 132-145
	1996
11		François Denis, Cyrille D'Halluin, Rémi Gilleron: PAC Learning with Simple Examples. STACS 1996: 231-242
	1995
10		Rémi Gilleron, Sophie Tison: Regular Tree Languages and Rewrite Systems. Fundam. Inform. 24(1/2): 157-174 (1995)
	1994
9		Rémi Gilleron, Sophie Tison, Marc Tommasi: Some new Decidability Results on Positive and Negative Set Constraints. CCL 1994: 336-351
8		Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi: Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Theor. Comput. Sci. 127(1): 69-98 (1994)
	1993
7		Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints with Negated Subset Relationships FOCS 1993: 372-380
6		Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints using Tree Automata. STACS 1993: 505-514
	1992
5		Sándor Vágvölgyi, Rémi Gilleron: For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Bulletin of the EATCS 48: 197-209 (1992)
	1991
4		Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi: Bottom-Up Tree Pushdown Automata and Rewrite Systems. RTA 1991: 287-298
3		Rémi Gilleron: Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. STACS 1991: 148-159
	1990
2		Jean-Luc Coquidé, Rémi Gilleron: Proofs and Reachablity Problem for Ground Rewrite Systems. IMYCS 1990: 120-129
	1989
1		Aline Deruyver, Rémi Gilleron: The Reachability Problem for Ground TRS and Some Extensions. TAPSOFT, Vol.1 1989: 227-243

Coauthor Index

1	Julien Carme	[18] [20] [25]
2	Jérôme Champavère	[28] [29] [30]
3	Francesco De Comité	[14] [17]
4	Jean-Luc Coquidé	[2] [4] [8]
5	Cyrille D'Halluin	[11]
6	Max Dauchet	[4] [8]
7	François Denis	[11] [12] [14] [15] [16] [19] [26]
8	Aline Deruyver	[1]
9	Édouard Gilbert	[26]
10	Amaury Habrard	[26]
11	Florent Jousse	[22]
12	Lingbo Kong	[31] [32] [33]
13	Aurélien Lemay	[18] [20] [23] [25] [28] [29] [30] [31] [32] [33]
14	Fabien Letouzey	[14] [15] [19]
15	Patrick Marty	[21] [24]
16	Avin Mittal	[27]
17	Daniel Muschick	[27]
18	Joachim Niehren	[23] [25] [28] [29] [30]
19	Pierre Senellart	[27]
20	Isabelle Tellier	[22]
21	Alain Terlutte	[18] [20]
22	Sophie Tison	[6] [7] [9] [10] [13]
23	Marc Tommasi	[6] [7] [9] [13] [17] [18] [20] [21] [22] [24] [26] [27]
24	Fabien Torre	[21] [24]
25	Sándor Vágvölgyi	[4] [5] [8]