Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
复制标题
DOI：
--
复制
发表时间：
2003-06
期刊：
影响因子：
--
通讯作者：
L. Larmore;M. Goemans
中科院分区：
文献类型：
--
作者：
L. Larmore;M. Goemans
本卷中的论文于2003年6月9日至11日在加州圣地亚哥举行的第35届年度ACM计算理论研讨会（STOC 2003）上发表。是次研讨会由美国计算机学会算法及计算理论特别兴趣小组（SIGACT）主办，共收到270篇论文。所有文件均以电子方式提交。计划委员会于2003年1月12日至14日在马里兰州的巴尔的摩举行了一次会议，部分会议是通过物理会议进行的，部分会议是在物理会议前后的10天内通过电子方式进行的。项目委员会从提交的论文中选出了80篇论文。这些论文涵盖了理论计算机科学的各个领域。这些论文并没有像期刊论文那样得到详细的评审，其中许多论文代表了持续研究的报告。预计其中大部分将以更完整的形式出现在科学期刊上。项目委员会已选出两篇论文获得STOC最佳论文奖。这些是“去随机化多项式身份测试意味着证明电路下限”由瓦伦丁卡巴涅茨和罗素Impagliazzo和“新的基于格的密码结构”由Oded Regev。从今年开始，STOC最佳学生论文奖已更名为丹尼·卢因最佳学生论文奖，以纪念已故的丹尼尔·卢因。项目委员会将丹尼·卢因最佳学生论文奖授予托马斯·P·海斯，以表彰他的论文《围长至少为5的随机着色图》。"会议期间，Miklos Ajtai被授予Donald E. Knuth奖，并在全体会议上发表了讲话。
The papers in this volume were presented at the Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC 2003), held in San Diego, California, June 9-11, 2003. The Symposium is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).In response to a call for papers, 270 paper submissions were received. All were submitted electronically. The program committee conducted its deliberations partly in a physical meeting in Baltimore, MD, on January 12 to 14, 2003 and partly electronically in the ten days before and after the physical meeting. The program committee selected 80 papers from among the submissions. The papers encompass a wide variety of areas of theoretical computer science. The submissions were not refereed in a detailed fashion as for journal submissions, and many of these papers represented reports of continuing research. It is expected that most of them will appear in a more complete form in scientific journal.The program committee has selected two papers for the STOC Best Paper Award. These are "Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds" by Valentine Kabanets and Russell Impagliazzo and "New Lattice Based Cryptographic Constructions" By Oded Regev. Starting this year, the STOC Best Student Paper Award has been renamed the Danny Lewin Best Student Paper Award in honor of the late Daniel Lewin. The program committee has awarded the Danny Lewin Best Student Paper Award to Thomas P. Hayes for his paper "Randomly Coloring Graphs of Girth At Least Five." During the conference, Miklos Ajtai was awarded the Donald E.Knuth Prize and gave a plenary talk.