Paris Kanellakis Award
From Wikipedia, the free encyclopedia
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. It was instituted in memory of the computer scientist Paris Kanellakis, who died with his immediate family on American Airlines Flight 965. The award is accompanied by a prize of $5,000 and is endowed by contributions from the Kanellakis family, with additional financial support provided by ACM's Special Interest Groups on Algorithms and Computational Theory (SIGACT), Design Automaton (SIGDA), Management of Data (SIGMOD), and Programming Languages (SIGPLAN), the ACM SIG Projects Fund, and individual contributions.
[edit] Awards
- The 1996 award was split among six researchers who together founded the theory of public key cryptography: Leonard Adleman, Whitfield Diffie, Martin Hellman, Ralph Merkle, Ronald Rivest, and Adi Shamir.[1]
- In 1997, the award was given to Abraham Lempel and Jacob Ziv for their pioneering work in data compression.[2]
- The 1998 award was given for the development of model checking, by Randal Bryant, Edmund M. Clarke, Jr., E. Allen Emerson, and Kenneth L. McMillan.[3]
- The ACM gave the 1999 award to Daniel Sleator and Robert Tarjan for the splay tree data structure.[4]
- Narendra Karmarkar won the 2000 award, for his discovery of polynomial time interior point methods for linear programming.[5]
- In 2001, the ACM honored Eugene Myers for his contribution of software and algorithms for genome sequencing.[6]
- The 2002 award went to Peter Franaszek for his work on constrained channel coding.[7]
- In 2003, the ACM honored the developers of randomized primality tests used in public key cryptography: Gary Miller, Michael Rabin, Robert Solovay, and Volker Strassen.[8]
- Yoav Freund and Robert Schapire won the 2004 award for AdaBoost, a machine learning algorithm.[9]
- The ACM honored four researchers in 2005, for their work on formal verification of reactive systems: Gerard Holzmann, Robert Kurshan, Moshe Y. Vardi, and Pierre Wolper.[10]
- The winner of the 2006 award was Robert Brayton. He was honored for his work in logic synthesis and simulation of electronic systems.[11]
[edit] References
- ^ The first Paris Kanellakis Theory and Practice Award goes to founders of public key cryptography. ACM, February 12, 1997.
- ^ The ACM Paris Kanellakis Theory and Practice Award goes to pioneers in data compression. ACM, March 26, 1998.
- ^ ACM Bestows Kanellakis Award For Development of "Symbolic Model Checking," Used In Testing Computer System Designs. ACM, March 29, 1999.
- ^ Splay Tree creators win 1999 Paris Kanellakis Award. ACM, April 26, 2000.
- ^ Flashback... An interior point method for linear programming. IIT Bombay.
- ^ ACM honors developer of key software for sequencing the human genome. ACM, January 22, 2002.
- ^ ACM honors Peter Franaszek for contributions to data encoding. ACM, May 21, 2003.
- ^ ACM honors creators of methods to improve cryptography. ACM, May 24, 2004.
- ^ ACM honors creators of new boosting algorithm. ACM, March 15, 2005.
- ^ ACM honors creators of verification tools for software, hardware. ACM, March 15, 2006.
- ^ ACM honors electronic design automation technologies pioneer. ACM, March 29, 2007.
