List of my talks

This is a complete list of the public talks I have given (also including some talks at invitation-only workshops). Cette page est également disponible en français.

2019 ¶

Provenance in Databases and Links to Knowledge Compilation.
KOCOON Workshop, Maison de la Recherche, Arras, 2019-12-17.
Query Lineages and Knowledge Compilation.
DBAI Workshop, Santa Cruz (Chile), 2019-11-13.
Enumerating Pattern Matches in Texts and Trees.
DKM seminar, INRIA Rennes, 2019-10-24.
Query Evaluation on Probabilistic Data: New Hard Cases.
GT ALGA Annual Meeting 2019, École normale supérieure, Paris, 2019-10-10.
Enumerating Pattern Matches in Text and Trees.
DK915 "Introduction to Research and Business", PUIO, Orsay, 2019-10-03.
Enumeration for MSO Queries on Trees via Circuits.
Computer Science Colloquium, Technion, Haifa, 2019-07-14.
A Circuit-Based Approach to Efficient Enumeration: Enumerating MSO Query Results on Trees and Words.
Enumeration for Data Management, Schloss Dagstuhl, 2019-05-20.
Leveraging the Structure of Uncertain Data.
Information Systems Seminar, University of Oxford, Oxford, 2019-03-05.

2018 ¶

When Can We Answer Queries Using Result-Bounded Data Interfaces?
Kick-off meeting for project CNRS-Momentum, INRIA Lille, 2018-12-10.
Topological sorting under regular constraints.
Automata Seminar, IRIF, Paris, 2018-12-07.
Enumerating pattern matches in texts and trees.
LACL seminar, Université Paris-Est Créteil Val de Marne, Créteil, 2018-11-12.
Énumération sur les arbres avec support des réétiquetages.
BDA 2018, Bucarest, 2018-10-24.
Enumerating pattern matches in texts and trees.
LTCI research day, Télécom Paris, Paris, 2018-10-11.
Enumerating pattern matches in texts and trees.
GREYC ALGO seminar, Université de Caen, Caen, 2018-10-09.
Enumerating Pattern Matches in Text and Trees.
DK915 "Introduction to Research and Business", Télécom Paris, Paris, 2018-10-04.
Topological Sorting under Regular Constraints.
ICALP 2018, Prague, 2018-07-12.
When Can We Answer Queries Using Result-Bounded Data Interfaces?
PODS 2018, Houston (Texas, United States), 2018-06-12. [vidéo in direct download, video on Youtube]
Atelier Mes Données : Signal, Tor Browser, et alternatives Framasoft.
Personal Data Workshop for the Digital Freedom Party, Maison du Libre et des Communs, Paris, 2018-05-25.
Leveraging the Structure of Uncertain Data.
CSCUBS 2018, Bonn, 2018-05-16.
Enumeration on Trees under Relabelings.
ICDT 2018, Vienna, 2018-03-27.
Using Order Constraints in Crowd Data Sourcing.
MoDaS final workshop, Eilat, 2018-02-12.
Finding Topological Sorts in a Regular Language.
Lightning talk, MoDaS final workshop, Eilat, 2018-02-12.

2017 ¶

A Circuit-Based Approach to Efficient Enumeration.
VALDA seminar, École normale supérieure, Paris, 2017-12-07.
A Circuit-Based Approach to Efficient Enumeration.
Recent Trends in Knowledge Compilation, Schloss Dagstuhl, 2017-09-19.
Leveraging the Structure of Uncertain Data.
ESSLLI 2017, Toulouse, 2017-07-26.
A Circuit-Based Approach to Efficient Enumeration.
Aggregate Queries Workshop, INRIA Lille, 2017-06-15.
A Circuit-Based Approach to Efficient Enumeration.
Beyond-NP meeting, Paris-Diderot University, Paris, 2017-05-10.
A Circuit-Based Approach to Efficient Enumeration.
ParisBD2017, Télécom Paris, Paris, 2017-05-09. [submitted abstract]
Qu'est-ce que l'informatique théorique et comment en faire.
Prologin final competition, EPITA, Le Kremlin-Bicêtre, 2017-04-29. [not a professional talk]
Leveraging the Structure of Uncertain Data.
PhD graduation ceremony, Télécom Paris, Paris, 2017-04-21. [vidéo in direct download, video on Youtube]

2016 ¶

