Can Code Polymorphism Limit Information Leakage? - Antoine Amarilli; Sascha Müller 003; David Naccache; Daniel Page; Pablo Rauzy; Michael Tunstall (IACR Cryptol. ePrint Arch., 2011)

Can a Program Reverse-Engineer Itself? - Antoine Amarilli; David Naccache; Pablo Rauzy; Emil Simion (IACR Cryptol. ePrint Arch., 2011)

From Rational Number Reconstruction to Set Reconciliation and File Synchronization. - Antoine Amarilli; Fabrice Ben Hamouda; Florian Bourse; Robin Morisset; David Naccache; Pablo Rauzy (TGC, 2012)

Cross-Fertilizing Deep Web Analysis and Ontology Enrichment. - Marilena Oita; Antoine Amarilli; Pierre Senellart (VLDS, 2012)

A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata - Antoine Amarilli; Marc Jeanmougin (CoRR, 2012)

On the Connections between Relational and XML Probabilistic Data Models. - Antoine Amarilli; Pierre Senellart (BNCOD, 2013)

The Possibility Problem for Probabilistic XML. - Antoine Amarilli (AMW, 2014)

Recent Topics of Research around the YAGO Knowledge Base. - Antoine Amarilli; Luis Galárraga; Nicoleta Preda; Fabian M. Suchanek (APWeb, 2014)

Uncertainty in Crowd Data Sourcing Under Structural Constraints. - Antoine Amarilli; Yael Amsterdamer; Tova Milo (DASFAA Workshops, 2014)

Get a Sample for a Discount - Sampling-Based XML Data Pricing. - Ruiming Tang; Antoine Amarilli; Pierre Senellart; Stéphane Bressan (DEXA (1), 2014)

On the Complexity of Mining Itemsets from the Crowd Using Taxonomies. - Antoine Amarilli; Yael Amsterdamer; Tova Milo (ICDT, 2014)

The Possibility Problem for Probabilistic XML (Extended Version). - Antoine Amarilli (CoRR, 2014)

Provenance Circuits for Trees and Treelike Instances. - Antoine Amarilli; Pierre Bourhis; Pierre Senellart (ICALP (2), 2015)

Combining Existential Rules and Description Logics. - Antoine Amarilli; Michael Benedikt (IJCAI, 2015)

Structurally Tractable Uncertain Data. - Antoine Amarilli (SIGMOD PhD Symposium, 2015)

IBEX: Harvesting Entities from the Web Using Unique Identifiers. - Aliaksandr Talaika; Joanna Biega; Antoine Amarilli; Fabian M. Suchanek (WebDB, 2015)

Combining Existential Rules and Description Logics (Extended Version). - Antoine Amarilli; Michael Benedikt (CoRR, 2015)

Finite Open-World Query Answering with Number Restrictions (Extended Version). - Antoine Amarilli; Michael Benedikt (CoRR, 2015)

Provenance Circuits for Trees and Treelike Instances (Extended Version). - Antoine Amarilli; Pierre Bourhis; Pierre Senellart (CoRR, 2015)

Harvesting Entities from the Web Using Unique Identifiers - IBEX. - Aliaksandr Talaika; Joanna Biega; Antoine Amarilli; Fabian M. Suchanek (CoRR, 2015)

Possibility in probabilistic XML. - Antoine Amarilli (Ingénierie des Systèmes d Inf., 2015)

Intensional data on the web. - Antoine Amarilli; Silviu Maniu; Pierre Senellart (SIGWEB Newsl., 2015)

Failure is Also an Option. - Antoine Amarilli; Marc Beunardeau; Rémi Géraud; David Naccache (The New Codebreakers, 2016)

Tractable Lineages on Treelike Instances: Limits and Extensions. - Antoine Amarilli; Pierre Bourhis; Pierre Senellart (PODS, 2016)

Challenges for Efficient Query Evaluation on Structured Probabilistic Data. - Antoine Amarilli; Silviu Maniu; Mikaël Monet (SUM, 2016)

Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (CoRR, 2016)

