【24h】

First to market is not everything

机译:抢占市场不是一切

获取原文

摘要

The papers in this volume were presented at the 39th ACM Symposium on Theory of Computing (STOC), held June 11-13, 2007 in San Diego, California, as part of the Federated Computer Research Conference (FCRC). STOC was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).This volume also contains an abstract for an invited talk delivered by the recipient of the 8th Knuth Prize, Nancy Lynch from MIT. >The papers accepted to the conference were selected from a record number of 312 submissions. The program committee conducted initial electronic discussions, and these were followed by a physical meeting in Atlanta, Georgia. One quarter of the submissions were selected for presentation, and following a merge of two papers the final number of accepted papers stands at 77. Though all papers received careful consideration, they were not refereed in a formal sense, and the authors are encouraged to submit full versions of their papers for publication in journals. >From the many outstanding candidates, the STOC program committee selected the following two papers as recipients of the Best Paper Award: "Faster Integer Multiplication", by Martin Furer, and "Towards 3-Query Locally Decodable Codes of Subexponential Length" by Sergey Yekhanin. The latter of these two papers is also ther ecipient of the Danny Lewin Best Student Paper Award.
机译:该卷的论文作为联邦计算机研究会议(FCRC)的一部分,于2007年6月11日至13日在加利福尼亚州圣地亚哥举行的第39届ACM计算理论专题讨论会(STOC)上进行了介绍。 STOC由ACM算法与计算理论特别兴趣小组(SIGACT)赞助,该卷还包含第八届Knuth奖得主,麻省理工学院的南希·林奇(Nancy Lynch)的受邀演讲摘要。

从312笔创纪录的论文中选出了参加会议的论文。程序委员会进行了初步的电子讨论,随后在佐治亚州的亚特兰大举行了一次物理会议。提交的论文中有四分之一被选为演示文稿,在将两篇论文合并后,最终被接受的论文数量为77篇。尽管所有论文都经过了认真的考虑,但并未正式引用它们,因此鼓励作者提交

STOC计划委员会从许多杰出的候选人中选出以下两篇论文作为“最佳论文奖”的获得者:Martin Furer的“ Faster Integer Multiplication”,和Sergey Yekhanin撰写的“走向3查询次指数长度的本地可分解代码”。这两篇论文中的后者也是Danny Lewin最佳学生论文奖的获得者。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号