<h2>Dagstuhl Seminar Proceedings, Volume 7391, </h2> <ul> <li> <span class="authors">Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, and Berthold Vöcking</span> <span class="title">07391 Abstracts Collection – Probabilistic Methods in the Design and Analysis of Algorithms</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07391.1">10.4230/DagSemProc.07391.1</a> </li> <li> <span class="authors">Chaitanya Swamy and David Shmoys</span> <span class="title">Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07391.2">10.4230/DagSemProc.07391.2</a> </li> <li> <span class="authors">Bodo Manthey and Till Tantau</span> <span class="title">Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07391.3">10.4230/DagSemProc.07391.3</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