Dagstuhl Seminar Proceedings: Probabilistic Methods in the Design and Analysis of Algorithms 2007

Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (Eds.): Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007

Bodo Manthey, Till Tantau:
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.
Chaitanya Swamy, David B. Shmoys:
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.
Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms.

Last update Thu May 24 04:15:53 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page