| No. |
Title |
Author |
Year |
| 1 |
Enumerating Regular Languages with Bounded Delay |
Amarilli, Antoine et al. |
2023 |
| 2 |
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries |
Amarilli, Antoine |
2023 |
| 3 |
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families |
Amarilli, Antoine et al. |
2022 |
| 4 |
Dynamic Membership for Regular Languages |
Amarilli, Antoine et al. |
2021 |
| 5 |
Uniform Reliability of Self-Join-Free Conjunctive Queries |
Amarilli, Antoine et al. |
2021 |
| 6 |
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs |
Amarilli, Antoine et al. |
2020 |
| 7 |
Constant-Delay Enumeration for Nondeterministic Document Spanners |
Amarilli, Antoine et al. |
2019 |
| 8 |
Connecting Width and Structure in Knowledge Compilation |
Amarilli, Antoine et al. |
2018 |
| 9 |
Enumeration on Trees under Relabelings |
Amarilli, Antoine et al. |
2018 |
| 10 |
Topological Sorting with Regular Constraints |
Amarilli, Antoine et al. |
2018 |
| 11 |
A Circuit-Based Approach to Efficient Enumeration |
Amarilli, Antoine et al. |
2017 |
| 12 |
Combined Tractability of Query Evaluation via Tree Automata and Cycluits |
Amarilli, Antoine et al. |
2017 |
| 13 |
Possible and Certain Answers for Queries over Order-Incomplete Data |
Amarilli, Antoine et al. |
2017 |
| 14 |
Top-k Querying of Unknown Values under Order Constraints |
Amarilli, Antoine et al. |
2017 |
