Talks
- 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 Novembre 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]