HTML Export for ICDT 2017

Copy to Clipboard Download

<h2>LIPIcs, Volume 68, ICDT 2017</h2>
<ul>
<li>
    <span class="authors">Michael Benedikt and Giorgio Orsi</span>
    <span class="title">LIPIcs, Volume 68, ICDT&#039;17, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017">10.4230/LIPIcs.ICDT.2017</a>
</li>
<li>
    <span class="authors">Michael Benedikt and Giorgio Orsi</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization, List of Authors</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.0">10.4230/LIPIcs.ICDT.2017.0</a>
</li>
<li>
    <span class="authors">Cristina Feier, Antti Kuusisto, and Carsten Lutz</span>
    <span class="title">Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.1">10.4230/LIPIcs.ICDT.2017.1</a>
</li>
<li>
    <span class="authors">Dániel Marx</span>
    <span class="title">Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.2">10.4230/LIPIcs.ICDT.2017.2</a>
</li>
<li>
    <span class="authors">Tova Milo</span>
    <span class="title">The Smart Crowd - Learning from the Ones Who Know (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.3">10.4230/LIPIcs.ICDT.2017.3</a>
</li>
<li>
    <span class="authors">Foto N. Afrati, Manas R. Joglekar, Christopher M. Re, Semih Salihoglu, and Jeffrey D. Ullman</span>
    <span class="title">GYM: A Multiround Distributed Join Algorithm</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.4">10.4230/LIPIcs.ICDT.2017.4</a>
</li>
<li>
    <span class="authors">Antoine Amarilli, Yael Amsterdamer, Tova Milo, and Pierre Senellart</span>
    <span class="title">Top-k Querying of Unknown Values under Order Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.5">10.4230/LIPIcs.ICDT.2017.5</a>
</li>
<li>
    <span class="authors">Antoine Amarilli, Pierre Bourhis, Mikaël Monet, and Pierre Senellart</span>
    <span class="title">Combined Tractability of Query Evaluation via Tree Automata and Cycluits</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.6">10.4230/LIPIcs.ICDT.2017.6</a>
</li>
<li>
    <span class="authors">Pablo Barceló and Miguel Romero</span>
    <span class="title">The Complexity of Reverse Engineering Problems for Conjunctive Queries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.7">10.4230/LIPIcs.ICDT.2017.7</a>
</li>
<li>
    <span class="authors">Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt</span>
    <span class="title">Answering FO+MOD Queries Under Updates on Bounded Degree Databases</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.8">10.4230/LIPIcs.ICDT.2017.8</a>
</li>
<li>
    <span class="authors">Simone Bova and Hubie Chen</span>
    <span class="title">How Many Variables Are Needed to Express an Existential Positive Query?</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.9">10.4230/LIPIcs.ICDT.2017.9</a>
</li>
<li>
    <span class="authors">Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, and Wang-Chiew Tan</span>
    <span class="title">Expressive Power of Entity-Linking Frameworks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.10">10.4230/LIPIcs.ICDT.2017.10</a>
</li>
<li>
    <span class="authors">Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, and Wei Zhan</span>
    <span class="title">k-Regret Minimizing Set: Efficient Algorithms and Hardness</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.11">10.4230/LIPIcs.ICDT.2017.11</a>
</li>
<li>
    <span class="authors">Shaleen Deep and Paraschos Koutris</span>
    <span class="title">The Design of Arbitrage-Free Data Pricing Schemes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.12">10.4230/LIPIcs.ICDT.2017.12</a>
</li>
<li>
    <span class="authors">Dominik D. Freydenberger</span>
    <span class="title">A Logic for Document Spanners</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.13">10.4230/LIPIcs.ICDT.2017.13</a>
</li>
<li>
    <span class="authors">Minos Garofalakis and Vasilis Samoladas</span>
    <span class="title">Distributed Query Monitoring through Convex Analysis: Towards Composable Safe Zones</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.14">10.4230/LIPIcs.ICDT.2017.14</a>
</li>
<li>
    <span class="authors">Tomasz Gogacz and Szymon Torunczyk</span>
    <span class="title">Entropy Bounds for Conjunctive Queries with Functional Dependencies</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.15">10.4230/LIPIcs.ICDT.2017.15</a>
</li>
<li>
    <span class="authors">Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, and Florian Zuleger</span>
    <span class="title">On the Automated Verification of Web Applications with Embedded SQL</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.16">10.4230/LIPIcs.ICDT.2017.16</a>
</li>
<li>
    <span class="authors">Benny Kimelfeld, Ester Livshits, and Liat Peterfreund</span>
    <span class="title">Detecting Ambiguity in Prioritized Database Repairing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.17">10.4230/LIPIcs.ICDT.2017.17</a>
</li>
<li>
    <span class="authors">Markus Lohrey, Sebastian Maneth, and Carl Philipp Reh</span>
    <span class="title">Compression of Unordered XML Trees</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.18">10.4230/LIPIcs.ICDT.2017.18</a>
</li>
<li>
    <span class="authors">Thomas Schwentick, Nils Vortmeier, and Thomas Zeume</span>
    <span class="title">Dynamic Complexity under Definable Changes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.19">10.4230/LIPIcs.ICDT.2017.19</a>
</li>
<li>
    <span class="authors">Luc Segoufin and Alexandre Vigny</span>
    <span class="title">Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.20">10.4230/LIPIcs.ICDT.2017.20</a>
</li>
<li>
    <span class="authors">Bruhathi Sundarmurthy, Paraschos Koutris, Willis Lang, Jeffrey Naughton, and Val Tannen</span>
    <span class="title">m-tables: Representing Missing Data</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.21">10.4230/LIPIcs.ICDT.2017.21</a>
</li>
<li>
    <span class="authors">Andrew McGregor and Hoa T. Vu</span>
    <span class="title">Better Streaming Algorithms for the Maximum Coverage Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2017.22">10.4230/LIPIcs.ICDT.2017.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