HTML Export for Dagstuhl Seminar Proceedings, Volume 5061

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 5061, </h2>
<ul>
<li>
    <span class="authors">Frank Neven, Thomas Schwentick, and Dan Suciu</span>
    <span class="title">05061 Abstracts Collection – Foundations of Semistructured Data</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05061.1">10.4230/DagSemProc.05061.1</a>
</li>
<li>
    <span class="authors">Frank Neven, Thomas Schwentick, and Dan Suciu</span>
    <span class="title">05061 Summary – Foundations of Semi-structured Data</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05061.2">10.4230/DagSemProc.05061.2</a>
</li>
<li>
    <span class="authors">Wolfgang Thomas, Julien Christau, and Christof Löding</span>
    <span class="title">Deterministic Automata on Unranked Trees</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05061.3">10.4230/DagSemProc.05061.3</a>
</li>
<li>
    <span class="authors">Elio Masciari, Sergio Flesca, Giuseppe Manco, Luigi Pontieri, and Andrea Pugliese</span>
    <span class="title">Exploiting Structural Similarity For Effective Web Information Extraction</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05061.4">10.4230/DagSemProc.05061.4</a>
</li>
<li>
    <span class="authors">Joachim Niehren, Laurent Planque, Jean-Marc Talbot, and Sophie Tison</span>
    <span class="title">N-ary Queries by Tree Automata</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05061.5">10.4230/DagSemProc.05061.5</a>
</li>
<li>
    <span class="authors">Felix Weigel, Klaus U. Schulz, and Holger Meuss</span>
    <span class="title">Node Identification Schemes for Efficient XML Retrieval</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05061.6">10.4230/DagSemProc.05061.6</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