<h2>Dagstuhl Seminar Proceedings, Volume 8341, </h2> <ul> <li> <span class="authors">Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, and Christian Sohler</span> <span class="title">08341 Abstracts Collection – Sublinear Algorithms</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08341.1">10.4230/DagSemProc.08341.1</a> </li> <li> <span class="authors">Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, and Christian Sohler</span> <span class="title">08341 Executive Summary – Sublinear Algorithms</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08341.2">10.4230/DagSemProc.08341.2</a> </li> <li> <span class="authors">Tali Kaufman, Simon Litsyn, and Ning Xie</span> <span class="title">Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08341.3">10.4230/DagSemProc.08341.3</a> </li> <li> <span class="authors">Sumit Ganguly</span> <span class="title">Lower bound for estimating frequency for update data streams</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08341.4">10.4230/DagSemProc.08341.4</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
Feedback for Dagstuhl Publishing