Lignages efficaces sur les instances quasi-arborescentes : Limites et extensions.
BDA 2016, Poitiers, 2016-11-17. [video in direct download, video on Youtube]
Query Answering with Guarded Rules and Expressive Constraints.
CEDAR seminar, PCRI, Gif-sur-Yvette, 2016-10-20.
Probabilties and Provenance on Trees and Treelike Instances.
Highlights 2016, Brussels, 2016-09-07. [submitted abstract]
Tractable Lineages on Treelike Instances: Limits and Extensions.
PODS 2016, San Francisco, 2016-06-29.
Leveraging the Structure of Uncertain Data.
Poster, Inaugural Paris Summit on Big Data Management, Télécom Paris, 2016-03-24.
Leveraging the Structure of Uncertain Data.
PhD defense, Télécom Paris, 2016-03-14.
Leveraging the Structure of Uncertain Data.
PhD defense rehearsal, IC2 Lunch Seminar, Télécom Paris, 2016-03-09.
Probabilities and Provenance on Trees and Treelike Instances.
LSV seminar, ENS Cachan, 2016-02-08.
Probabilities and Provenance on Trees and Treelike Instances.
Automata Seminar, LIAFA, Paris, 2016-01-08.

2015 ¶

Combining Existential Rules and Description Logics.
LINKS seminar, INRIA Lille, 2015-10-29.
Combining Existential Rules and Description Logics.
GraphIk Seminar, LIRMM, Montpellier, 2015-10-23.
Circuits de provenance pour les arbres et les instances quasi-arborescentes.
BDA 2015, Hyères, 2015-10-01.
Requêtes sur des données à ordre incomplet.
BDA 2015, Hyères, 2015-09-29.
Combining Existential Rules and Description Logics.
IJCAI 2015, Buenos Aires, 2015-07-28.
Provenance Circuits for Trees and Treelike Instances.
ICALP 2015, Kyoto, 2015-07-10.
Finite Open-World Query Answering with Number Restrictions.
LICS 2015, Kyoto, 2015-07-07.
Structurally Tractable Uncertain Data.
SIGMOD/PODS Ph.D. Symposium 2015, Melbourne, 2015-05-31.
IBEX: Harvesting Entities from the Web Using Unique Identifiers.
WebDB 2015, Melbourne, 2015-05-31.
Uncertainty and Incompleteness.
DigiCosme Spring School on Data Management 2015, ENSTA ParisTech, Palaiseau, 2015-05-19.
Top-k Querying of Incomplete Data under Order Constraints.
CCIPX project meeting, DASFAA 2015, Hanoi, 2015-04-20.
Provenance Circuits for Trees and Treelike Instances.
National University of Singapore, 2015-04-08.
Provenance Circuits for Trees and Treelike Instances.
IC2 Lunch Seminar, Télécom Paris, 2015-03-18.
Provenance Circuits for Trees and Treelike Instances.
LINKS seminar, INRIA Lille, 2015-03-06.

2014 ¶

Déterminer la possibilité en XML probabiliste.
BDA 2014, Grenoble-Autrans, 2014-10-17.
Tractable Query Answering under Probabilistic Constraints.
Highlights 2014, Paris, 2014-09-04. [submitted abstract]
Open-World Finite Query Answering Under Number Restrictions.
Querying and Reasoning Under Expressive Constraints, Schloss Dagstuhl, 2014-08-12.
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies.
LINKS seminar, INRIA Lille, 2014-07-18.
The Possibility Problem for Probabilistic XML.
AMW 2014, Cartagena (Colombia), 2014-06-05.
Uncertainty over Structured and Intensional Data.
Lightning talk, AMWS 2014, Cartagena (Colombia), 2014-06-03.
Uncertainty in Crowd Data Sourcing Under Structural Constraints.
UnCrowd 2014, Denpasar, 2014-04-21.
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies.
ICDT 2014, Athens, 2014-03-24.
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies.
Advanced Topics in Web Data Management seminar, Tel Aviv University, 2014-03-19.
La thèse en bref.
DI meeting, École normale supérieure, Paris, 2014-01-27. [not a professional talk]
Open-World Query Answering Under Number Restrictions.
Dahu working group, ENS Cachan, 2014-01-17.

2013 ¶

Complexity of Merging Ordered Documents.
IC2 Lunch Seminar, Télécom Paris, 2013-11-20.
Programmation orientée données et systèmes Unix.
DI student seminar on programming languages, École normale supérieure, Paris, 2013-11-07.
ParisMatch: Ontology Alignment at scale.
Lightning talk, WebDone (WebDam final workshop), Télécom Paris, 2013-09-30.
Taxonomy-Based Crowd Mining.
DBWeb seminar, Télécom Paris, 2013-09-10.
On the Connections between Relational and XML Probabilistic Data Models.
BNCOD 2013, Oxford, 2013-07-09.

2012 ¶

The Semantic Web, and Related Challenges.
DI meeting, École normale supérieure, Paris, 2012-11-27.
Advances in Holistic Ontology Alignment.
DBWeb seminar, Télécom Paris, 2012-09-04.