权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

17th International Conference on Random Structures and Algorithms

第十七届随机结构与算法国际会议

基本信息

批准号：
1506338
负责人：
Tom Bohman
金额：
$ 2.38万
依托单位：
Carnegie-Mellon University
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2015
资助国家：
美国
起止时间：
2015-05-01 至 2016-04-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1506338&HistoricalAwards=false
关键词：
17th International Conference Random Structures

项目摘要

This award supports participation in the 17th International Conference on Random Structures and Algorithms held at Carnegie Mellon University in Pittsburgh, July 27 - 31, 2015. Random Structures and Algorithms is a biennial meeting, initiated in 1983 at 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. For more information see the conference website: http://rsa2015.amu.edu.pl/Randomness continues to play a fundamental role in demonstrating the existence of combinatorial structures with desired (optimal) properties as well as in the design of practical and efficient algorithms for problems in combinatorial optimization and computing. The Random Structures and Algorithms 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 computer science. The choice of the plenary speakers at the conference highlights important themes ranging from classical topics such as Ramsey theory, cryptography, phase transitions in random graphs, and combinatorial designs, which have seen recent exciting progress, to modern topics including hypergraph container theorems, cloud computing, hardness of approximation for optimization problems, and algorithms in high dimensional computing and social networks.

该奖项支持参加2015年7月27日至31日在匹兹堡卡内基梅隆大学举行的第17届随机结构和算法国际会议。随机结构和算法是两年一次的会议，于1983年在波兰波兹南的亚当密茨凯维奇大学发起。这些会议的目的是介绍最近的研究成果，并确定和探索方向，进一步研究随机离散结构，随机算法，以及离散数学，计算机科学和相关领域的概率方法的广泛应用领域。欲了解更多信息，请参阅会议网站：http://rsa2015.amu.edu.pl/Randomness继续发挥基本作用，证明存在的组合结构与所需的（最佳）属性，以及在设计实用和有效的算法的问题，在组合优化和计算。随机结构和算法会议被确立为概率方法及其在离散数学和计算机科学中的应用的发展趋势和突破的阐述的关键场所。大会全体发言人的选择突出了重要的主题，从经典的主题，如拉姆齐理论，密码学，随机图中的相变和组合设计，这些都是最近取得令人兴奋的进展，到现代的主题，包括超图容器定理，云计算，优化问题的近似硬度，以及高维计算和社交网络中的算法。