The Reachability Problem for Ground TRS and Some Extensions. - Aline Deruyver; Rémi Gilleron (TAPSOFT, Vol.1, 1989)

Proofs and Reachablity Problem for Ground Rewrite Systems. - Jean-Luc Coquidé; Rémi Gilleron (IMYCS, 1990)

Bottom-Up Tree Pushdown Automata and Rewrite Systems. - Jean-Luc Coquidé; Max Dauchet; Rémi Gilleron; Sándor Vágvölgyi (RTA, 1991)

Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. - Rémi Gilleron (STACS, 1991)

For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. - Sándor Vágvölgyi; Rémi Gilleron (Bull. EATCS, 1992)

Solving Systems of Set Constraints with Negated Subset Relationships - Rémi Gilleron; Sophie Tison; Marc Tommasi (FOCS, 1993)

Solving Systems of Set Constraints using Tree Automata. - Rémi Gilleron; Sophie Tison; Marc Tommasi (STACS, 1993)

Some new Decidability Results on Positive and Negative Set Constraints. - Rémi Gilleron; Sophie Tison; Marc Tommasi (CCL, 1994)

Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. - Jean-Luc Coquidé; Max Dauchet; Rémi Gilleron; Sándor Vágvölgyi (Theor. Comput. Sci., 1994)

Regular Tree Languages and Rewrite Systems. - Rémi Gilleron; Sophie Tison (Fundam. Informaticae, 1995)

PAC Learning with Simple Examples. - François Denis; Cyrille D'Halluin; Rémi Gilleron (STACS, 1996)

Positive and Unlabeled Examples Help Learning. - Francesco De Comité; François Denis; Rémi Gilleron; Fabien Letouzey (ALT, 1999)

Set Constraints and Automata. - Rémi Gilleron; Sophie Tison; Marc Tommasi (Inf. Comput., 1999)

PAC Learning under Helpful Distributions. - François Denis; Rémi Gilleron (RAIRO Theor. Informatics Appl., 2001)

Residual Finite Tree Automata. - Julien Carme; Rémi Gilleron; Aurélien Lemay; Alain Terlutte; Marc Tommasi (Developments in Language Theory, 2003)

Learning Multi-label Alternating Decision Trees from Texts and Data. - Francesco De Comité; Rémi Gilleron; Marc Tommasi (MLDM, 2003)

Learning from positive and unlabeled examples. - François Denis; Rémi Gilleron; Fabien Letouzey (Theor. Comput. Sci., 2005)

Extraction de relations dans les documents Web. - Rémi Gilleron; Patrick Marty; Marc Tommasi; Fabien Torre (EGC, 2006)

Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. - Aurélien Lemay; Joachim Niehren; Rémi Gilleron (ICGI, 2006)

XML Document Transformation with Conditional Random Fields. - Rémi Gilleron; Florent Jousse 002; Isabelle Tellier; Marc Tommasi (INEX, 2006)

Interactive Tuples Extraction from Semi-Structured Data. - Rémi Gilleron; Patrick Marty; Marc Tommasi; Fabien Torre (Web Intelligence, 2006)

Interactive learning of node selecting tree transducer. - Julien Carme; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (Mach. Learn., 2007)

Schema-Guided Induction of Monadic Queries. - Jérôme Champavère; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (ICGI, 2008)

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. - Jérôme Champavère; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (LATA, 2008)

Automatic wrapper induction from hidden-web sources with domain knowledge. - Pierre Senellart; Avin Mittal; Daniel Muschick; Rémi Gilleron; Marc Tommasi (WIDM, 2008)

On Probability Distributions for Trees: Representations, Inference and Learning - François Denis; Amaury Habrard; Rémi Gilleron; Marc Tommasi; Édouard Gilbert (CoRR, 2008)

Understanding the Hidden Web. - Pierre Senellart; Serge Abiteboul; Rémi Gilleron (ERCIM News, 2008)

ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. - Lingbo Kong; Rémi Gilleron; Aurélien Lemay (DASFAA, 2009)

Retrieving meaningful relaxed tightest fragments for XML keyword search. - Lingbo Kong; Rémi Gilleron; Aurélien Lemay (EDBT, 2009)

Retrieving valid matches for XML keyword search. - Lingbo Kong; Rémi Gilleron; Aurélien Lemay (SAC, 2009)

Efficient inclusion checking for deterministic tree automata and XML Schemas. - Jérôme Champavère; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (Inf. Comput., 2009)

Boosting Multi-Task Weak Learners with Applications to Textual and Social Data. - Jean Baptiste Faddoul; Boris Chidlovskii; Fabien Torre; Rémi Gilleron (ICMLA, 2010)

Learning Multiple Tasks with Boosted Decision Trees. - Jean Baptiste Faddoul; Boris Chidlovskii; Rémi Gilleron; Fabien Torre (ECML/PKDD (1), 2012)

Learning from Multiple Graphs Using a Sigmoid Kernel. - Thomas Ricatte; Gemma C. Garriga; Rémi Gilleron; Marc Tommasi (ICMLA (2), 2013)

Query induction with schema-guided pruning strategies. - Joachim Niehren; Jérôme Champavère; Aurélien Lemay; Rémi Gilleron (J. Mach. Learn. Res., 2013)

Hypernode Graphs for Spectral Learning on Binary Relations over Sets. - Thomas Ricatte; Rémi Gilleron; Marc Tommasi (ECML/PKDD (2), 2014)

Theoretical Computer Science: Computability, Decidability and Logic. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Theoretical Computer Science: Computational Complexity. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Skill Rating for Multiplayer Games. Introducing Hypernode Graphs and their Spectral Theory. - Thomas Ricatte; Rémi Gilleron; Marc Tommasi (J. Mach. Learn. Res., 2020)

Exploring Category Structure with Contextual Language Models and Lexical Semantic Networks. - Joseph Renner; Pascal Denis; Rémi Gilleron; Angèle Brunellière (EACL, 2023)

WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical Entailment. - Joseph Renner; Pascal Denis; Rémi Gilleron (EMNLP (Findings), 2023)