A Framework for Sampling-Based XML Data Pricing. - Ruiming Tang; Antoine Amarilli; Pierre Senellart; Stéphane Bressan (Trans. Large Scale Data Knowl. Centered Syst., 2016)

Leveraging the Structure of Uncertain Data. (Tirer parti de la structure des données incertaines). - Antoine Amarilli (2016)

A Circuit-Based Approach to Efficient Enumeration. - Antoine Amarilli; Pierre Bourhis; Louis Jachiet; Stefan Mengel (ICALP, 2017)

Top-k Querying of Unknown Values under Order Constraints. - Antoine Amarilli; Yael Amsterdamer; Tova Milo; Pierre Senellart (ICDT, 2017)

Combined Tractability of Query Evaluation via Tree Automata and Cycluits. - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (ICDT, 2017)

Conjunctive Queries on Probabilistic Graphs: Combined Complexity. - Antoine Amarilli; Mikaël Monet; Pierre Senellart (PODS, 2017)

Possible and Certain Answers for Queries over Order-Incomplete Data. - Antoine Amarilli; Mouhamadou Lamine Ba; Daniel Deutch; Pierre Senellart (TIME, 2017)

Predicting Completeness in Knowledge Bases. - Luis Galárraga; Simon Razniewski; Antoine Amarilli; Fabian M. Suchanek (WSDM, 2017)

Top-k Querying of Unknown Values under Order Constraints (Extended Version). - Antoine Amarilli; Yael Amsterdamer; Tova Milo; Pierre Senellart (CoRR, 2017)

A Dichotomy on Constrained Topological Sorting. - Antoine Amarilli; Charles Paperman (CoRR, 2017)

Topological Sorting with Regular Constraints. - Antoine Amarilli; Charles Paperman (ICALP, 2018)

Enumeration on Trees under Relabelings. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel (ICDT, 2018)

Connecting Width and Structure in Knowledge Compilation. - Antoine Amarilli; Mikaël Monet; Pierre Senellart (ICDT, 2018)

Query Answering with Transitive and Linear-Ordered Data. - Antoine Amarilli; Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (J. Artif. Intell. Res., 2018)

Smoothing Structured Decomposable Circuits. - Andy Shih; Guy Van den Broeck; Paul Beame; Antoine Amarilli (NeurIPS, 2019)

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (PODS, 2019)

Model Counting for Conjunctive Queries Without Self-Joins. - Antoine Amarilli; Benny Kimelfeld (CoRR, 2019)

Evaluating Datalog via Tree Automata and Cycluits. - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2019)

Computing possible and certain answers over order-incomplete data. - Antoine Amarilli; Mouhamadou Lamine Ba; Daniel Deutch; Pierre Senellart (Theor. Comput. Sci., 2019)

Computing and Illustrating Query Rewritings on Path Views with Binding Patterns. - Julien Romero; Nicoleta Preda; Antoine Amarilli; Fabian M. Suchanek (CIKM, 2020)

Equivalent Rewritings on Path Views with Binding Patterns. - Julien Romero; Nicoleta Preda; Antoine Amarilli; Fabian M. Suchanek (ESWC, 2020)

A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. - Antoine Amarilli; Ismail Ilkan Ceylan (ICDT, 2020)

Connecting Knowledge Compilation Classes and Width Parameters. - Antoine Amarilli; Florent Capelli; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2020)

Correction to: Connecting Knowledge Compilation Classes and Width Parameters. - Antoine Amarilli; Florent Capelli; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2020)

Constant-Delay Enumeration for Nondeterministic Document Spanners. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (SIGMOD Rec., 2020)

Finite Open-world Query Answering with Number Restrictions. - Antoine Amarilli; Michael Benedikt (ACM Trans. Comput. Log., 2020)

Dynamic Membership for Regular Languages. - Antoine Amarilli; Louis Jachiet; Charles Paperman (ICALP, 2021)

Managing Consent for Data Access in Shared Databases. - Osnat Drien; Antoine Amarilli; Yael Amsterdamer (ICDE, 2021)

