Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. - Mikaël Monet (SIGMOD PhD Symposium, 2016)

Challenges for Efficient Query Evaluation on Structured Probabilistic Data. - Antoine Amarilli; Silviu Maniu; Mikaël Monet (SUM, 2016)

Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (CoRR, 2016)

Combined Tractability of Query Evaluation via Tree Automata and Cycluits. - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (ICDT, 2017)

Conjunctive Queries on Probabilistic Graphs: Combined Complexity. - Antoine Amarilli; Mikaël Monet; Pierre Senellart (PODS, 2017)

Towards Deterministic Decomposable Circuits for Safe Queries. - Mikaël Monet; Dan Olteanu (AMW, 2018)

Connecting Width and Structure in Knowledge Compilation. - Antoine Amarilli; Mikaël Monet; Pierre Senellart (ICDT, 2018)

Combined Complexity of Probabilistic Query Evaluation. (Complexité combinée d'évaluation de requêtes sur des données probabilistes). - Mikaël Monet (2018)

Evaluating Datalog via Tree Automata and Cycluits. - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2019)

The Logical Expressiveness of Graph Neural Networks. - Pablo Barceló; Egor V. Kostylev; Mikaël Monet; Jorge Pérez 001; Juan L. Reutter; Juan Pablo Silva (ICLR, 2020)

Model Interpretability through the lens of Computational Complexity. - Pablo Barceló; Mikaël Monet; Jorge Pérez 001; Bernardo Subercaseaux (NeurIPS, 2020)

Counting Problems over Incomplete Databases. - Marcelo Arenas; Pablo Barceló; Mikaël Monet (PODS, 2020)

Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. - Mikaël Monet (PODS, 2020)

The Tractability of SHAP-scores over Deterministic and Decomposable Boolean Circuits. - Marcelo Arenas; Pablo Barceló; Leopoldo E. Bertossi; Mikaël Monet (CoRR, 2020)

Connecting Knowledge Compilation Classes and Width Parameters. - Antoine Amarilli; Florent Capelli; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2020)

Correction to: Connecting Knowledge Compilation Classes and Width Parameters. - Antoine Amarilli; Florent Capelli; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2020)

The Expressive Power of Graph Neural Networks as a Query Language. - Pablo Barceló; Egor V. Kostylev; Mikaël Monet; Jorge Pérez 001; Juan L. Reutter; Juan Pablo Silva (SIGMOD Rec., 2020)

The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits. - Marcelo Arenas; Pablo Barceló; Leopoldo E. Bertossi; Mikaël Monet (AAAI, 2021)

The Complexity of Counting Problems Over Incomplete Databases. - Marcelo Arenas; Pablo Barceló; Mikaël Monet (ACM Trans. Comput. Log., 2021)

Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. - Antoine Amarilli; Mikaël Monet (MFCS, 2022)

ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values. - Susan B. Davidson; Daniel Deutch; Nave Frost; Benny Kimelfeld; Omer Koren; Mikaël Monet (SIGMOD Conference, 2022)

Computing the Shapley Value of Facts in Query Answering. - Daniel Deutch; Nave Frost; Benny Kimelfeld; Mikaël Monet (SIGMOD Conference, 2022)

Enumerating Regular Languages in Constant Delay. - Antoine Amarilli; Mikaël Monet (CoRR, 2022)

Enumerating Regular Languages with Bounded Delay. - Antoine Amarilli; Mikaël Monet (STACS, 2023)

On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. - Marcelo Arenas; Pablo Barceló; Leopoldo E. Bertossi; Mikaël Monet (J. Mach. Learn. Res., 2023)

The Shapley Value in Database Management. - Leopoldo E. Bertossi; Benny Kimelfeld; Ester Livshits; Mikaël Monet (SIGMOD Rec., 2023)

Ranked Enumeration for MSO on Trees via Knowledge Compilation. - Antoine Amarilli; Pierre Bourhis; Florent Capelli; Mikaël Monet (ICDT, 2024)

The Non-Cancelling Intersections Conjecture. - Antoine Amarilli; Mikaël Monet; Dan Suciu (CoRR, 2024)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata. - Antoine Amarilli; Marcelo Arenas; YooJung Choi 001; Mikaël Monet; Guy Van den Broeck; Benjie Wang 001 (CoRR, 2024)

Expected Shapley-Like Scores of Boolean functions: Complexity and Applications to Probabilistic Databases. - Pratik Karmakar; Mikaël Monet; Pierre Senellart; Stéphane Bressan (Proc. ACM Manag. Data, 2024)

Resilience for Regular Path Queries: Towards a Complexity Classification. - Antoine Amarilli; Wolfgang Gatterbauer; Neha Makhija; Mikaël Monet (Proc. ACM Manag. Data, 2025)