HTML Export for Dagstuhl Seminar Proceedings, Volume 6201

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 6201, </h2>
<ul>
<li>
    <span class="authors">Rudolf Ahlswede, Alberto Apostolico, and Vladimir I. Levenshtein</span>
    <span class="title">06201 Abstracts Collection – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.1">10.4230/DagSemProc.06201.1</a>
</li>
<li>
    <span class="authors">Rudolf Ahlswede, Alberto Apostolico, and Vladimir I. Levenshtein</span>
    <span class="title">06201 Executive Summary – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.2">10.4230/DagSemProc.06201.2</a>
</li>
<li>
    <span class="authors">Lee Jones and Konstantin Rybnikov</span>
    <span class="title">Local Minimax Learning of Approximately Polynomial Functions</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.3">10.4230/DagSemProc.06201.3</a>
</li>
<li>
    <span class="authors">Rudolf Ahlswede, Christian Deppe, and Vladimir Lebedev</span>
    <span class="title">Non--binary error correcting codes with noiseless feedback, localized errors, or both</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.4">10.4230/DagSemProc.06201.4</a>
</li>
<li>
    <span class="authors">Alberto Apostolico and Cinzia Pizzi</span>
    <span class="title">On the Monotonicity of the String Correction Factor for Words with Mismatches</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.5">10.4230/DagSemProc.06201.5</a>
</li>
<li>
    <span class="authors">Daniil Ryabko and Marcus Hutter</span>
    <span class="title">Sequence prediction for non-stationary processes</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.6">10.4230/DagSemProc.06201.6</a>
</li>
<li>
    <span class="authors">Yury Lifshits</span>
    <span class="title">Solving Classical String Problems an Compressed Texts</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.7">10.4230/DagSemProc.06201.7</a>
</li>
<li>
    <span class="authors">Zlatko Varbanov</span>
    <span class="title">Some Results for Identification for Sources and its Extension to Liar Models</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.8">10.4230/DagSemProc.06201.8</a>
</li>
<li>
    <span class="authors">Andrei Asinowski</span>
    <span class="title">Suballowable sequences of permutations</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.9">10.4230/DagSemProc.06201.9</a>
</li>
<li>
    <span class="authors">Péter L. Erdös, Péter Ligeti, Péter Sziklai, and David C. Torney</span>
    <span class="title">Subwords in reverse-complement order</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.10">10.4230/DagSemProc.06201.10</a>
</li>
<li>
    <span class="authors">Elena Konstantinova</span>
    <span class="title">Vertex reconstruction in Cayley graphs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06201.11">10.4230/DagSemProc.06201.11</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