HTML Export for Dagstuhl Seminar Proceedings, Volume 9281

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 9281, </h2>
<ul>
<li>
    <span class="authors">Rudolf Ahlswede, Ferdinando Cicalese, and Ugo Vaccaro</span>
    <span class="title">09281 Abstracts Collection – Search Methodologies</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09281.1">10.4230/DagSemProc.09281.1</a>
</li>
<li>
    <span class="authors">Ely Porat and Amir Rotschild</span>
    <span class="title">Explicit Non-Adaptive Combinatorial Group Testing Schemes</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09281.2">10.4230/DagSemProc.09281.2</a>
</li>
<li>
    <span class="authors">Charles J. Colbourn and Daniel W. McClary</span>
    <span class="title">Locating and Detecting Arrays for Interaction Faults</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09281.3">10.4230/DagSemProc.09281.3</a>
</li>
<li>
    <span class="authors">Pawel Gawrychowski and Travis Gagie</span>
    <span class="title">Minimax Trees in Linear Time with Applications</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09281.4">10.4230/DagSemProc.09281.4</a>
</li>
<li>
    <span class="authors">Raphael Clifford, Klim Efremo, Ely Porat, and Amir Rotschild</span>
    <span class="title">Pattern matching with don&#039;t cares and few errors</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09281.5">10.4230/DagSemProc.09281.5</a>
</li>
<li>
    <span class="authors">Gábor Wiener</span>
    <span class="title">Rounds in Combinatorial Search</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09281.6">10.4230/DagSemProc.09281.6</a>
</li>
<li>
    <span class="authors">Kingo Kobayashi</span>
    <span class="title">Some Aspects of Finite State Channel related to Hidden Markov Process</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09281.7">10.4230/DagSemProc.09281.7</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