课题基金 / 基金详情

Workshop on Algorithmic Research in Midsouthwest: 1994-1996

Workshop on Algorithmic Research in Midsouthwest: 1994-1996
中西南地区算法研究研讨会:1994-1996
批准号:
9406870
负责人:
Jianer Chen
金额:
$0.5万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1994
资助国家:
美国
项目状态:
已结题
起止时间:
1994-05-01 至 1996-12-31

项目摘要

项目成果

Jianer Chen的其他基金

相似基金

相关文献

中文摘要
翻译
近年来,首都圈理论研讨会特别活跃,每隔一周举办一次讲座。研讨会的一些演讲者是当地人,还有一些是华盛顿特区的游客。邮件列表有107个条目,其中一些是其他邮件列表。研讨会的目标是激发理论计算机科学的活动。在这方面,讨论会比较成功。来自马里兰大学巴尔的摩分校、约翰霍普金斯大学和乔治城大学的研究人员经常参加这个研讨会。中西部算法研究研讨会(WARM)由美国国家科学基金会资助,拨款CCR-9104017,因此,在过去的三年里,来自德克萨斯州,路易斯安那州和俄克拉荷马州的研究人员可以举办两年一次的研讨会,交流算法研究和相关领域的最新发展,并提供一个交流思想的论坛。这笔赠款将使每年春季和秋季两次的WARM会议得以继续。每次将有4到6场演讲,其中包括1到2场来自国内其他地区的访问主要研究人员的演讲。每次会议都有一部分时间用于非正式讨论。***
英文摘要
9406870 Khuller Over recent years, the Capital Area Theory Seminar has been particularly active, hosting a talk every other week. Some of the speakers for the seminar are local, and others are visitors to the DC area. The mailing list has 107 entries, some of which are other mailing lists. The goal of the seminar is to stimulate activity in theoretical computer science. In this regard, the seminar has been relatively successful. The seminar is often attended by researchers from Univ. of Maryland at Baltimore County, Johns Hopkins Univ. and Georgetown University. The Workshop on Algorithmic Research in Midsouthwest (WARM) has been sponsored by the National Science Foundation, under Grant CCR-9104017, so that, in the last three years, researchers from Texas, Louisiana and Oklahoma could hold biannual workshops to exchange the latest developments in algorithmic research and related areas and provide a forum for exchange of ideas. This grant will allow a continuation of WARM meetings twice a year in Spring and Autumn. There will be between 4 and 6 talks each time including 1 or 2 talks from visiting leading researchers from other areas of the country. A portion of each meeting is allocated on informal discussion. ***
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Topological Graph Theory Revisited: With Applications in Computer Graphics
Studies on New Algorithmic Techniques for Parameterized Computation
Computational Upper and Lower Bounds via Parameterized Complexity
Parameterized Computation and Applications
海外基金