HTML Export for Dagstuhl Seminar Proceedings, Volume 6111

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 6111, </h2>
<ul>
<li>
    <span class="authors">Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, and Dieter van Melkebeek</span>
    <span class="title">06111 Abstracts Collection – Complexity of Boolean Functions</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.1">10.4230/DagSemProc.06111.1</a>
</li>
<li>
    <span class="authors">Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, and Rüdiger Reischuk</span>
    <span class="title">06111 Executive Summary – Complexity of Boolean Functions</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.2">10.4230/DagSemProc.06111.2</a>
</li>
<li>
    <span class="authors">Dieter van Melkebeek and Konstantin Pervyshev</span>
    <span class="title">A Generic Time Hierarchy for Semantic Models With One Bit of Advice</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.3">10.4230/DagSemProc.06111.3</a>
</li>
<li>
    <span class="authors">Jan Arpe and Bodo Manthey</span>
    <span class="title">Approximability of Minimum AND-Circuits</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.4">10.4230/DagSemProc.06111.4</a>
</li>
<li>
    <span class="authors">Igor E. Shparlinski</span>
    <span class="title">Bounds on the Fourier Coefficients of the Weighted Sum Function</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.5">10.4230/DagSemProc.06111.5</a>
</li>
<li>
    <span class="authors">Andreas Jakoby and Till Tantau</span>
    <span class="title">Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.6">10.4230/DagSemProc.06111.6</a>
</li>
<li>
    <span class="authors">Marcin Gomulkiewicz, Miroslaw Kutylowski, and Pawel Wlaz</span>
    <span class="title">Fault Jumping Attacks against Shrinking Generator</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.7">10.4230/DagSemProc.06111.7</a>
</li>
<li>
    <span class="authors">Stasys Jukna</span>
    <span class="title">Graphs and Circuits: Some Further Remarks</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.8">10.4230/DagSemProc.06111.8</a>
</li>
<li>
    <span class="authors">Jeff Ford and Anna Gál</span>
    <span class="title">Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.9">10.4230/DagSemProc.06111.9</a>
</li>
<li>
    <span class="authors">Anna Gál, Pierre McKenzie, and Michal Koucký</span>
    <span class="title">Incremental branching programs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.10">10.4230/DagSemProc.06111.10</a>
</li>
<li>
    <span class="authors">Emanuele Viola</span>
    <span class="title">On Probabilistic Time versus Alternating Time</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.11">10.4230/DagSemProc.06111.11</a>
</li>
<li>
    <span class="authors">Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, and Peter Bro Miltersen</span>
    <span class="title">On the Complexity of Numerical Analysis</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.12">10.4230/DagSemProc.06111.12</a>
</li>
<li>
    <span class="authors">Frank J. Balbach and Thomas Zeugmann</span>
    <span class="title">On the Teachability of Randomized Learners</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.13">10.4230/DagSemProc.06111.13</a>
</li>
<li>
    <span class="authors">Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Shigeru Yamashita</span>
    <span class="title">Quantum Network Coding</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.14">10.4230/DagSemProc.06111.14</a>
</li>
<li>
    <span class="authors">Martin Sauerhoff</span>
    <span class="title">Quantum vs. Classical Read-Once Branching Programs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.15">10.4230/DagSemProc.06111.15</a>
</li>
<li>
    <span class="authors">Eike Kiltz and Enav Weinreb</span>
    <span class="title">Secure Linear Algebra Using Linearly Recurrent Sequences</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.16">10.4230/DagSemProc.06111.16</a>
</li>
<li>
    <span class="authors">Anna Gál and Peter Bro Miltersen</span>
    <span class="title">The Cell Probe Complexity of Succinct Data Structures</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.17">10.4230/DagSemProc.06111.17</a>
</li>
<li>
    <span class="authors">Claude Carlet</span>
    <span class="title">The complexity of Boolean functions from cryptographic viewpoint</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.18">10.4230/DagSemProc.06111.18</a>
</li>
<li>
    <span class="authors">Alexander E. Andreev</span>
    <span class="title">The optimal sequence compression</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.19">10.4230/DagSemProc.06111.19</a>
</li>
<li>
    <span class="authors">Scott Diehl and Dieter van Melkebeek</span>
    <span class="title">Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.20">10.4230/DagSemProc.06111.20</a>
</li>
<li>
    <span class="authors">Andreas Jakoby, Maciej Liskiewicz, and Aleksander Madry</span>
    <span class="title">Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.21">10.4230/DagSemProc.06111.21</a>
</li>
<li>
    <span class="authors">Alexander E. Andreev and Stasys Jukna</span>
    <span class="title">Very Large Cliques are Easy to Detect</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06111.22">10.4230/DagSemProc.06111.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