| 2026 | ICALP | Gray Codes with Constant Delay and Constant Auxiliary Space. | Antoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikal Monet, Yann Strozecki |
| 2026 | ICALP | Out-Of-Order Membership in Regular Languages. | Antoine Amarilli, Sbastien Labb, Charles Paperman |
| 2026 | MFCS | Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language. | Antoine Amarilli, Sven Dziadek, Luc Segoufin |
| 2026 | STACS | On the Complexity of Language Membership for Probabilistic Words. | Antoine Amarilli, Mikal Monet, Paul Raphal, Sylvain Salvati |
| 2026 | WG | The S-Hamiltonian Cycle Problem. | Antoine Amarilli, Arthur Lombardo, Mikal Monet |
| 2025 | MFCS | Dynamic Membership for Regular Tree Languages. | Antoine Amarilli, Corentin Barloy, Louis Jachiet, Charles Paperman |
| 2025 | MFCS | Linear Time Subsequence and Supersequence Regex Matching. | Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid |
| 2024 | ICDT | Ranked Enumeration for MSO on Trees via Knowledge Compilation. | Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikal Monet |
| 2024 | ICDT | Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. | Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel |
| 2024 | ICDT | Skyline Operators for Document Spanners. | Antoine Amarilli, Benny Kimelfeld, Sbastien Labb, Stefan Mengel |
| 2023 | ICDT | Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. | Antoine Amarilli |
| 2023 | STACS | Enumerating Regular Languages with Bounded Delay. | Antoine Amarilli, Mikal Monet |
| 2022 | MFCS | Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. | Antoine Amarilli, Mikal Monet |
| 2022 | PODS | Efficient Enumeration for Annotated Grammars. | Antoine Amarilli, Louis Jachiet, Martn Muoz, Cristian Riveros |
| 2021 | ICALP | Dynamic Membership for Regular Languages. | Antoine Amarilli, Louis Jachiet, Charles Paperman |
| 2021 | ICDE | Managing Consent for Data Access in Shared Databases. | Osnat Drien, Antoine Amarilli, Yael Amsterdamer |
| 2021 | ICDT | Uniform Reliability of Self-Join-Free Conjunctive Queries. | Antoine Amarilli, Benny Kimelfeld |
| 2020 | CIKM | Computing and Illustrating Query Rewritings on Path Views with Binding Patterns. | Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek |
| 2020 | ICDT | A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. | Antoine Amarilli, Ismail Ilkan Ceylan |
| 2019 | ICDT | Constant-Delay Enumeration for Nondeterministic Document Spanners. | Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth |
| 2019 | PODS | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. | Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth |
| 2018 | ICALP | Topological Sorting with Regular Constraints. | Antoine Amarilli, Charles Paperman |
| 2018 | ICDT | Enumeration on Trees under Relabelings. | Antoine Amarilli, Pierre Bourhis, Stefan Mengel |
| 2018 | ICDT | Connecting Width and Structure in Knowledge Compilation. | Antoine Amarilli, Mikal Monet, Pierre Senellart |
| 2018 | PODS | When Can We Answer Queries Using Result-Bounded Data Interfaces? | Antoine Amarilli, Michael Benedikt |
| 2017 | ICALP | A Circuit-Based Approach to Efficient Enumeration. | Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel |
| 2017 | ICDT | Top-k Querying of Unknown Values under Order Constraints. | Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart |
| 2017 | ICDT | Combined Tractability of Query Evaluation via Tree Automata and Cycluits. | Antoine Amarilli, Pierre Bourhis, Mikal Monet, Pierre Senellart |
| 2017 | PODS | Conjunctive Queries on Probabilistic Graphs: Combined Complexity. | Antoine Amarilli, Mikal Monet, Pierre Senellart |
| 2017 | WSDM | Predicting Completeness in Knowledge Bases. | Luis Galrraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek |
| 2017 | TIME | Possible and Certain Answers for Queries over Order-Incomplete Data. | Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart |
| 2016 | IJCAI | Query Answering with Transitive and Linear-Ordered Data. | Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2016 | PODS | Tractable Lineages on Treelike Instances: Limits and Extensions. | Antoine Amarilli, Pierre Bourhis, Pierre Senellart |
| 2015 | ICALP | Provenance Circuits for Trees and Treelike Instances. | Antoine Amarilli, Pierre Bourhis, Pierre Senellart |
| 2015 | IJCAI | Combining Existential Rules and Description Logics. | Antoine Amarilli, Michael Benedikt |
| 2015 | LICS | Finite Open-World Query Answering with Number Restrictions. | Antoine Amarilli, Michael Benedikt |
| 2015 | SIGMOD | Structurally Tractable Uncertain Data. | Antoine Amarilli |
| 2014 | APWEB | Recent Topics of Research around the YAGO Knowledge Base. | Antoine Amarilli, Luis Galrraga, Nicoleta Preda, Fabian M. Suchanek |
| 2014 | DASFAA | Uncertainty in Crowd Data Sourcing Under Structural Constraints. | Antoine Amarilli, Yael Amsterdamer, Tova Milo |
| 2014 | DEXA | Get a Sample for a Discount - Sampling-Based XML Data Pricing. | Ruiming Tang, Antoine Amarilli, Pierre Senellart, Stphane Bressan |
| 2014 | ICDT | On the Complexity of Mining Itemsets from the Crowd Using Taxonomies. | Antoine Amarilli, Yael Amsterdamer, Tova Milo |
| 2011 | WISTP | Can Code Polymorphism Limit Information Leakage? | Antoine Amarilli, Sascha Mller, David Naccache, Dan Page, Pablo Rauzy, Michael Tunstall |