Exposés

• 17 juin 2024. Shapley Values for Databases and Machine Learning.
  Séminaire SISE, Lille. [slides]
• 16 janvier 2024. The Intensional-Extensional Problem in Probabilistic Databases.
  Séminaire Dagstuhl « Representation, Provenance, and Explanations in Database Theory and Logic », Dagstuhl. [slides]
• 16 octobre 2023. The Intensional-Extensional Problem in Probabilistic Databases.
  Simons Institute, workshop Probabilistic Circuits and Logic, Berkeley. [slides]
• 8 septembre 2023. Selected research topics.
  Simons Institute, journée Meet the Fellows, Berkeley. [slides]
• 8 novembre 2022. Bounded-delay enumeration of regular languages.
  STACS 2023, Hamburg. [slides], [publication correspondante]
• 22 novembre 2022. Bounded-delay enumeration of regular languages.
  WEPA 2022, Clermont-Ferrand. [slides][publication correspondante]
• 23 août 2022. Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.
  MFCS 2022, Vienne. [slides], [publication correspondante]
• 1er juillet 2022. Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.
  HIGHLIGHTS 2022, Paris. [slides], [publication correspondante]
• 25 février 2022. Shapley Values for Databases and Machine Learning.
  Séminaire VALDA, Paris. [slides]
• 6 décembre 2021. Shapley Values for Relational Databases.
  Visite du laboratoire Cristal d'étudiants de l'ENS Paris-Saclay, Lille. [slides]
• 22 octobre 2021. Shapley Values for Databases and Machine Learning.
  Séminaire LINKS, Lille. [slides]
• 6 février 2021. The Tractability of SHAP-Score-Based Explanations over Deterministic and Decomposable Boolean Circuits.
  AAAI 2021, en visioconférence. [slides], [publication correspondante]
• 29 septembre 2020. Counting Problems over Incomplete Databases (avec plus de détails).
  Séminaire Méthodes Formelles, LaBRI, en visioconférence. [slides], [publication correspondante]
• 15 juin 2020. Counting Problems over Incomplete Databases.
  PODS 2020, en visioconférence. [slides], [publication correspondante]
• 15 juin 2020. Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases.
  PODS 2020, en visioconférence. [slides], [publication correspondante]
• 12 mars 2020. Logical Expressiveness of Graph Neural Networks.
  séminaire DIG, Paris. [slides]
• 13 novembre 2019. A Game on Directed Acyclic Graphs.
  DBAI workshop, Chili. [slides]
• 18 octobre 2019. Combined Complexity of Probabilistic Query Evaluation.
  Prix de thèse BDA, Lyon. [slides]
• 10 octobre 2019. Logical Expressiveness of Graph Neural Networks.
  Séminaire GT ALGA, Paris. [slides]
• 08 août 2019. Counting Incomplete Databases.
  Workshop IMFD, Viña del mar, Chili. [poster]
• 08 août 2019. Expressive Power of Graph Neural Networks.
  Workshop IMFD, Viña del mar, Chili. [slides]
• 26 juillet 2019. Expressive Power of Graph Neural Networks.
  Réunion IMFD, Université du Chili. [slides]
• 24 octobre 2018. Connecting Width and Structure in Knowledge Compilation.
  BDA 2018, Bucarest. [slides], [publication correspondante]
• 12 octobre 2018. Combined Complexity of Probabilistic Query Evaluation.
  Soutenance de thèse, Télécom ParisTech. [slides]
• 05 octobre 2018. Combined Complexity of Probabilistic Query Evaluation.
  Séminaire VALDA, Paris. Répétition de soutenance.
• 24 mai 2018. Deterministic Decomposable Circuits for Safe Queries.
  AMW 2018, Cali. [poster], [slides], [publication correspondante]
• 28 mars 2018. Connecting Width and Structure in Knowledge Compilation.
  ICDT 2018, Vienne. [slides], [publication correspondante]
• 3 novembre 2017. Knowledge Compilation for Probabilistic Databases.
  Séminaire VALDA, Paris. [slides]
• 15 septembre 2017. Probabilistic Graph Homomorphism.
  HIGHLIGHTS 2017, Londres. [slides], [publication correspondante]
• 16 mai 2017. Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
  PODS 2017, Chicago. [poster], [slides], [publication correspondante]
• 23 mars 2017. Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
  ICDT 2017, Venise. [poster], [slides], [publication correspondante]
• 13 octobre 2016. Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
  Journée de la Chaire Big Data & Market Insights, Paris. [poster]
• 23 septembre 2016. Challenges for Efficient Query Evaluation on Structured Probabilistic Data.
  SUM 2016, Nice, France. [slides], [publication correspondante]
• 26 juin 2016. Probabilistic Query Evaluation on Bounded-Treewidth Instances.
  SIGMOD/PODS 2016 PhD Symposium, San Francisco, Californie. [slides], [publication correspondante]