Mikaël Monet - RankMe

54 papers A* 6A 5B 1Journal 36Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Gray Codes With Constant Delay and Constant Auxiliary Space. CoRR Antoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikaël Monet, Yann Strozecki
2026	A	`conf`	On the Complexity of Language Membership for Probabilistic Words. STACS Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati
2026	J	`jnl`	The S-Hamiltonian Cycle Problem. CoRR Antoine Amarilli, Arthur Lombardo, Mikaël Monet
2025	J	`jnl`	Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules. CoRR Antoine Amarilli, Mikaël Monet, Rémi De Pretto
2025	J	`jnl`	Locality Testing for NFAs is PSPACE-complete. CoRR Antoine Amarilli, Mikaël Monet, Rémi De Pretto
2025	J	`jnl`	On the Complexity of Language Membership for Probabilistic Words. CoRR Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati
2025	J	`jnl`	Resilience for Regular Path Queries: Towards a Complexity Classification. Proc. ACM Manag. Data Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija, Mikaël Monet
2024	J	`jnl`	A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata. CoRR Antoine Amarilli, Marcelo Arenas, YooJung Choi, Mikaël Monet, Guy Van den Broeck, Benjie Wang
2024	J	`jnl`	Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases. CoRR Pratik Karmakar, Mikaël Monet, Pierre Senellart, Stéphane Bressan
2024	J	`jnl`	Expected Shapley-Like Scores of Boolean functions: Complexity and Applications to Probabilistic Databases. Proc. ACM Manag. Data Pratik Karmakar, Mikaël Monet, Pierre Senellart, Stéphane Bressan
2024	A	`conf`	Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
2024	J	`jnl`	Resilience for Regular Path Queries: Towards a Complexity Classification. CoRR Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija, Mikaël Monet
2024	J	`jnl`	The Non-Cancelling Intersections Conjecture. CoRR Antoine Amarilli, Mikaël Monet, Dan Suciu
2024	J	`jnl`	The Shapley Value in Database Management. CoRR Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, Mikaël Monet
2023	A	`conf`	Enumerating Regular Languages with Bounded Delay. STACS Antoine Amarilli, Mikaël Monet
2023	J	`jnl`	On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. J. Mach. Learn. Res. Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
2023	J	`jnl`	Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
2023	J	`jnl`	The Shapley Value in Database Management. SIGMOD Rec. Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, Mikaël Monet
2022	—	`conf`	Computing the Shapley Value of Facts in Query Answering. SIGMOD Conference Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël Monet
2022	J	`jnl`	Enumerating Regular Languages in Constant Delay. CoRR Antoine Amarilli, Mikaël Monet
2022	—	`conf`	ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values. SIGMOD Conference Susan B. Davidson, Daniel Deutch, Nave Frost, Benny Kimelfeld, Omer Koren, Mikaël Monet
2022	B	`conf`	Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. MFCS Antoine Amarilli, Mikaël Monet
2022	J	`jnl`	Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. CoRR Antoine Amarilli, Mikaël Monet
2021	J	`jnl`	Computing the Shapley Value of Facts in Query Answering. CoRR Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël Monet
2021	J	`jnl`	On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. CoRR Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
2021	J	`jnl`	The Complexity of Counting Problems Over Incomplete Databases. ACM Trans. Comput. Log. Marcelo Arenas, Pablo Barceló, Mikaël Monet
2021	A*	`conf`	The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits. AAAI Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
2020	J	`jnl`	Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2020	J	`jnl`	Correction to: Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2020	A*	`conf`	Counting Problems over Incomplete Databases. PODS Marcelo Arenas, Pablo Barceló, Mikaël Monet
2020	J	`jnl`	Model Interpretability through the Lens of Computational Complexity. CoRR Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
2020	A*	`conf`	Model Interpretability through the lens of Computational Complexity. NeurIPS Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
2020	A*	`conf`	Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. PODS Mikaël Monet
2020	J	`jnl`	The Complexity of Counting Problems over Incomplete Databases. CoRR Marcelo Arenas, Pablo Barceló, Mikaël Monet
2020	J	`jnl`	The Expressive Power of Graph Neural Networks as a Query Language. SIGMOD Rec. Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva
2020	A*	`conf`	The Logical Expressiveness of Graph Neural Networks. ICLR Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva
2020	J	`jnl`	The Tractability of SHAP-scores over Deterministic and Decomposable Boolean Circuits. CoRR Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
2019	J	`jnl`	Counting Problems over Incomplete Databases. CoRR Marcelo Arenas, Pablo Barceló, Mikaël Monet
2019	J	`jnl`	Evaluating Datalog via Tree Automata and Cycluits. Theory Comput. Syst. Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2019	J	`jnl`	Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. CoRR Mikaël Monet
2019	J	`jnl`	Towards Deterministic Decomposable Circuits for Safe Queries. CoRR Mikaël Monet, Dan Olteanu
2018	—	`—`	Combined Complexity of Probabilistic Query Evaluation. (Complexité combinée d'évaluation de requêtes sur des données probabilistes). Mikaël Monet
2018	J	`jnl`	Connecting Knowledge Compilation Classes and Width Parameters. CoRR Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2018	A	`conf`	Connecting Width and Structure in Knowledge Compilation. ICDT Antoine Amarilli, Mikaël Monet, Pierre Senellart
2018	J	`jnl`	Evaluating Datalog via Tree Automata and Cycluits. CoRR Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2018	—	`conf`	Towards Deterministic Decomposable Circuits for Safe Queries. AMW Mikaël Monet, Dan Olteanu
2017	A	`conf`	Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2017	A*	`conf`	Conjunctive Queries on Probabilistic Graphs: Combined Complexity. PODS Antoine Amarilli, Mikaël Monet, Pierre Senellart
2017	J	`jnl`	Conjunctive Queries on Probabilistic Graphs: Combined Complexity. CoRR Antoine Amarilli, Mikaël Monet, Pierre Senellart
2017	J	`jnl`	Connecting Width and Structure in Knowledge Compilation. CoRR Antoine Amarilli, Mikaël Monet, Pierre Senellart
2016	—	`conf`	Challenges for Efficient Query Evaluation on Structured Probabilistic Data. SUM Antoine Amarilli, Silviu Maniu, Mikaël Monet
2016	J	`jnl`	Challenges for Efficient Query Evaluation on Structured Probabilistic Data. CoRR Antoine Amarilli, Silviu Maniu, Mikaël Monet
2016	J	`jnl`	Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). CoRR Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2016	—	`conf`	Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. SIGMOD PhD Symposium Mikaël Monet