请输入您要查询的百科知识：

　

词条 Paris Kanellakis Award
释义

  1. Winners

  2. Notes

  3. External links

The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing".[1] It was instituted in 1996, in memory of Paris C. Kanellakis, a computer scientist who died with his immediate family in an airplane crash in South America in 1995 (American Airlines Flight 965).[2] The award is accompanied by a prize of $10,000 and is endowed by contributions from Kanellakis's parents, with additional financial support provided by four ACM Special Interest Groups (SIGACT, SIGDA, SIGMOD, and SIGPLAN), the ACM SIG Projects Fund, and individual contributions.[1]

Winners

Year Winners Citation
1996 Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, and Adi Shamir For "the conception and first effective realization of public-key cryptography".[5]
1997 Abraham Lempel and Jacob Ziv For their pioneering work in data compression, leading to their LZ algorithm which "yields the best compression rate achievable by finite-state encoders" and "can be found in virtually every modern computer".[6]
1998 Randal Bryant, Edmund M. Clarke, E. Allen Emerson, and Kenneth L. McMillan For "their invention of 'symbolic model checking', a method of formally checking system designs widely used in the computer hardware industry".[7]
1999 Daniel Sleator and Robert Tarjan For "invention of the widely used splay-tree data structure".[8]
2000 Narendra Karmarkar For "his theoretical work in devising an interior point method for linear programming that provably runs in polynomial time, and for his implementation work suggesting that Interior Point methods could be effective for linear programming in practice as well as theory".[9]
2001 Eugene Myers For "his contribution to sequencing the human genome, the complete DNA content of a human cell, and encoding all of its genes, the basic building blocks of life".[10]
2002 Peter Franaszek For "his seminal and sustained contributions to the theory and application of constrained channel coding".[11]
2003 Gary Miller, Michael Rabin, Robert Solovay, and Volker Strassen For "their contributions to realizing the practical uses of cryptography and for demonstrating the power of algorithms that make random choices", through work which "led to two probabilistic primality tests, known as the Solovay–Strassen test and the Miller–Rabin test".[12]
2004 Yoav Freund and Robert Schapire For their "seminal work and distinguished contributions [...] to the development of the theory and practice of boosting, a general and provably effective method of producing arbitrarily accurate prediction rules by combining weak learning rules"; specifically, for AdaBoost, their machine learning algorithm, which "can be used to significantly reduce the error of algorithms used in statistical analysis, spam filtering, fraud detection, optical character recognition, and market segmentation, among other applications".[13]
2005 Gerard Holzmann, Robert Kurshan, Moshe Vardi, and Pierre Wolper For "their contribution to techniques that provide powerful formal verification tools for hardware and software systems".[14]
2006 Robert Brayton For "his innovative contributions to logic synthesis and electronic system simulation, which have made possible rapid circuit design technologies for the electronic design automation industry".[15]
2007 Bruno Buchberger For "his role in developing the theory of Groebner bases, which has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science".[16]
2008 Corinna Cortes and Vladimir Vapnik For "their revolutionary development of a highly effective algorithm known as support vector machines (SVM), a set of related supervised learning methods used for data classification and regression", which is "one of the most frequently used algorithms in machine learning, and is used in medical diagnosis, weather forecasting, and intrusion detection among many other practical applications".[17]
2009 Mihir Bellare and Phillip Rogaway For "their development of practice-oriented provable security, which has resulted in high-quality, cost-effective cryptography, a key component for Internet security in an era of explosive growth in online transactions".[18]
2010 Kurt Mehlhorn For "contributions to algorithm engineering that led to creation of the Library of Efficient Data types and Algorithms (LEDA)", a software collection of data structures and algorithms which "has been incorporated in the applied research programs of thousands of companies worldwide in telecommunications, bioinformatics, computer-aided design (CAD) and geographic information systems (GIS), banking, optical products, and transportation".[19]
2011 Hanan Samet For "pioneering research on quadtrees and other multidimensional spatial data structures for sorting spatial information, as well as his well-received books, which have profoundly influenced the theory and application of these structures".[20]
2012 Andrei Broder, Moses S Charikar and Piotr Indyk For "their groundbreaking work on locality-sensitive hashing that has had great impact in many fields of computer science including computer vision, databases, information retrieval, machine learning, and signal processing".[21]
2013 Robert D. Blumofe, and Charles E. Leiserson For "contributions to efficient and robust parallel computation through both provably efficient randomized scheduling protocols and a set of parallel-language primitives constituting the Cilk framework".[22] They developed provably efficient randomized work stealing scheduling algorithms, and Cilk, a small set of linguistic primitives for programming multithreaded computations.[22]
2014 James Demmel For "contributions to algorithms and software for numerical linear algebra used in scientific computing and large-scale data analysis."[24]
2015 Michael Luby For "groundbreaking contributions to erasure correcting codes, which are essential for improving the quality of video transmission over the Internet."[25]
2016 Amos Fiat and Moni Naor For "the development of broadcast encryption and traitor tracing systems".[26][1]
2017 Scott Shenker

Notes

1. ^{{cite web |url=https://awards.acm.org/about/2016-technical-awards |title=ACM Honors Eminent Researchers for Technical Innovations: 2016 Recipients Made Contributions in Areas Including Big Data Analysis, Computer Vision, and Encryption |publisher=ACM |accessdate=2017-11-22}}
2. ^1 2 {{cite web |title=Paris Kanellakis Theory and Practice Award |publisher=ACM |url=http://awards.acm.org/homepage.cfm?srt=all&awd=147 |accessdate=2012-12-12}}
3. ^1 {{cite journal |title=ACM Paris Kanellakis Award |journal=Conduit |publisher=Brown CS Dept |year=1996 |volume=5 |issue=1 |page=4 |url=http://www.cs.brown.edu/publications/conduit/conduit_v5n1.pdf#page=4}}
4. ^1 {{cite press release |title = The first Paris Kanellakis Theory and Practice Award goes to founders of public key cryptography |date = 12 Feb 1997 |publisher = ACM |url = http://www.acm.org/announcements/pkaward.html |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20120211141338/http://www.acm.org/announcements/pkaward.html |archivedate = 2012-02-11 |df = }}
5. ^1 {{cite press release |title = The ACM Paris Kanellakis Theory and Practice Award goes to pioneers in data compression |date = 26 Mar 1998 |publisher = ACM |url = http://www.acm.org/announcements/kanellakis.html |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20120211141344/http://www.acm.org/announcements/kanellakis.html |archivedate = 2012-02-11 |df = }}
6. ^1 {{cite press release |title = ACM bestows Kanellakis Award for development of 'symbolic model checking,' used in testing computer system designs |date = 26 Mar 1999 |publisher = ACM |url = http://www.acm.org/announcements/kanellakis99.html |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20110605194419/http://www.acm.org/announcements/kanellakis99.html |archivedate = 2011-06-05 |df = }}
7. ^1 {{cite web |title=ACM Paris Kanellakis Theory and Practice Award 1999 |publisher=ACM |url=https://awards.acm.org/award_winners/sleator_0340141 |accessdate=2017-11-22}}
8. ^1 {{cite press release |title = Interior point |year = 2000 |publisher = ACM |url = http://awards.acm.org/citation.cfm?id=0424282&srt=all&aw=147&ao=KANELLAK&yr=2000 |archive-url = https://web.archive.org/web/20120402212312/http://awards.acm.org/citation.cfm?id=0424282&srt=all&aw=147&ao=KANELLAK&yr=2000 |dead-url = yes |archive-date = 2012-04-02 |accessdate = 2012-12-12}}
9. ^1 {{cite press release |title = ACM honors developer of key software for sequencing the human genome |date = 22 Jan 2002 |publisher = ACM |url = http://www.acm.org/announcements/kanellakis_2001.html |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20120211141411/http://www.acm.org/announcements/kanellakis_2001.html |archivedate = 2012-02-11 |df = }}
10. ^1 {{cite press release |title = ACM honors Peter Franaszek for contributions to data encoding |date = 21 May 2003 |publisher = ACM |url = http://www.acm.org/announcements/kanellakis_2002.html |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20120211141420/http://www.acm.org/announcements/kanellakis_2002.html |archivedate = 11 February 2012 |df = }}
11. ^1 {{cite press release |title=ACM honors creators of methods to improve cryptography |date=24 May 2004 |publisher=ACM |url=http://www.acm.org/announcements/kanellakis.5-26-2004.html |accessdate=2012-12-12}}
12. ^1 {{cite web |title=ACM Paris Kanellakis Theory and Practice Award 2004 |publisher=ACM |url=https://awards.acm.org/award_winners/freund_5914554 |accessdate=2017-11-22}}
13. ^1 {{cite press release |title=ACM honors creators of verification tools for software, hardware |date=15 Mar 2006 |publisher=ACM |url=http://www.cs.rice.edu/~vardi/kanellakis.html |accessdate=2012-12-12}}
14. ^1 {{cite press release |title = ACM honors electronic design automation technologies pioneer |date = 29 Mar 2007 |publisher = ACM |url = http://www.acm.org/press-room/news-releases-2007/kanellakis |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20121202054815/http://www.acm.org/press-room/news-releases-2007/kanellakis |archivedate = 2012-12-02 |df = }}
15. ^1 {{cite press release |title = ACM Kanellakis Award honors innovator of automated tools for mathematics |date = 13 May 2008 |publisher = ACM |url = http://www.acm.org/press-room/awards/kanellakis-award-07 |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20130502005225/http://www.acm.org/press-room/awards/kanellakis-award-07/ |archivedate = 2 May 2013 |df = }}
16. ^1 {{cite press release |title = ACM awards recognize innovators in computer science |date = 17 Mar 2009 |publisher = ACM |url = http://www.acm.org//press-room/awards/awards-08-groupa |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20130502005750/http://www.acm.org/press-room/awards/awards-08-groupa/ |archivedate = 2013-05-02 |df = }}
17. ^1 {{cite press release |title = ACM awards recognize computer scientists for innovations that have real world impact |date = 30 Mar 2010 |publisher = ACM |url = http://www.acm.org/press-room/news-releases/2010/awards-09-groupa |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20121202052752/http://www.acm.org/press-room/news-releases/2010/awards-09-groupa |archivedate = 2012-12-02 |df = }}
18. ^1 {{cite press release |title = ACM honors computing innovators for advances in research, commerce and education |date = 6 Apr 2011 |publisher = ACM |url = http://www.acm.org/press-room/awards/technical-awards-2010 |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20130502010135/http://www.acm.org/press-room/awards/technical-awards-2010/ |archivedate = 2013-05-02 |df = }}
19. ^1 {{cite press release |title = ACM honors computing innovators for advances in research, education, and industry |date = 26 Apr 2012 |publisher = ACM |url = http://www.acm.org/press-room/awards/technical-awards-2011 |accessdate = 2012-12-12 |deadurl = yes |archiveurl = https://web.archive.org/web/20130502010437/http://www.acm.org/press-room/awards/technical-awards-2011/ |archivedate = 2013-05-02 |df = }}
20. ^1 {{cite web |title=ACM Paris Kanellakis Theory and Practice Award 2012 |publisher=ACM |url=http://awards.acm.org/homepage.cfm?srt=all&awd=147 |accessdate=2013-05-05}}
21. ^1 2 {{cite web |title=ACM Paris Kanellakis Theory and Practice Award 2013 |publisher=ACM |url=https://awards.acm.org/award_winners/leiserson_1506955 |accessdate=2017-11-22}}
22. ^1 {{cite web |title=ACM Paris Kanellakis Theory and Practice Award 2014 |publisher=ACM |url=http://awards.acm.org/award_winners/demmel_6010135.cfm#147 |accessdate=2015-07-17}}
23. ^1 {{cite web |title=ACM Paris Kanellakis Theory and Practice Award 2015 |publisher=ACM |url=http://awards.acm.org/award_winners/luby_4157467.cfm |accessdate=2016-04-29}}
24. ^1 {{cite web |title=ACM Paris Kanellakis Theory and Practice Award 2016 |publisher=ACM |url=https://awards.acm.org/award_winners/fiat_8021946 |accessdate=2017-11-22}}
[2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24]
}}

External links

  • Paris Kanellakis Theory and Practice Award on the ACM website.
  • The Paris Kanellakis Theory and Practice Award Committee on the ACM website.
{{Kanellakis Award laureates|state=expanded}}{{Association for Computing Machinery}}

2 : Association for Computing Machinery|Computer science awards
随便看

　

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

　

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间：2024/9/30 20:29:04