Antoine Amarilli
79
Documents
Affiliations actuelles
- Centre Inria de l'Université de Lille
- Données : algorithmiques et logiques dynamiques (D-DAL)
Identifiants chercheurs
Publications
Publications
|
|
Linear Time Subsequence and Supersequence Regex MatchingMFCS, Aug 2025, Warsaw, Poland. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, ⟨10.4230/LIPIcs.MFCS.2025.9⟩
Proceedings/Recueil des communications
hal-05407156
v1
|
|
|
Resilience for Regular Path Queries: Towards a Complexity ClassificationPODS, Jun 2025, Berlin, Germany. Proceedings of the ACM on Management of Data, 3 (2), pp.1-18, 2025, ⟨10.1145/3725245⟩
Proceedings/Recueil des communications
hal-04871464
v1
|
|
|
Dynamic Membership for Regular Tree LanguagesMFCS, Aug 2025, Warsaw, Poland. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, ⟨10.4230/LIPIcs.MFCS.2025.8⟩
Proceedings/Recueil des communications
hal-05407144
v1
|
|
|
Skyline Operators for Document Spanners27th International Conference on Database Theory (ICDT 2024), Mar 2024, Paestum, Italy. pp.7:1-7:18, ⟨10.4230/LIPICS.ICDT.2024.7⟩
Communication dans un congrès
hal-04778343
v1
|
Conjunctive Queries on Probabilistic Graphs: The Limits of ApproximabilityICDT 2024 27th International Conference on Database Theory, Mar 2024, Paestum, Italy. ⟨10.4230/LIPIcs.ICDT.2024.15⟩
Communication dans un congrès
hal-04871556
v1
|
|
|
|
Edge-Minimum Walk of Modular Length in Polynomial Time16th Innovations in Theoretical Computer Science - ITCS 2025, Jan 2025, New York City, United States. pp.5:1-5:23, ⟨10.4230/LIPIcs.ITCS.2025.5⟩
Communication dans un congrès
hal-04871489
v1
|
|
|
Ranked Enumeration for MSO on Trees via Knowledge CompilationInternational Conference on Database Theory (ICDT 2024), Mar 2024, Paestum, Italy. pp.5:1-25:18, ⟨10.4230/LIPIcs.ICDT.2024.25⟩
Communication dans un congrès
hal-04377344
v2
|
|
|
Enumerating Regular Languages with Bounded DelaySTACS, Mar 2023, Hamburg, Germany. ⟨10.4230/LIPIcs.STACS.2023.8⟩
Communication dans un congrès
hal-03940590
v1
|
Uniform Reliability for Unbounded Homomorphism-Closed Graph QueriesICDT 2023 : 26th International Conference on Database Theory, Mar 2023, Ioannina, Greece. ⟨10.4230/LIPIcs.ICDT.2023.14⟩
Communication dans un congrès
hal-04871580
v1
|
|
Query-Guided Resolution in Uncertain DatabasesSIGMOD, Jun 2024, Washington, United States. pp.Article No.: 180, Pages 1 - 27, ⟨10.1145/3589325⟩
Communication dans un congrès
hal-04871570
v1
|
|
|
|
Weighted Counting of Matchings in Unbounded-Treewidth Graph FamiliesMFCS, Aug 2022, Vienna, Austria. ⟨10.4230/LIPIcs.MFCS.2022.9⟩
Communication dans un congrès
hal-03712197
v1
|
|
|
Worst-case Analysis for Interactive Evaluation of Boolean ProvenanceTaPP workshop, Jun 2022, Philadelphia, United States
Communication dans un congrès
hal-03712198
v1
|
|
|
Efficient enumeration algorithms for annotated grammarsPODS 2022, Jun 2022, Philadelphie, United States. ⟨10.1145/3517804.3526232⟩
Communication dans un congrès
hal-03654592
v1
|
Managing Consent for Data Access in Shared Databases2021 IEEE 37th International Conference on Data Engineering (ICDE), Apr 2021, Chania, Greece. pp.1949-1954, ⟨10.1109/ICDE51399.2021.00182⟩
Communication dans un congrès
hal-03712201
v1
|
|
|
|
Uniform Reliability of Self-Join-Free Conjunctive Queries24th International Conference on Database Theory (ICDT 2021), Mar 2021, Nicosia, Cyprus. ⟨10.4230/LIPIcs.ICDT.2021.17⟩
Communication dans un congrès
hal-03712202
v1
|
|
|
Dynamic Membership for Regular LanguagesICALP 2021 - 48th International Colloquium on Automata, Languages, and Programming, Jul 2021, Glasgow, United Kingdom. pp.116:1--116:17, ⟨10.4230/LIPIcs.ICALP.2021.116⟩
Communication dans un congrès
hal-03466453
v1
|
|
|
Computing and Illustrating Query Rewritings on Path Views with Binding PatternsInternational conference on information and knowledge management (CIKM), 2020, virtual, France. ⟨10.1145/3340531.3417431⟩
Communication dans un congrès
hal-03108517
v1
|
|
|
A Dichotomy for Homomorphism-Closed Queries on Probabilistic GraphsICDT, Mar 2020, Copenhagen, Denmark. ⟨10.4230/LIPIcs.ICDT.2020.5⟩
Communication dans un congrès
hal-02941907
v1
|
|
|
Equivalent Rewritings on Path Views with Binding Patterns17th Extended Semantic Web Conference, ESWC 2020, Mar 2020, Online, France. pp.446-462, ⟨10.1007/978-3-030-49461-2_26⟩
Communication dans un congrès
hal-02876611
v1
|
|
|
Smoothing Structured Decomposable CircuitsNeurIPS 2019, Dec 2019, Vancouver, Canada
Communication dans un congrès
hal-02338336
v1
|
|
|
Enumeration on Trees with Tractable Combined Complexity and Efficient UpdatesPODS, Jun 2019, Amsterdam, France. pp.89-103, ⟨10.1145/3294052.3319702⟩
Communication dans un congrès
hal-02326243
v1
|
|
|
Constant-Delay Enumeration for Nondeterministic Document SpannersICDT, Mar 2019, Lisbon, Portugal. ⟨10.4230/LIPIcs.ICDT.2019.22⟩
Communication dans un congrès
hal-02338344
v1
|
|
|
Topological Sorting with Regular ConstraintsICALP 2018 - 45th International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic. pp.115:1--115:14
Communication dans un congrès
hal-01950909
v1
|
|
|
When Can We Answer Queries Using Result-Bounded Data Interfaces?PODS 2018, Jun 2018, Houston, United States
Communication dans un congrès
hal-02079064
v1
|
|
|
Connecting Width and Structure in Knowledge CompilationICDT 2018 - 21st International Conference on Database Theory, Mar 2018, Vienna, Austria. pp.1-17, ⟨10.4230/LIPIcs.ICDT.2018.6⟩
Communication dans un congrès
hal-01851564
v1
|
|
|
Enumeration on Trees under Relabelings21st International Conference on Database Theory,ICDT 2018, Mar 2018, Vienna, Austria. ⟨10.4230/LIPIcs.ICDT.2018.5⟩
Communication dans un congrès
hal-02412744
v1
|
|
|
Combined Tractability of Query Evaluation via Tree Automata and CycluitsICDT 2017 - International Conference on Database Theory, Mar 2017, Venice, Italy. ⟨10.4230/LIPIcs.ICDT.2017.6⟩
Communication dans un congrès
hal-01439294
v1
|
Top-k Queries on Unknown Values under Order ConstraintsICDT 2017, Mar 2017, Venice, Italy
Communication dans un congrès
hal-02287482
v1
|
|
|
|
Conjunctive Queries on Probabilistic Graphs: Combined ComplexityPrinciples of Database Systems (PODS), May 2017, Chicago, United States. ⟨10.1145/3034786.3056121⟩
Communication dans un congrès
hal-01486634
v1
|
Predicting Completeness in Knowledge BasesWSDM, 2017, Unknown, Unknown Region
Communication dans un congrès
hal-01472488
v1
|
|
|
|
Possible and Certain Answers for Queries over Order-Incomplete Data24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, Belgium. pp.4:1-4:19, ⟨10.4230/LIPIcs.TIME.2017.4⟩
Communication dans un congrès
hal-01614571
v2
|
|
|
Top-k Querying of Unknown Values under Order ConstraintsICDT 2017 - International Conference on Database Theory, Mar 2017, Venice, Italy. ⟨10.4230/LIPIcs.ICDT.2017.5⟩
Communication dans un congrès
hal-01439295
v1
|
|
|
A Circuit-Based Approach to Efficient EnumerationICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.111⟩
Communication dans un congrès
hal-01639179
v1
|
Tractable Lineages on Treelike Instances: Limits and ExtensionsPODS (Principles of Database Systems), Jun 2016, San Francisco, United States. pp.355-370
Communication dans un congrès
hal-01336514
v1
|
|
|
|
Query Answering with Transitive and Linear-Ordered DataTwenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, Jul 2016, New York, United States
Communication dans un congrès
hal-01413881
v1
|
|
|
Challenges for Efficient Query Evaluation on Structured Probabilistic DataSUM 2016 - 10th International Conference Scalable Uncertainty Management, Sep 2016, Nice, France. pp.323-330, ⟨10.1007/978-3-319-45856-4_22⟩
Communication dans un congrès
hal-01360167
v1
|
Combining Existential Rules and Description LogicsIJCAI 2015, Jul 2015, Buenos Aires, Argentina. pp.2691-2697
Communication dans un congrès
hal-01190601
v1
|
|
Finite Open-World Query Answering with Number RestrictionsLICS 2015, Jul 2015, Kyoto, Japan. pp.305-316
Communication dans un congrès
hal-01190580
v1
|
|
Circuits de provenance pour les arbres et les instances quasi-arborescentesBDA, Sep 2015, Porquerolles, France
Communication dans un congrès
hal-02287157
v1
|
|
Requêtes sur des données à ordre incompletBDA, Sep 2015, Porquerolles, France
Communication dans un congrès
hal-02288441
v1
|
|
Structurally Tractable Uncertain DataSIGMOD/PODS Ph.D. Symposium, Jun 2015, Melbourne, Australia. pp.39-44
Communication dans un congrès
hal-01190610
v1
|
|
Provenance Circuits for Trees and Treelike InstancesICALP 2015, Jun 2015, Kyoto, Japan. pp.56-68
Communication dans un congrès
hal-01178399
v1
|
|
IBEX: Harvesting Entities from the Web Using Unique IdentifiersWebDB, May 2015, Melbourne, Australia
Communication dans un congrès
hal-01190629
v1
|
|
Uncertainty in Crowd Data Sourcing under Structural ConstraintsUnCrowd, Apr 2014, Bali, Indonesia. pp.351-359
Communication dans un congrès
hal-01190716
v1
|
|
The Possibility Problem for Probabilistic XMLAlberto Mendelzon International Workshop on Foundations of Data Management, Jun 2014, Carthagène des Indes, Colombia
Communication dans un congrès
hal-01190712
v1
|
|
Get a Sample for a Discount: Sampling-Based XML Data PricingDEXA (Database and Expert Systems Applications), Sep 2014, Munich, Germany. pp.20-34
Communication dans un congrès
hal-01069820
v1
|
|
On the Complexity of Mining Itemsets from the Crowd Using TaxonomiesICDT (International Conference on Database Theory), Mar 2014, Athens, Greece. pp.15-25
Communication dans un congrès
hal-00986184
v1
|
|
Recent Topics of Research around the YAGO Knowledge BaseAsia-Pacific Web Conference (APWEB), Sep 2014, Changsha, China. pp.1-12
Communication dans un congrès
hal-01190642
v1
|
|
|
|
On the Connections between Relational and XML Probabilistic Data ModelsBNCOD (British National Conference on Databases), Jul 2013, Oxford, United Kingdom. pp.121-134
Communication dans un congrès
hal-00874445
v1
|
Cross-Fertilizing Deep Web Analysis and Ontology EnrichmentVLDS (Very Large Data Search), Aug 2012, Istanbul, Turkey. pp.21-24
Communication dans un congrès
hal-00737941
v1
|
|
|
|
Can code polymorphism limit information leakage?5th Workshop on Information Security Theory and Practices (WISTP), Jun 2011, Heraklion, Crete, Greece. pp.1-21, ⟨10.1007/978-3-642-21040-2_1⟩
Communication dans un congrès
hal-01110259
v1
|
|
|
Query Evaluation: Enumeration, Maintenance, ReliabilityComputer Science [cs]. Institut polytechnique de Paris, 2023
HDR
tel-04065298
v1
|
|
|
Leveraging the structure of uncertain dataDatabases [cs.DB]. Télécom ParisTech, 2016. English. ⟨NNT : 2016ENST0021⟩
Thèse
tel-01345836
v2
|
Chargement...
Chargement...