Antoine Amarilli

140 papers A* 13A 17B 4C 4Journal 85Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language.
CoRR
Antoine Amarilli, Sven Dziadek, Luc Segoufin
2026 J jnl
Gray Codes With Constant Delay and Constant Auxiliary Space.
CoRR
Antoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikaël Monet, Yann Strozecki
2026 A conf
On the Complexity of Language Membership for Probabilistic Words.
STACS
Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati
2026 J jnl
Out-of-Order Membership to Regular Languages.
CoRR
Antoine Amarilli, Sébastien Labbé, Charles Paperman
2026 J jnl
The S-Hamiltonian Cycle Problem.
CoRR
Antoine Amarilli, Arthur Lombardo, Mikaël Monet
2025 J jnl
Approximating Queries on Probabilistic Graphs.
Log. Methods Comput. Sci.
Antoine Amarilli, Timothy van Bremen, Octave Gaspard, Kuldeep S. Meel
2025 — conf
Best of the Rest: Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability.
Provenance Week@SIGMOD
Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel
2025 J jnl
Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules.
CoRR
Antoine Amarilli, Mikaël Monet, Rémi De Pretto
2025 J jnl
Cutwidth Bounds via Vertex Partitions.
CoRR
Antoine Amarilli, Benoît Groz
2025 B conf
Dynamic Membership for Regular Tree Languages.
MFCS
Antoine Amarilli, Corentin Barloy, Louis Jachiet, Charles Paperman
2025 J jnl
Dynamic Membership for Regular Tree Languages.
CoRR
Antoine Amarilli, Corentin Barloy, Louis Jachiet, Charles Paperman
2025 A conf
Edge-Minimum Walk of Modular Length in Polynomial Time.
ITCS
Antoine Amarilli, Benoît Groz, Nicole Wein
2025 B conf
Linear Time Subsequence and Supersequence Regex Matching.
MFCS
Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid
2025 J jnl
Linear Time Subsequence and Supersequence Regex Matching.
CoRR
Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid
2025 J jnl
Locality Testing for NFAs is PSPACE-complete.
CoRR
Antoine Amarilli, Mikaël Monet, Rémi De Pretto
2025 J jnl
On the Complexity of Language Membership for Probabilistic Words.
CoRR
Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati
2025 J jnl
Resilience for Regular Path Queries: Towards a Complexity Classification.
Proc. ACM Manag. Data
Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija, Mikaël Monet
2024 J jnl
A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata.
CoRR
Antoine Amarilli, Marcelo Arenas, YooJung Choi, Mikaël Monet, Guy Van den Broeck, Benjie Wang
2024 A conf
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability.
ICDT
Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel
2024 J jnl
Edge-Minimum Walk of Modular Length in Polynomial Time.
CoRR
Antoine Amarilli, Benoît Groz, Nicole Wein
2024 A conf
Ranked Enumeration for MSO on Trees via Knowledge Compilation.
ICDT
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
2024 J jnl
Resilience for Regular Path Queries: Towards a Complexity Classification.
CoRR
Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija, Mikaël Monet
2024 A conf
Skyline Operators for Document Spanners.
ICDT
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel
2024 J jnl
Survey of Results on the ModPath and ModCycle Problems.
CoRR
Antoine Amarilli
2024 J jnl
The Non-Cancelling Intersections Conjecture.
CoRR
Antoine Amarilli, Mikaël Monet, Dan Suciu
2024 — ed.
The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen, Tannen's Festschrift, University of Pennsylvania, Philadelphia, PA, USA, May 24-25, 2024
Tannen's Festschrift
Antoine Amarilli, Alin Deutsch
2024 J jnl
Tractable Circuits in Database Theory.
CoRR
Antoine Amarilli, Florent Capelli
2024 J jnl
Tractable Circuits in Database Theory.
SIGMOD Rec.
Antoine Amarilli, Florent Capelli
2023 J jnl
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability.
CoRR
Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel
2023 J jnl
Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time.
CoRR
Antoine Amarilli
2023 A conf
Enumerating Regular Languages with Bounded Delay.
STACS
Antoine Amarilli, Mikaël Monet
2023 J jnl
Locality and Centrality: The Variety ZG.
Log. Methods Comput. Sci.
Antoine Amarilli, Charles Paperman
2023 — book
Query Evaluation: Enumeration, Maintenance, Reliability.
Antoine Amarilli
2023 J jnl
Query-Guided Resolution in Uncertain Databases.
Proc. ACM Manag. Data
Osnat Drien, Matanya Freiman, Antoine Amarilli, Yael Amsterdamer
2023 J jnl
Ranked Enumeration for MSO on Trees via Knowledge Compilation.
CoRR
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
2023 J jnl
Should conferences still require mandatory attendance? A column by Theoretical Computer Scientists for Future (TCS4F).
Bull. EATCS
Antoine Amarilli
2023 J jnl
Skyline Operators for Document Spanners.
CoRR
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel
2023 A conf
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries.
ICDT
Antoine Amarilli
2022 — conf
Climate change and computing: facts, perspectives and an open discussion.
DEBS
Antoine Amarilli, Christophe Claramunt, Demetrios Zeinalipour-Yazti
2022 A* conf
Efficient Enumeration for Annotated Grammars.
PODS
Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros
2022 J jnl
Efficient enumeration algorithms for annotated grammars.
CoRR
Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros
2022 J jnl
Enumerating Regular Languages in Constant Delay.
CoRR
Antoine Amarilli, Mikaël Monet
2022 J jnl
Query Answering with Transitive and Linear-Ordered Data.
CoRR
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2022 J jnl
The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs.
Log. Methods Comput. Sci.
Antoine Amarilli, Ismail Ilkan Ceylan
2022 J jnl
Tighter bounds for query answering with Guarded TGDs.
CoRR
Antoine Amarilli, Michael Benedikt
2022 J jnl
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries.
CoRR
Antoine Amarilli
2022 J jnl
Uniform Reliability of Self-Join-Free Conjunctive Queries.
Log. Methods Comput. Sci.
Antoine Amarilli, Benny Kimelfeld
2022 B conf
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.
MFCS
Antoine Amarilli, Mikaël Monet
2022 J jnl
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.
CoRR
Antoine Amarilli, Mikaël Monet
2022 J jnl
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Log. Methods Comput. Sci.
Antoine Amarilli, Michael Benedikt
2022 J jnl
Worst-case Analysis for Interactive Evaluation of Boolean Provenance.
CoRR
Antoine Amarilli, Yael Amsterdamer
2022 — conf
Worst-case analysis for interactive evaluation of Boolean provenance.
TaPP
Antoine Amarilli, Yael Amsterdamer
2021 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
ACM Trans. Database Syst.
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2021 A* conf
Dynamic Membership for Regular Languages.
ICALP
Antoine Amarilli, Louis Jachiet, Charles Paperman
2021 J jnl
Dynamic Membership for Regular Languages.
CoRR
Antoine Amarilli, Louis Jachiet, Charles Paperman
2021 J jnl
Locality and Centrality: The Variety ZG.
CoRR
Antoine Amarilli, Charles Paperman
2021 A* conf
Managing Consent for Data Access in Shared Databases.
ICDE
Osnat Drien, Antoine Amarilli, Yael Amsterdamer
2021 A conf
Uniform Reliability of Self-Join-Free Conjunctive Queries.
ICDT
Antoine Amarilli, Benny Kimelfeld
2020 A conf
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
ICDT
Antoine Amarilli, Ismail Ilkan Ceylan
2020 A conf
Computing and Illustrating Query Rewritings on Path Views with Binding Patterns.
CIKM
Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
2020 J jnl
Connecting Knowledge Compilation Classes and Width Parameters.
Theory Comput. Syst.
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2020 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
CoRR
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2020 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
SIGMOD Rec.
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2020 J jnl
Correction to: Connecting Knowledge Compilation Classes and Width Parameters.
Theory Comput. Syst.
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2020 B conf
Equivalent Rewritings on Path Views with Binding Patterns.
ESWC
Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
2020 J jnl
Equivalent Rewritings on Path Views with Binding Patterns.
CoRR
Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
2020 J jnl
Finite Open-World Query Answering with Number Restrictions.
CoRR
Antoine Amarilli, Michael Benedikt
2020 J jnl
Finite Open-world Query Answering with Number Restrictions.
ACM Trans. Comput. Log.
Antoine Amarilli, Michael Benedikt
2019 J jnl
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
CoRR
Antoine Amarilli, Ismail Ilkan Ceylan
2019 J jnl
Computing possible and certain answers over order-incomplete data.
Theor. Comput. Sci.
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
2019 A conf
Constant-Delay Enumeration for Nondeterministic Document Spanners.
ICDT
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2019 A* conf
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.
PODS
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2019 J jnl
Evaluating Datalog via Tree Automata and Cycluits.
Theory Comput. Syst.
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2019 J jnl
Model Counting for Conjunctive Queries Without Self-Joins.
CoRR
Antoine Amarilli, Benny Kimelfeld
2019 A* conf
Smoothing Structured Decomposable Circuits.
NeurIPS
Andy Shih, Guy Van den Broeck, Paul Beame, Antoine Amarilli
2019 J jnl
Smoothing Structured Decomposable Circuits.
CoRR
Andy Shih, Guy Van den Broeck, Paul Beame, Antoine Amarilli
2018 J jnl
Computing Possible and Certain Answers over Order-Incomplete Data.
CoRR
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
2018 J jnl
Connecting Knowledge Compilation Classes and Width Parameters.
CoRR
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2018 A conf
Connecting Width and Structure in Knowledge Compilation.
ICDT
Antoine Amarilli, Mikaël Monet, Pierre Senellart
2018 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
CoRR
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2018 A conf
Enumeration on Trees under Relabelings.
ICDT
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
2018 J jnl
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.
CoRR
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2018 J jnl
Evaluating Datalog via Tree Automata and Cycluits.
CoRR
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2018 J jnl
Query Answering with Transitive and Linear-Ordered Data.
J. Artif. Intell. Res.
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2018 A* conf
Topological Sorting with Regular Constraints.
ICALP
Antoine Amarilli, Charles Paperman
2018 A* conf
When Can We Answer Queries Using Result-Bounded Data Interfaces?
PODS
Antoine Amarilli, Michael Benedikt
2018 J jnl
When Can We Answer Queries Using Result-Bounded Data Interfaces?
CoRR
Antoine Amarilli, Michael Benedikt
2017 A* conf
A Circuit-Based Approach to Efficient Enumeration.
ICALP
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
2017 J jnl
A Circuit-Based Approach to Efficient Enumeration.
CoRR
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
2017 J jnl
A Dichotomy on Constrained Topological Sorting.
CoRR
Antoine Amarilli, Charles Paperman
2017 A conf
Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
ICDT
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2017 A* conf
Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
PODS
Antoine Amarilli, Mikaël Monet, Pierre Senellart
2017 J jnl
Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
CoRR
Antoine Amarilli, Mikaël Monet, Pierre Senellart
2017 J jnl
Connecting Width and Structure in Knowledge Compilation.
CoRR
Antoine Amarilli, Mikaël Monet, Pierre Senellart
2017 J jnl
Enumeration on Trees under Relabelings.
CoRR
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
2017 C conf
Possible and Certain Answers for Queries over Order-Incomplete Data.
TIME
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
2017 J jnl
Possible and Certain Answers for Queries over Order-Incomplete Data.
CoRR
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
2017 A conf
Predicting Completeness in Knowledge Bases.
WSDM
Luis Galárraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek
2017 J jnl
Top-k Querying of Unknown Values under Order Constraints (Extended Version).
CoRR
Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart
2017 A conf
Top-k Querying of Unknown Values under Order Constraints.
ICDT
Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart
2017 J jnl
When Can We Answer Queries Using Result-Bounded Data Interfaces?
CoRR
Antoine Amarilli, Michael Benedikt
2016 J jnl
A Framework for Sampling-Based XML Data Pricing.
Trans. Large Scale Data Knowl. Centered Syst.
Ruiming Tang, Antoine Amarilli, Pierre Senellart, Stéphane Bressan
2016 — conf
Challenges for Efficient Query Evaluation on Structured Probabilistic Data.
SUM
Antoine Amarilli, Silviu Maniu, Mikaël Monet
2016 J jnl
Challenges for Efficient Query Evaluation on Structured Probabilistic Data.
CoRR
Antoine Amarilli, Silviu Maniu, Mikaël Monet
2016 J jnl
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version).
CoRR
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
2016 — conf
Failure is Also an Option.
The New Codebreakers
Antoine Amarilli, Marc Beunardeau, Rémi Géraud, David Naccache
2016 — —
Leveraging the Structure of Uncertain Data. (Tirer parti de la structure des données incertaines).
Antoine Amarilli
2016 J jnl
Predicting Completeness in Knowledge Bases.
CoRR
Luis Galárraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek
2016 A* conf
Query Answering with Transitive and Linear-Ordered Data.
IJCAI
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 J jnl
Query Answering with Transitive and Linear-Ordered Data.
CoRR
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 A* conf
Tractable Lineages on Treelike Instances: Limits and Extensions.
PODS
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2016 J jnl
Tractable Lineages on Treelike Instances: Limits and Extensions.
CoRR
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2015 J jnl
Combining Existential Rules and Description Logics (Extended Version).
CoRR
Antoine Amarilli, Michael Benedikt
2015 A* conf
Combining Existential Rules and Description Logics.
IJCAI
Antoine Amarilli, Michael Benedikt
2015 J jnl
Finite Open-World Query Answering with Number Restrictions (Extended Version).
CoRR
Antoine Amarilli, Michael Benedikt
2015 A* conf
Finite Open-World Query Answering with Number Restrictions.
LICS
Antoine Amarilli, Michael Benedikt
2015 J jnl
Harvesting Entities from the Web Using Unique Identifiers - IBEX.
CoRR
Aliaksandr Talaika, Joanna Biega, Antoine Amarilli, Fabian M. Suchanek
2015 — conf
IBEX: Harvesting Entities from the Web Using Unique Identifiers.
WebDB
Aliaksandr Talaika, Joanna Biega, Antoine Amarilli, Fabian M. Suchanek
2015 J jnl
Intensional data on the web.
SIGWEB Newsl.
Antoine Amarilli, Silviu Maniu, Pierre Senellart
2015 J jnl
Possibility in probabilistic XML.
Ingénierie des Systèmes d Inf.
Antoine Amarilli
2015 J jnl
Provenance Circuits for Trees and Treelike Instances (Extended Version).
CoRR
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2015 — conf
Provenance Circuits for Trees and Treelike Instances.
ICALP (2)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2015 — conf
Structurally Tractable Uncertain Data.
SIGMOD PhD Symposium
Antoine Amarilli
2015 J jnl
Structurally Tractable Uncertain Data.
CoRR
Antoine Amarilli
2014 — conf
Get a Sample for a Discount - Sampling-Based XML Data Pricing.
DEXA (1)
Ruiming Tang, Antoine Amarilli, Pierre Senellart, Stéphane Bressan
2014 A conf
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies.
ICDT
Antoine Amarilli, Yael Amsterdamer, Tova Milo
2014 C conf
Recent Topics of Research around the YAGO Knowledge Base.
APWeb
Antoine Amarilli, Luis Galárraga, Nicoleta Preda, Fabian M. Suchanek
2014 J jnl
The Possibility Problem for Probabilistic XML (Extended Version).
CoRR
Antoine Amarilli
2014 — conf
The Possibility Problem for Probabilistic XML.
AMW
Antoine Amarilli
2014 — conf
Uncertainty in Crowd Data Sourcing Under Structural Constraints.
DASFAA Workshops
Antoine Amarilli, Yael Amsterdamer, Tova Milo
2014 J jnl
Uncertainty in Crowd Data Sourcing under Structural Constraints.
CoRR
Antoine Amarilli, Yael Amsterdamer, Tova Milo
2013 J jnl
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies.
CoRR
Antoine Amarilli, Yael Amsterdamer, Tova Milo
2013 — conf
On the Connections between Relational and XML Probabilistic Data Models.
BNCOD
Antoine Amarilli, Pierre Senellart
2012 J jnl
A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
CoRR
Antoine Amarilli, Marc Jeanmougin
2012 — conf
Cross-Fertilizing Deep Web Analysis and Ontology Enrichment.
VLDS
Marilena Oita, Antoine Amarilli, Pierre Senellart
2012 — conf
From Rational Number Reconstruction to Set Reconciliation and File Synchronization.
TGC
Antoine Amarilli, Fabrice Ben Hamouda, Florian Bourse, Robin Morisset, David Naccache, Pablo Rauzy
2011 C conf
Can Code Polymorphism Limit Information Leakage?
WISTP
Antoine Amarilli, Sascha Müller, David Naccache, Dan Page, Pablo Rauzy, Michael Tunstall
2011 J jnl
Can Code Polymorphism Limit Information Leakage?
IACR Cryptol. ePrint Arch.
Antoine Amarilli, Sascha Müller, David Naccache, Daniel Page, Pablo Rauzy, Michael Tunstall
2011 C conf
Can a Program Reverse-Engineer Itself?
IMACC
Antoine Amarilli, David Naccache, Pablo Rauzy, Emil Simion
2011 J jnl
Can a Program Reverse-Engineer Itself?
IACR Cryptol. ePrint Arch.
Antoine Amarilli, David Naccache, Pablo Rauzy, Emil Simion