HTML Export for ICDT 2021

Copy to Clipboard Download

<h2>LIPIcs, Volume 186, ICDT 2021</h2>
<ul>
<li>
    <span class="authors">Ke Yi and Zhewei Wei</span>
    <span class="title">LIPIcs, Volume 186, ICDT 2021, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021">10.4230/LIPIcs.ICDT.2021</a>
</li>
<li>
    <span class="authors">Ke Yi and Zhewei Wei</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.0">10.4230/LIPIcs.ICDT.2021.0</a>
</li>
<li>
    <span class="authors">Pablo Barceló</span>
    <span class="title">Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.1">10.4230/LIPIcs.ICDT.2021.1</a>
</li>
<li>
    <span class="authors">Julia Stoyanovich</span>
    <span class="title">Comparing Apples and Oranges: Fairness and Diversity in Ranking (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.2">10.4230/LIPIcs.ICDT.2021.2</a>
</li>
<li>
    <span class="authors">Kaleb Alway, Eric Blais, and Semih Salihoglu</span>
    <span class="title">Box Covers and Domain Orderings for Beyond Worst-Case Join Processing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.3">10.4230/LIPIcs.ICDT.2021.3</a>
</li>
<li>
    <span class="authors">Markus L. Schmid and Nicole Schweikardt</span>
    <span class="title">A Purely Regular Approach to Non-Regular Core Spanners</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.4">10.4230/LIPIcs.ICDT.2021.4</a>
</li>
<li>
    <span class="authors">Shaleen Deep and Paraschos Koutris</span>
    <span class="title">Ranked Enumeration of Conjunctive Query Results</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.5">10.4230/LIPIcs.ICDT.2021.5</a>
</li>
<li>
    <span class="authors">Shangqi Lu and Yufei Tao</span>
    <span class="title">Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.6">10.4230/LIPIcs.ICDT.2021.6</a>
</li>
<li>
    <span class="authors">Liat Peterfreund</span>
    <span class="title">Grammars for Document Spanners</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.7">10.4230/LIPIcs.ICDT.2021.7</a>
</li>
<li>
    <span class="authors">Heba Aamer and Jan Van den Bussche</span>
    <span class="title">Input-Output Disjointness for Forward Expressions in the Logic of Information Flows</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.8">10.4230/LIPIcs.ICDT.2021.8</a>
</li>
<li>
    <span class="authors">Balder ten Cate and Victor Dalmau</span>
    <span class="title">Conjunctive Queries: Unique Characterizations and Exact Learnability</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.9">10.4230/LIPIcs.ICDT.2021.9</a>
</li>
<li>
    <span class="authors">Johannes Doleschal, Noa Bratman, Benny Kimelfeld, and Wim Martens</span>
    <span class="title">The Complexity of Aggregates over Extractions by Regular Expressions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.10">10.4230/LIPIcs.ICDT.2021.10</a>
</li>
<li>
    <span class="authors">Cristina Feier, Carsten Lutz, and Marcin Przybyłko</span>
    <span class="title">Answer Counting Under Guarded TGDs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.11">10.4230/LIPIcs.ICDT.2021.11</a>
</li>
<li>
    <span class="authors">Andrew McGregor, David Tench, and Hoa T. Vu</span>
    <span class="title">Maximum Coverage in the Data Stream Model: Parameterized and Generalized</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.12">10.4230/LIPIcs.ICDT.2021.12</a>
</li>
<li>
    <span class="authors">Zafeiria Moumoulidou, Andrew McGregor, and Alexandra Meliou</span>
    <span class="title">Diverse Data Selection under Fairness Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.13">10.4230/LIPIcs.ICDT.2021.13</a>
</li>
<li>
    <span class="authors">Shaleen Deep, Xiao Hu, and Paraschos Koutris</span>
    <span class="title">Enumeration Algorithms for Conjunctive Queries with Projection</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.14">10.4230/LIPIcs.ICDT.2021.14</a>
</li>
<li>
    <span class="authors">Ester Livshits and Benny Kimelfeld</span>
    <span class="title">The Shapley Value of Inconsistency Measures for Functional Dependencies</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.15">10.4230/LIPIcs.ICDT.2021.15</a>
</li>
<li>
    <span class="authors">Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, and Muhammad Tibi</span>
    <span class="title">Database Repairing with Soft Functional Dependencies</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.16">10.4230/LIPIcs.ICDT.2021.16</a>
</li>
<li>
    <span class="authors">Antoine Amarilli and Benny Kimelfeld</span>
    <span class="title">Uniform Reliability of Self-Join-Free Conjunctive Queries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.17">10.4230/LIPIcs.ICDT.2021.17</a>
</li>
<li>
    <span class="authors">Rasmus Pagh and Nina Mesing Stausholm</span>
    <span class="title">Efficient Differentially Private F₀ Linear Sketching</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.18">10.4230/LIPIcs.ICDT.2021.18</a>
</li>
<li>
    <span class="authors">Katrin Casel and Markus L. Schmid</span>
    <span class="title">Fine-Grained Complexity of Regular Path Queries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.19">10.4230/LIPIcs.ICDT.2021.19</a>
</li>
<li>
    <span class="authors">Pierre Bourhis, Alejandro Grez, Louis Jachiet, and Cristian Riveros</span>
    <span class="title">Ranked Enumeration of MSO Logic on Words</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.20">10.4230/LIPIcs.ICDT.2021.20</a>
</li>
<li>
    <span class="authors">Samuel McCauley</span>
    <span class="title">Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.21">10.4230/LIPIcs.ICDT.2021.21</a>
</li>
<li>
    <span class="authors">Bruhathi Sundarmurthy, Paraschos Koutris, and Jeffrey Naughton</span>
    <span class="title">Locality-Aware Distribution Schemes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2021.22">10.4230/LIPIcs.ICDT.2021.22</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode