default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th ICDT 2021: Nicosia, Cyprus
- Ke Yi
, Zhewei Wei:
24th International Conference on Database Theory, ICDT 2021, March 23-26, 2021, Nicosia, Cyprus. LIPIcs 186, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-179-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Pablo Barceló:
Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk). 1:1-1:1 - Julia Stoyanovich:
Comparing Apples and Oranges: Fairness and Diversity in Ranking (Invited Talk). 2:1-2:1 - Kaleb Alway, Eric Blais, Semih Salihoglu:
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing. 3:1-3:23 - Markus L. Schmid, Nicole Schweikardt:
A Purely Regular Approach to Non-Regular Core Spanners. 4:1-4:19 - Shaleen Deep, Paraschos Koutris:
Ranked Enumeration of Conjunctive Query Results. 5:1-5:19 - Shangqi Lu, Yufei Tao:
Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting. 6:1-6:23 - Liat Peterfreund:
Grammars for Document Spanners. 7:1-7:18 - Heba Aamer, Jan Van den Bussche:
Input-Output Disjointness for Forward Expressions in the Logic of Information Flows. 8:1-8:18 - Balder ten Cate, Victor Dalmau:
Conjunctive Queries: Unique Characterizations and Exact Learnability. 9:1-9:24 - Johannes Doleschal, Noa Bratman, Benny Kimelfeld, Wim Martens:
The Complexity of Aggregates over Extractions by Regular Expressions. 10:1-10:20 - Cristina Feier, Carsten Lutz, Marcin Przybylko:
Answer Counting Under Guarded TGDs. 11:1-11:22 - Andrew McGregor, David Tench, Hoa T. Vu:
Maximum Coverage in the Data Stream Model: Parameterized and Generalized. 12:1-12:20 - Zafeiria Moumoulidou, Andrew McGregor, Alexandra Meliou:
Diverse Data Selection under Fairness Constraints. 13:1-13:25 - Shaleen Deep, Xiao Hu, Paraschos Koutris:
Enumeration Algorithms for Conjunctive Queries with Projection. 14:1-14:17 - Ester Livshits, Benny Kimelfeld:
The Shapley Value of Inconsistency Measures for Functional Dependencies. 15:1-15:19 - Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi:
Database Repairing with Soft Functional Dependencies. 16:1-16:17 - Antoine Amarilli, Benny Kimelfeld:
Uniform Reliability of Self-Join-Free Conjunctive Queries. 17:1-17:17 - Rasmus Pagh, Nina Mesing Stausholm:
Efficient Differentially Private F₀ Linear Sketching. 18:1-18:19 - Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. 19:1-19:20 - Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros:
Ranked Enumeration of MSO Logic on Words. 20:1-20:19 - Samuel McCauley:
Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing. 21:1-21:22 - Bruhathi Sundarmurthy, Paraschos Koutris, Jeffrey F. Naughton:
Locality-Aware Distribution Schemes. 22:1-22:25
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