Climate change and computing: facts, perspectives and an open discussion. - Antoine Amarilli; Christophe Claramunt; Demetrios Zeinalipour-Yazti (DEBS, 2022)

Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. - Antoine Amarilli; Mikaël Monet (MFCS, 2022)

Efficient Enumeration for Annotated Grammars. - Antoine Amarilli; Louis Jachiet; Martin Muñoz; Cristian Riveros (PODS, 2022)

Worst-case analysis for interactive evaluation of Boolean provenance. - Antoine Amarilli; Yael Amsterdamer (TaPP, 2022)

Efficient enumeration algorithms for annotated grammars. - Antoine Amarilli; Louis Jachiet; Martin Muñoz; Cristian Riveros (CoRR, 2022)

Enumerating Regular Languages in Constant Delay. - Antoine Amarilli; Mikaël Monet (CoRR, 2022)

Tighter bounds for query answering with Guarded TGDs. - Antoine Amarilli; Michael Benedikt (CoRR, 2022)

When Can We Answer Queries Using Result-Bounded Data Interfaces? - Antoine Amarilli; Michael Benedikt (Log. Methods Comput. Sci., 2022)

The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs. - Antoine Amarilli; Ismail Ilkan Ceylan (Log. Methods Comput. Sci., 2022)

Uniform Reliability of Self-Join-Free Conjunctive Queries. - Antoine Amarilli; Benny Kimelfeld (Log. Methods Comput. Sci., 2022)

Query Evaluation: Enumeration, Maintenance, Reliability. - Antoine Amarilli (2023)

Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. - Antoine Amarilli (ICDT, 2023)

Enumerating Regular Languages with Bounded Delay. - Antoine Amarilli; Mikaël Monet (STACS, 2023)

Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time. - Antoine Amarilli (CoRR, 2023)

Should conferences still require mandatory attendance? A column by Theoretical Computer Scientists for Future (TCS4F). - Antoine Amarilli (Bull. EATCS, 2023)

Locality and Centrality: The Variety ZG. - Antoine Amarilli; Charles Paperman (Log. Methods Comput. Sci., 2023)

Query-Guided Resolution in Uncertain Databases. - Osnat Drien; Matanya Freiman; Antoine Amarilli; Yael Amsterdamer (Proc. ACM Manag. Data, 2023)

Ranked Enumeration for MSO on Trees via Knowledge Compilation. - Antoine Amarilli; Pierre Bourhis; Florent Capelli; Mikaël Monet (ICDT, 2024)

Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. - Antoine Amarilli; Timothy van Bremen; Kuldeep S. Meel (ICDT, 2024)

Skyline Operators for Document Spanners. - Antoine Amarilli; Benny Kimelfeld; Sébastien Labbé 003; Stefan Mengel (ICDT, 2024)

The Non-Cancelling Intersections Conjecture. - Antoine Amarilli; Mikaël Monet; Dan Suciu (CoRR, 2024)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata. - Antoine Amarilli; Marcelo Arenas; YooJung Choi 001; Mikaël Monet; Guy Van den Broeck; Benjie Wang 001 (CoRR, 2024)

Survey of Results on the ModPath and ModCycle Problems. - Antoine Amarilli (CoRR, 2024)

Tractable Circuits in Database Theory. - Antoine Amarilli; Florent Capelli (SIGMOD Rec., 2024)

Edge-Minimum Walk of Modular Length in Polynomial Time. - Antoine Amarilli; Benoît Groz; Nicole Wein (ITCS, 2025)

Dynamic Membership for Regular Tree Languages. - Antoine Amarilli; Corentin Barloy; Louis Jachiet; Charles Paperman (MFCS, 2025)

Linear Time Subsequence and Supersequence Regex Matching. - Antoine Amarilli; Florin Manea; Tina Ringleb; Markus L. Schmid (MFCS, 2025)

Cutwidth Bounds via Vertex Partitions. - Antoine Amarilli; Benoît Groz (CoRR, 2025)

Resilience for Regular Path Queries: Towards a Complexity Classification. - Antoine Amarilli; Wolfgang Gatterbauer; Neha Makhija; Mikaël Monet (Proc. ACM Manag. Data, 2025)