Antoine Amarilli

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 89

Top Venues

CoRR

ICDT

PODS

Log. Methods Comput. Sci.

Télécom ParisTech, France (PHD)

Education History

Télécom ParisTech, France

PHD

Publications

Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. ICDT (2024)
Antoine Amarilli, Florent Capelli
Tractable Circuits in Database Theory. SIGMOD Rec. 53 (2) (2024)
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel
Skyline Operators for Document Spanners. ICDT (2024)
Antoine Amarilli, Florent Capelli
Tractable Circuits in Database Theory. CoRR (2024)
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 (2024)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT (2024)
Antoine Amarilli, Mikaël Monet, Dan Suciu
The Non-Cancelling Intersections Conjecture. CoRR (2024)
Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. CoRR (2023)
Antoine Amarilli, Charles Paperman
Locality and Centrality: The Variety ZG. Log. Methods Comput. Sci. 19 (4) (2023)
Antoine Amarilli
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. ICDT (2023)
Antoine Amarilli
Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time. CoRR (2023)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR (2023)
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel
Skyline Operators for Document Spanners. CoRR (2023)
Antoine Amarilli, Mikaël Monet
Enumerating Regular Languages with Bounded Delay. STACS (2023)
Osnat Drien, Matanya Freiman, Antoine Amarilli, Yael Amsterdamer
Query-Guided Resolution in Uncertain Databases. Proc. ACM Manag. Data 1 (2) (2023)
Antoine Amarilli
Should conferences still require mandatory attendance? A column by Theoretical Computer Scientists for Future (TCS4F). Bull. EATCS 139 (2023)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? Log. Methods Comput. Sci. 18 (2) (2022)
Antoine Amarilli, Mikaël Monet
Enumerating Regular Languages in Constant Delay. CoRR (2022)
Antoine Amarilli, Yael Amsterdamer
Worst-case Analysis for Interactive Evaluation of Boolean Provenance. CoRR (2022)
Antoine Amarilli, Yael Amsterdamer
Worst-case analysis for interactive evaluation of Boolean provenance. TaPP (2022)
Antoine Amarilli
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. CoRR (2022)
Antoine Amarilli, Christophe Claramunt, Demetrios Zeinalipour-Yazti
Climate change and computing: facts, perspectives and an open discussion. DEBS (2022)
Antoine Amarilli, Mikaël Monet
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. CoRR (2022)
Antoine Amarilli, Mikaël Monet
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. MFCS (2022)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2022)
Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros
Efficient enumeration algorithms for annotated grammars. CoRR (2022)
Antoine Amarilli, Michael Benedikt
Tighter bounds for query answering with Guarded TGDs. CoRR (2022)
Antoine Amarilli, Ismail Ilkan Ceylan
The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs. Log. Methods Comput. Sci. 18 (1) (2022)
Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros
Efficient Enumeration for Annotated Grammars. PODS (2022)
Antoine Amarilli, Benny Kimelfeld
Uniform Reliability of Self-Join-Free Conjunctive Queries. Log. Methods Comput. Sci. 18 (4) (2022)
Antoine Amarilli, Louis Jachiet, Charles Paperman
Dynamic Membership for Regular Languages. CoRR (2021)
Antoine Amarilli, Charles Paperman
Locality and Centrality: The Variety ZG. CoRR (2021)
Osnat Drien, Antoine Amarilli, Yael Amsterdamer
Managing Consent for Data Access in Shared Databases. ICDE (2021)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. ACM Trans. Database Syst. 46 (1) (2021)
Antoine Amarilli, Benny Kimelfeld
Uniform Reliability of Self-Join-Free Conjunctive Queries. ICDT (2021)
Antoine Amarilli, Louis Jachiet, Charles Paperman
Dynamic Membership for Regular Languages. ICALP (2021)
Antoine Amarilli, Ismail Ilkan Ceylan
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. ICDT (2020)
Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
Equivalent Rewritings on Path Views with Binding Patterns. ESWC (2020)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64 (5) (2020)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. SIGMOD Rec. 49 (1) (2020)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR (2020)
Antoine Amarilli, Michael Benedikt
Finite Open-world Query Answering with Number Restrictions. ACM Trans. Comput. Log. 21 (4) (2020)
Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
Equivalent Rewritings on Path Views with Binding Patterns. CoRR (2020)
Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
Computing and Illustrating Query Rewritings on Path Views with Binding Patterns. CIKM (2020)
Antoine Amarilli, Michael Benedikt
Finite Open-World Query Answering with Number Restrictions. CoRR (2020)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Correction to: Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64 (5) (2020)
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
Computing possible and certain answers over order-incomplete data. Theor. Comput. Sci. 797 (2019)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Evaluating Datalog via Tree Automata and Cycluits. Theory Comput. Syst. 63 (7) (2019)
Andy Shih, Guy Van den Broeck, Paul Beame, Antoine Amarilli
Smoothing Structured Decomposable Circuits. CoRR (2019)
Andy Shih, Guy Van den Broeck, Paul Beame, Antoine Amarilli
Smoothing Structured Decomposable Circuits. NeurIPS (2019)
Antoine Amarilli, Benny Kimelfeld
Model Counting for Conjunctive Queries Without Self-Joins. CoRR (2019)
Antoine Amarilli, Ismail Ilkan Ceylan
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. CoRR (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. CoRR (2018)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. J. Artif. Intell. Res. 63 (2018)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR (2018)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR (2018)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Connecting Width and Structure in Knowledge Compilation. ICDT (2018)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? PODS (2018)
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
Computing Possible and Certain Answers over Order-Incomplete Data. CoRR (2018)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
Enumeration on Trees under Relabelings. ICDT (2018)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Evaluating Datalog via Tree Automata and Cycluits. CoRR (2018)
Antoine Amarilli, Charles Paperman
Topological Sorting with Regular Constraints. ICALP (2018)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. CoRR (2018)
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
Possible and Certain Answers for Queries over Order-Incomplete Data. CoRR (2017)
Luis Galárraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek
Predicting Completeness in Knowledge Bases. WSDM (2017)
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
A Circuit-Based Approach to Efficient Enumeration. CoRR (2017)
Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart
Top-k Querying of Unknown Values under Order Constraints (Extended Version). CoRR (2017)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
Enumeration on Trees under Relabelings. CoRR (2017)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT (2017)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. PODS (2017)
Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart
Top-k Querying of Unknown Values under Order Constraints. ICDT (2017)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Connecting Width and Structure in Knowledge Compilation. CoRR (2017)
Antoine Amarilli, Charles Paperman
A Dichotomy on Constrained Topological Sorting. CoRR (2017)
Antoine Amarilli, Michael Benedikt
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR (2017)
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
Possible and Certain Answers for Queries over Order-Incomplete Data. TIME (2017)
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
A Circuit-Based Approach to Efficient Enumeration. ICALP (2017)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. CoRR (2017)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Tractable Lineages on Treelike Instances: Limits and Extensions. CoRR (2016)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). CoRR (2016)
Antoine Amarilli, Silviu Maniu, Mikaël Monet
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. SUM (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. IJCAI (2016)
Antoine Amarilli, Silviu Maniu, Mikaël Monet
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. CoRR (2016)
Ruiming Tang, Antoine Amarilli, Pierre Senellart, Stéphane Bressan
A Framework for Sampling-Based XML Data Pricing. Trans. Large Scale Data Knowl. Centered Syst. 24 (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2016)
Luis Galárraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek
Predicting Completeness in Knowledge Bases. CoRR (2016)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Tractable Lineages on Treelike Instances: Limits and Extensions. PODS (2016)
Antoine Amarilli, Marc Beunardeau, Rémi Géraud, David Naccache
Failure is Also an Option. The New Codebreakers (2016)
Antoine Amarilli, Michael Benedikt
Finite Open-World Query Answering with Number Restrictions. LICS (2015)
Antoine Amarilli
Possibility in probabilistic XML. Ingénierie des Systèmes d Inf. 20 (5) (2015)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Provenance Circuits for Trees and Treelike Instances (Extended Version). CoRR (2015)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Provenance Circuits for Trees and Treelike Instances. ICALP (2) (2015)
Antoine Amarilli
Structurally Tractable Uncertain Data. SIGMOD PhD Symposium (2015)
Antoine Amarilli, Michael Benedikt
Combining Existential Rules and Description Logics. IJCAI (2015)
Aliaksandr Talaika, Joanna Biega, Antoine Amarilli, Fabian M. Suchanek
Harvesting Entities from the Web Using Unique Identifiers - IBEX. CoRR (2015)
Aliaksandr Talaika, Joanna Biega, Antoine Amarilli, Fabian M. Suchanek
IBEX: Harvesting Entities from the Web Using Unique Identifiers. WebDB (2015)
Antoine Amarilli, Michael Benedikt
Finite Open-World Query Answering with Number Restrictions (Extended Version). CoRR (2015)
Antoine Amarilli, Michael Benedikt
Combining Existential Rules and Description Logics (Extended Version). CoRR (2015)
Antoine Amarilli, Silviu Maniu, Pierre Senellart
Intensional data on the web. SIGWEB Newsl. 2015 (Summer) (2015)

Antoine Amarilli.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Antoine Amarilli