From 23.09.2007 to 28.09.2007, the Dagstuhl Seminar 07391Probabilistic 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 prob abilistic methods to strengthen and foster collaborations among vari ous areas of Theoretical Computer Science. The interaction between re searchers using randomization in algorithm design and researchers study ing 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 par ticipants 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 rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if avail able.
【 预 览 】
附件列表
Files
Size
Format
View
Probabilistic Methods in the Design and Analysis of Algorithms