1. Hypertree width and related hypergraph invariants
2. The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs
3. Antoine Amarilli and Benny Kimelfeld . 2021 . Uniform Reliability of Self-Join-Free Conjunctive Queries . In ICDT (LIPIcs , Vol. 186). Schloss Dagstuhl - Leibniz-Zentrum fü r Informatik, 17:1--17: 17 . Antoine Amarilli and Benny Kimelfeld. 2021. Uniform Reliability of Self-Join-Free Conjunctive Queries. In ICDT (LIPIcs, Vol. 186). Schloss Dagstuhl - Leibniz-Zentrum fü r Informatik, 17:1--17:17.
4. Antoine Amarilli , Mikaë l Monet, and Pierre Senellart . 2017 . Conjunctive Queries on Probabilistic Graphs : Combined Complexity. In PODS. ACM , 217--232. Antoine Amarilli, Mikaë l Monet, and Pierre Senellart. 2017. Conjunctive Queries on Probabilistic Graphs: Combined Complexity. In PODS. ACM, 217--232.
5. #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes