default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikaël Monet
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Pratik Karmakar
, Mikaël Monet, Pierre Senellart, Stéphane Bressan:
Expected Shapley-Like Scores of Boolean functions: Complexity and Applications to Probabilistic Databases. Proc. ACM Manag. Data 2(2): 92 (2024)- [c16]Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet:
Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT 2024: 25:1-25:18 - [i21]Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, Mikaël Monet:
The Shapley Value in Database Management. CoRR abs/2401.06234 (2024) - [i20]Pratik Karmakar, Mikaël Monet, Pierre Senellart, Stéphane Bressan:
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases. CoRR abs/2401.06493 (2024) - [i19]Antoine Amarilli, Mikaël Monet, Dan Suciu:
The Non-Cancelling Intersections Conjecture. CoRR abs/2401.16210 (2024) - [i18]Antoine Amarilli, Marcelo Arenas, YooJung Choi, Mikaël Monet, Guy Van den Broeck, Benjie Wang:
A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata. CoRR abs/2404.09674 (2024) - 2023
- [j7]Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet:
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. J. Mach. Learn. Res. 24: 63:1-63:58 (2023) - [j6]Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, Mikaël Monet:
The Shapley Value in Database Management. SIGMOD Rec. 52(2): 6-17 (2023) - [c15]Antoine Amarilli, Mikaël Monet:
Enumerating Regular Languages with Bounded Delay. STACS 2023: 8:1-8:18 - [i17]Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet:
Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR abs/2310.00731 (2023) - 2022
- [c14]Antoine Amarilli, Mikaël Monet:
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. MFCS 2022: 9:1-9:15 - [c13]Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël Monet:
Computing the Shapley Value of Facts in Query Answering. SIGMOD Conference 2022: 1570-1583 - [c12]Susan B. Davidson, Daniel Deutch, Nave Frost, Benny Kimelfeld, Omer Koren, Mikaël Monet:
ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values. SIGMOD Conference 2022: 2373-2376 - [i16]Antoine Amarilli, Mikaël Monet:
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. CoRR abs/2205.00851 (2022) - [i15]Antoine Amarilli, Mikaël Monet:
Enumerating Regular Languages in Constant Delay. CoRR abs/2209.14878 (2022) - 2021
- [j5]Marcelo Arenas, Pablo Barceló, Mikaël Monet:
The Complexity of Counting Problems Over Incomplete Databases. ACM Trans. Comput. Log. 22(4): 21:1-21:52 (2021) - [c11]Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet:
The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits. AAAI 2021: 6670-6678 - [i14]Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet:
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. CoRR abs/2104.08015 (2021) - [i13]Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël Monet:
Computing the Shapley Value of Facts in Query Answering. CoRR abs/2112.08874 (2021) - 2020
- [j4]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart:
Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64(5): 861-914 (2020) - [j3]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart:
Correction to: Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64(5): 915 (2020) - [j2]Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva:
The Expressive Power of Graph Neural Networks as a Query Language. SIGMOD Rec. 49(2): 6-17 (2020) - [c10]Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva:
The Logical Expressiveness of Graph Neural Networks. ICLR 2020 - [c9]Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux:
Model Interpretability through the lens of Computational Complexity. NeurIPS 2020 - [c8]Mikaël Monet:
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. PODS 2020: 149-163 - [c7]Marcelo Arenas, Pablo Barceló, Mikaël Monet:
Counting Problems over Incomplete Databases. PODS 2020: 165-177 - [i12]Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet:
The Tractability of SHAP-scores over Deterministic and Decomposable Boolean Circuits. CoRR abs/2007.14045 (2020) - [i11]Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux:
Model Interpretability through the Lens of Computational Complexity. CoRR abs/2010.12265 (2020) - [i10]Marcelo Arenas, Pablo Barceló, Mikaël Monet:
The Complexity of Counting Problems over Incomplete Databases. CoRR abs/2011.06330 (2020)
2010 – 2019
- 2019
- [j1]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Evaluating Datalog via Tree Automata and Cycluits. Theory Comput. Syst. 63(7): 1620-1678 (2019) - [i9]Marcelo Arenas, Pablo Barceló, Mikaël Monet:
Counting Problems over Incomplete Databases. CoRR abs/1912.11064 (2019) - [i8]Mikaël Monet, Dan Olteanu:
Towards Deterministic Decomposable Circuits for Safe Queries. CoRR abs/1912.11098 (2019) - [i7]Mikaël Monet:
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. CoRR abs/1912.11864 (2019) - 2018
- [b1]Mikaël Monet:
Combined Complexity of Probabilistic Query Evaluation. (Complexité combinée d'évaluation de requêtes sur des données probabilistes). University of Paris-Saclay, France, 2018 - [c6]Mikaël Monet, Dan Olteanu:
Towards Deterministic Decomposable Circuits for Safe Queries. AMW 2018 - [c5]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Connecting Width and Structure in Knowledge Compilation. ICDT 2018: 6:1-6:17 - [i6]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Evaluating Datalog via Tree Automata and Cycluits. CoRR abs/1808.04663 (2018) - [i5]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart:
Connecting Knowledge Compilation Classes and Width Parameters. CoRR abs/1811.02944 (2018) - 2017
- [c4]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT 2017: 6:1-6:19 - [c3]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. PODS 2017: 217-232 - [i4]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. CoRR abs/1703.03201 (2017) - [i3]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Connecting Width and Structure in Knowledge Compilation. CoRR abs/1709.06188 (2017) - 2016
- [c2]Mikaël Monet:
Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. SIGMOD PhD Symposium 2016: 37-41 - [c1]Antoine Amarilli, Silviu Maniu, Mikaël Monet:
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. SUM 2016: 323-330 - [i2]Antoine Amarilli, Silviu Maniu, Mikaël Monet:
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. CoRR abs/1607.05538 (2016) - [i1]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). CoRR abs/1612.04203 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
