Talks

• 17 June 2024. Shapley Values for Databases and Machine Learning.
  SISE seminar, Lille. [slides]
• 16 January 2024. The Intensional-Extensional Problem in Probabilistic Databases.
  “Representation, Provenance, and Explanations in Database Theory and Logic” Dagstuhl seminar, Dagstuhl. [slides]
• 16 October 2023. The Intensional-Extensional Problem in Probabilistic Databases.
  Simons Institute, Probabilistic Circuits and Logic workshop, Berkeley. [slides]
• 8 September 2023. Selected research topics.
  Simons Institute, Meet the Fellows's day, Berkeley. [slides]
• 8 Novembre 2022. Bounded-delay enumeration of regular languages.
  STACS 2023, Hamburg. [slides], [corresponding publication]
• 22 Novembre 2022. Bounded-delay enumeration of regular languages.
  WEPA 2022, Clermont-Ferrand. [slides], [corresponding publication]
• 23rd July 2022. Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.
  MFCS 2022, Vienna. [slides], [corresponding publication]
• 1st July 2022. Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.
  HIGHLIGHTS 2022, Paris. [slides], [corresponding publication]
• 25 February 2022. Shapley Values for Databases and Machine Learning.
  VALDA seminar, Paris. [slides]
• 6 December 2021. Shapley Values for Relational Databases.
  Visit of the Cristal lab by students from the Paris-Saclay ENS, Lille. [slides]
• 22 October 2021. Shapley Values for Databases and Machine Learning.
  LINKS seminar, Lille. [slides]
• 6 February 2021. The Tractability of SHAP-Score-Based Explanations over Deterministic and Decomposable Boolean Circuits.
  AAAI 2021, held online. [slides], [corresponding publication]
• 29 September 2020. Counting Problems over Incomplete Databases (with more details).
  Formal Methods team seminar at LaBRI, held online. [slides], [corresponding publication]
• 15 June 2020. Counting Problems over Incomplete Databases.
  PODS 2020, held online. [slides], [corresponding publication]
• 15 June 2020. Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases.
  PODS 2020, held online. [slides], [corresponding publication]
• 12 March 2020. Logical Expressiveness of Graph Neural Networks.
  DIG seminar, Paris. [slides]
• 13 November 2019. A Game on Directed Acyclic Graphs.
  DBAI workshop, Chile. [slides]
• 18 Octobre 2019. Combined Complexity of Probabilistic Query Evaluation.
  BDA thesis award, Lyon. [slides]
• 10 October 2019. Logical Expressiveness of Graph Neural Networks.
  GT ALGA seminar, Paris. [slides]
• 08 August 2019. Counting Incomplete Databases.
  IMFD workshop, Viña del mar, Chile. [poster]
• 08 August 2019. Expressive Power of Graph Neural Networks.
  IMFD workshop, Viña del mar, Chile. [slides]
• 26 July 2019. Expressive Power of Graph Neural Networks.
  IMFD meeting, University of Chile. [slides]
• 24 Octobre 2018. Connecting Width and Structure in Knowledge Compilation.
  BDA 2018, Bucharest. [slides], [corresponding publication]
• 12 Octobre 2018. Combined Complexity of Probabilistic Query Evaluation.
  PhD defense, Télécom ParisTech. [slides]
• 05 Octobre 2018. Combined Complexity of Probabilistic Query Evaluation.
  VALDA seminar, Paris. PhD defense rehearsal.
• 24 May 2018. Deterministic Decomposable Circuits for Safe Queries.
  AMW 2018, Cali. [poster], [slides], [corresponding publication]
• 28 March 2018. Connecting Width and Structure in Knowledge Compilation.
  ICDT 2018, Vienna. [slides], [corresponding publication]
• 3 November 2017. Knowledge Compilation for Probabilistic Databases.
  VALDA seminar, Paris. [slides]
• 15 September 2017. Probabilistic Graph Homomorphism.
  HIGHLIGHTS 2017, London. [slides], [corresponding publication]
• 16 May 2017. Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
  PODS 2017, Chicago, Illinois. [poster], [slides], [corresponding publication]
• 23 March 2017. Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
  ICDT 2017, Venice, Italy. [poster], [slides], [corresponding publication]
• 13 Octobre 2016. Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
  Big Data and Market Insights event, Paris, France. [poster]
• 23 Septembre 2016. Challenges for Efficient Query Evaluation on Structured Probabilistic Data.
  SUM 2016, Nice, France. [slides], [corresponding publication]
• 26 June 2016. Probabilistic Query Evaluation on Bounded-Treewidth Instances.
  SIGMOD/PODS 2016 PhD Symposium, San Francisco, California. [slides], [corresponding publication]