License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07391.1
URN: urn:nbn:de:0030-drops-12915
Go to the corresponding Portal

Dietzfelbinger, Martin ; Teng, Shang-Hua ; Upfal, Eli ; Vöcking, Berthold

07391 Abstracts Collection -- Probabilistic Methods in the Design and Analysis of Algorithms

07391_abstracts.1291.pdf (0.2 MB)


From 23.09.2007 to 28.09.2007, the Dagstuhl Seminar 07391 "Probabilistic Methods in the Design and Analysis of Algorithms''was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
The seminar brought together leading researchers in probabilistic
methods to strengthen and foster collaborations among various areas of
Theoretical Computer Science. The interaction between researchers
using randomization in algorithm design and researchers studying known
algorithms and heuristics in probabilistic models enhanced the
research of both groups in developing new complexity frameworks and in
obtaining new algorithmic results.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.

BibTeX - Entry

  author =	{Dietzfelbinger, Martin and Teng, Shang-Hua and Upfal, Eli and V\"{o}cking, Berthold},
  title =	{{07391 Abstracts Collection – Probabilistic Methods in the Design and Analysis of Algorithms}},
  booktitle =	{Probabilistic Methods in the Design and Analysis of Algorithms},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7391},
  editor =	{Martin Dietzfelbinger and Shang-Hua Teng and Eli Upfal and Berthold V\"{o}cking},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-12915},
  doi =		{10.4230/DagSemProc.07391.1},
  annote =	{Keywords: Algorithms, Randomization, Probabilistic analysis, Complexity}

Keywords: Algorithms, Randomization, Probabilistic analysis, Complexity
Collection: 07391 - Probabilistic Methods in the Design and Analysis of Algorithms
Issue Date: 2007
Date of publication: 18.12.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI