2018年高德纳奖授予约翰·哈马斯塔德

Shenghua Teng
{"title":"2018年高德纳奖授予约翰·哈马斯塔德","authors":"Shenghua Teng","doi":"10.1145/3289137.3289152","DOIUrl":null,"url":null,"abstract":"The 2018 Donald E. Knuth Prize will be awarded to Johan Håstad of KTH Royal Institute of Technology for his long and sustained record of milestone breakthroughs at the foundations of computer science, with huge impact on many areas including optimization, cryptography, parallel computing, and complexity theory. Håstad's multiple seminal works have not only resolved longstanding deepest problems central to circuit lower bounds, pseudorandom generation, and approximability, but also introduced transformative techniques that have fundamentally influenced much of the subsequent work in these areas.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"2018 Knuth Prize is Awarded to Johan Håstad\",\"authors\":\"Shenghua Teng\",\"doi\":\"10.1145/3289137.3289152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The 2018 Donald E. Knuth Prize will be awarded to Johan Håstad of KTH Royal Institute of Technology for his long and sustained record of milestone breakthroughs at the foundations of computer science, with huge impact on many areas including optimization, cryptography, parallel computing, and complexity theory. Håstad's multiple seminal works have not only resolved longstanding deepest problems central to circuit lower bounds, pseudorandom generation, and approximability, but also introduced transformative techniques that have fundamentally influenced much of the subsequent work in these areas.\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3289137.3289152\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3289137.3289152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

2018年唐纳德·e·高德纳奖将授予KTH皇家理工学院的Johan ha斯塔德,以表彰他在计算机科学基础上长期持续的里程碑式突破,对优化、密码学、并行计算和复杂性理论等许多领域产生了巨大影响。ha斯塔德的多项开创性工作不仅解决了电路下界、伪随机生成和近似性等长期存在的最深层问题,而且还引入了革命性的技术,这些技术从根本上影响了这些领域的后续工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
2018 Knuth Prize is Awarded to Johan Håstad
The 2018 Donald E. Knuth Prize will be awarded to Johan Håstad of KTH Royal Institute of Technology for his long and sustained record of milestone breakthroughs at the foundations of computer science, with huge impact on many areas including optimization, cryptography, parallel computing, and complexity theory. Håstad's multiple seminal works have not only resolved longstanding deepest problems central to circuit lower bounds, pseudorandom generation, and approximability, but also introduced transformative techniques that have fundamentally influenced much of the subsequent work in these areas.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Technical Report Column Open Problems Column Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds The Book Review Column Recent Advances in Multi-Pass Graph Streaming Lower Bounds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1