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年在波兰Poznan的Adam Mickiewicz University于1983年发起。 这些会议的目的是提出最新的研究结果，并识别和探索在随机离散结构，随机算法以及在离散数学，计算机科学和相关领域中应用概率方法应用的广泛领域的进一步研究方向。 有关更多信息，请参见会议网站：http：//rsa2015.amu.edu.pl/randomness继续在证明具有所需（最佳）属性以及设计的实用和高效算法的组合属性和计算算法的组合结构方面继续发挥基本作用。随机结构和算法会议是在开发概率方法开发趋势和突破性及其在离散数学和计算机科学中的应用中的趋势和突破的关键基因座。 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.