HTML Export for Dagstuhl Seminar Proceedings, Volume 8261

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 8261, </h2>
<ul>
<li>
    <span class="authors">Stefan Böttcher, Markus Lohrey, Sebastian Maneth, and Wojciech Rytter</span>
    <span class="title">08261 Abstracts Collection – Structure-Based Compression of Complex Massive Data</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.1">10.4230/DagSemProc.08261.1</a>
</li>
<li>
    <span class="authors">Stefan Böttcher, Markus Lohrey, Sebastian Maneth, and Wojciech Rytter</span>
    <span class="title">08261 Executive Summary – Structure-Based Compression of Complex Massive Data</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.2">10.4230/DagSemProc.08261.2</a>
</li>
<li>
    <span class="authors">Barbara Fila-Kordy</span>
    <span class="title">A Rewrite Approach for Pattern Containment – Application to Query Evaluation on Compressed Documents</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.3">10.4230/DagSemProc.08261.3</a>
</li>
<li>
    <span class="authors">Hiroshi Sakamoto</span>
    <span class="title">A Space-Saving Approximation Algorithm for Grammar-Based Compression</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.4">10.4230/DagSemProc.08261.4</a>
</li>
<li>
    <span class="authors">Wataru Matsubara, Shunsuke Inenaga, and Ayumi Shinohara</span>
    <span class="title">An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.5">10.4230/DagSemProc.08261.5</a>
</li>
<li>
    <span class="authors">Angela Bonifati, Gregory Leighton, Veli Mäkinen, Sebastian Maneth, Gonzalo Navarro, and Andrea Pugliese</span>
    <span class="title">An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.6">10.4230/DagSemProc.08261.6</a>
</li>
<li>
    <span class="authors">William S. Evans, Christoph W. Fraser, and Fei Ma</span>
    <span class="title">Clone Detection via Structural Abstraction</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.7">10.4230/DagSemProc.08261.7</a>
</li>
<li>
    <span class="authors">Siva Anantharaman</span>
    <span class="title">Compression vs Queryability - A Case Study</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.8">10.4230/DagSemProc.08261.8</a>
</li>
<li>
    <span class="authors">Andrei Arion, Angela Bonifati, Ioana Manolescu, and Andrea Pugliese</span>
    <span class="title">Optimizing XML Compression in XQueC</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.9">10.4230/DagSemProc.08261.9</a>
</li>
<li>
    <span class="authors">Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, and Niko Välimäki</span>
    <span class="title">Storage and Retrieval of Individual Genomes</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.10">10.4230/DagSemProc.08261.10</a>
</li>
<li>
    <span class="authors">Tomasz Müldner, Christopher Fry, Jan Krzysztof Miziolek, and Scott Durno</span>
    <span class="title">SXSAQCT and XSAQCT: XML Queryable Compressors</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.11">10.4230/DagSemProc.08261.11</a>
</li>
<li>
    <span class="authors">Andrei Arion, Angela Bonifati, Ioana Manolescu, and Andrea Pugliese</span>
    <span class="title">The XQueC Project: Compressing and Querying XML</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08261.12">10.4230/DagSemProc.08261.12</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