Paris Kanellakis Award

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 in an airplane crash in South America in 1995 (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.

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, 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, for their work on the Miller–Rabin and Solovay–Strassen primality tests.^[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]
• The winner of the 2007 award was Bruno Buchberger for his work in "developing the theory of Gröbner bases into a highly effective tool in computer algebra".^[12]
• The winners of the 2008 award were Corinna Cortes and Vladimir Vapnik for their development of Support vector machines.^[13]
• The winners of the 2009 award were Mihir Bellare and Phillip Rogaway for "their development of the field of Practice-Oriented Provable-Security and its widespread impact on the theory and practice of cryptography and security".^[14]
• Kurt Mehlhorn won the 2010 award for his "contributions to algorithm engineering by creating the LEDA library for algorithmic problem solving".^[15]
• The winner of the 2011 award (announced in April, 2012) was professor Hanan Samet^[16]

Notes

External links

• Paris Kanellakis Theory and Practice Award