Random Structures and Algorithms Conference - 2011

第十五届随机结构与算法国际会议摘要第十五届随机结构与算法国际会议将于2011年5月24-28日在亚特兰大的埃默里大学举行。这是一次两年一度的会议，由波兰波兹南的亚当·米凯维奇大学数学系于1983年发起。这些会议的目的是展示最新的研究成果，并确定和探索在随机离散结构、随机算法和概率方法在离散数学、计算机科学和相关领域的广泛应用领域的进一步研究方向。会议是一个关键的场所，旨在阐述概率方法的发展趋势和突破及其在离散数学和CS理论中的应用。全体演讲者的选择突出了重要主题，从最近取得令人兴奋的进展的经典主题，如Ramsey理论、随机图中的相变和正则性引理，到现代主题，包括消息传递算法、优化问题的独特博弈逼近难度、与互联网相关的机制设计、拍卖和计算博弈论。会议的一个主要特点是来自离散数学、理论CS和优化的研究人员混合在一起，对概率工具及其应用产生了共同的兴趣。在亚特兰大举行会议的目的是吸引CS理论界的更多参与，CS理论界可以说是这个国家最发达的。会议活动将通过主要研究期刊《随机结构与算法》在会议网站上的会议记录以及通过选定讲座的存档和/或流媒体视频广泛传播。我们希望吸引和支持大量的学生和博士后研究人员，以及来自社区中代表性不足的群体的参与者。

The 15th International Conference on Random Structures & AlgorithmsAbstractThe 15th International Conference on Random Structures & Algorithms will take place at Emory University in Atlanta, May 24 - 28, 2011. This is a biennial meeting, initiated in 1983 by the Faculty of Mathematics, Adam Mickiewicz University, in Poznan, Poland. The aims of these conferences are to present recent research results and to identify and explore directions for further research in random discrete structures, randomized algorithms and broad areas of applications of probabilistic methods in discrete mathematics, computer science, and related fields.The conference is established as a key locus for the exposition of trends and breakthroughs in the development of probabilistic methods and their application in discrete mathematics and CS theory.The choice of the plenary speakers highlights important themes ranging from classical topics such as Ramsey theory, phase transitions in random graphs, and the regularity lemma, which have seen recent exciting progress, to modern ones including message passing algorithms, unique games related hardness of approximation for optimization problems, internet related mechanism design, auctions, and computational game theory.A main feature of the conferences is the mix of researchers from discrete mathematics, theoretical CS and optimization, attracted by a common interest in probabilistic tools and their application. Holding the meeting in Atlanta is intended to attract more involvement from the CS theory community, which is arguably best-developed in this country. Conference activities will be widely disseminated by the conference proceedings in Random Structures & Algorithms, a leading research journal, on the conference website, and through archived and/or streaming video of selected lectures. We hope to attract, and support, a large number of students and postdoctoral researchers, and participants from groups under-represented in the community.