Antoine Amarilli

Florent Capelli

SIGMOD Rec., June, 2024

Survey of Results on the ModPath and ModCycle Problems.

[BibT_eX]

[DOI]

CoRR, 2024

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata.

[BibT_eX]

[DOI]

CoRR, 2024

The Non-Cancelling Intersections Conjecture.

[BibT_eX]

[DOI]

Dan Suciu

CoRR, 2024

Skyline Operators for Document Spanners.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Database Theory, 2024

Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability.

[BibT_eX]

[DOI]

Timothy van Bremen

Kuldeep S. Meel

Proceedings of the 27th International Conference on Database Theory, 2024

Ranked Enumeration for MSO on Trees via Knowledge Compilation.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Database Theory, 2024

2023

Query-Guided Resolution in Uncertain Databases.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Locality and Centrality: The Variety ZG.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

Should conferences still require mandatory attendance? A column by Theoretical Computer Scientists for Future (TCS4F).

[BibT_eX]

[DOI]

Bull. EATCS, 2023

Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2023

Enumerating Regular Languages with Bounded Delay.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Database Theory, 2023

Query Evaluation: Enumeration, Maintenance, Reliability.

[BibT_eX]

[DOI]

, 2023

2022

Uniform Reliability of Self-Join-Free Conjunctive Queries.

[BibT_eX]

[DOI]

Benny Kimelfeld

Log. Methods Comput. Sci., 2022

The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs.

[BibT_eX]

[DOI]

Ismail Ilkan Ceylan

Log. Methods Comput. Sci., 2022

When Can We Answer Queries Using Result-Bounded Data Interfaces?

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Tighter bounds for query answering with Guarded TGDs.

[BibT_eX]

[DOI]

CoRR, 2022

Enumerating Regular Languages in Constant Delay.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient enumeration algorithms for annotated grammars.

[BibT_eX]

[DOI]

CoRR, 2022

Worst-case analysis for interactive evaluation of Boolean provenance.

[BibT_eX]

[DOI]

Proceedings of the 14th International Workshop on the Theory and Practice of Provenance, 2022

Efficient Enumeration for Annotated Grammars.

[BibT_eX]

[DOI]

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Climate change and computing: facts, perspectives and an open discussion.

[BibT_eX]

[DOI]

Demetrios Zeinalipour-Yazti

Christophe Claramunt

Proceedings of the 16th ACM International Conference on Distributed and Event-based Systems, 2022

2021

Managing Consent for Data Access in Shared Databases.

[BibT_eX]

[DOI]

Osnat Drien

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Dynamic Membership for Regular Languages.

[BibT_eX]

[DOI]

Louis Jachiet

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Finite Open-world Query Answering with Number Restrictions.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Constant-Delay Enumeration for Nondeterministic Document Spanners.

[BibT_eX]

[DOI]

SIGMOD Rec., 2020

Correction to: Connecting Knowledge Compilation Classes and Width Parameters.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Connecting Knowledge Compilation Classes and Width Parameters.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.

[BibT_eX]

[DOI]

Ismail Ilkan Ceylan

Proceedings of the 23rd International Conference on Database Theory, 2020

Equivalent Rewritings on Path Views with Binding Patterns.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web - 17th International Conference, 2020

Computing and Illustrating Query Rewritings on Path Views with Binding Patterns.

[BibT_eX]

[DOI]

Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019

Computing possible and certain answers over order-incomplete data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Evaluating Datalog via Tree Automata and Cycluits.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Model Counting for Conjunctive Queries Without Self-Joins.

[BibT_eX]

[DOI]

Benny Kimelfeld

CoRR, 2019

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Smoothing Structured Decomposable Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Query Answering with Transitive and Linear-Ordered Data.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Connecting Width and Structure in Knowledge Compilation.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Database Theory, 2018

Enumeration on Trees under Relabelings.

[BibT_eX]

[DOI]

Stefan Mengel

Proceedings of the 21st International Conference on Database Theory, 2018

Topological Sorting with Regular Constraints.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

A Dichotomy on Constrained Topological Sorting.

[BibT_eX]

[DOI]

CoRR, 2017

Top-k Querying of Unknown Values under Order Constraints (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2017

Predicting Completeness in Knowledge Bases.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

Possible and Certain Answers for Queries over Order-Incomplete Data.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Conjunctive Queries on Probabilistic Graphs: Combined Complexity.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Combined Tractability of Query Evaluation via Tree Automata and Cycluits.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Database Theory, 2017

Top-k Querying of Unknown Values under Order Constraints.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Database Theory, 2017

A Circuit-Based Approach to Efficient Enumeration.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

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

[BibT_eX]

[DOI]

PhD thesis, 2016

A Framework for Sampling-Based XML Data Pricing.

[BibT_eX]

[DOI]

Trans. Large Scale Data Knowl. Centered Syst., 2016

Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2016

Challenges for Efficient Query Evaluation on Structured Probabilistic Data.

[BibT_eX]

[DOI]

Silviu Maniu

Proceedings of the Scalable Uncertainty Management - 10th International Conference, 2016

Tractable Lineages on Treelike Instances: Limits and Extensions.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Failure is Also an Option.

[BibT_eX]

[DOI]

Proceedings of the New Codebreakers, 2016

2015

Intensional data on the web.

[BibT_eX]

[DOI]

Silviu Maniu

SIGWEB Newsl., 2015

Possibility in probabilistic XML.

[BibT_eX]

[DOI]

Ingénierie des Systèmes d Inf., 2015

Harvesting Entities from the Web Using Unique Identifiers - IBEX.

[BibT_eX]

[DOI]

CoRR, 2015

Provenance Circuits for Trees and Treelike Instances (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

Finite Open-World Query Answering with Number Restrictions (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

Combining Existential Rules and Description Logics (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

IBEX: Harvesting Entities from the Web Using Unique Identifiers.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Web and Databases, 2015

Structurally Tractable Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD PhD Symposium, Melbourne, VIC, Australia, May 31, 2015

Combining Existential Rules and Description Logics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Provenance Circuits for Trees and Treelike Instances.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

The Possibility Problem for Probabilistic XML (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2014

On the Complexity of Mining Itemsets from the Crowd Using Taxonomies.

[BibT_eX]

[DOI]

Tova Milo

Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Get a Sample for a Discount - Sampling-Based XML Data Pricing.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2014

Uncertainty in Crowd Data Sourcing Under Structural Constraints.

[BibT_eX]

[DOI]

Tova Milo

Proceedings of the Database Systems for Advanced Applications, 2014

Recent Topics of Research around the YAGO Knowledge Base.

[BibT_eX]

[DOI]

Proceedings of the Web Technologies and Applications - 16th Asia-Pacific Web Conference, 2014

The Possibility Problem for Probabilistic XML.

[BibT_eX]

[DOI]

Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

2013

On the Connections between Relational and XML Probabilistic Data Models.

[BibT_eX]

[DOI]

Proceedings of the Big Data - 29th British National Conference on Databases, 2013

2012

A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata

[BibT_eX]

[DOI]

Marc Jeanmougin

CoRR, 2012

Cross-Fertilizing Deep Web Analysis and Ontology Enrichment.

[BibT_eX]

[DOI]

Marilena Oita