|
Paris Kanellakis Theory and Practice Award
The Paris Kanellakis Theory and Practice Award honors specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. This 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.
Complete Listing:
|
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
J
|
K
|
L
|
M
|
N
|
O
|
P
|
Q
|
R
|
S
|
T
|
U
|
V
|
W
|
X
|
Y
|
Z
|
Chronological Listing
2006
Brayton, Robert
2005
Holzmann, Gerard J.
Kurshan, Robert P.
Vardi, Moshe Y
Wolper, Pierre
2004
Freund, Yoav
Schapire, Robert
2003
Miller, Gary
|
Rabin, Michael
Solovay, Robert
Strassen, Volker
2002
Franaszek, Peter A.
2001
Myers, Eugene W.
2000
Karmarkar, Narendra
1999
Sleator, Daniel D.K.
|
Tarjan, Robert E
1998
Bryant, Randal E.
Clarke, Edmund M
Emerson, E Allen
McMillan, Kenneth L.
1997
Lempel, Abraham
Ziv, Jacob
1996
Adleman, Leonard
Diffie, Whitfield
Hellman, Martin
Merkle, Ralph
Rivest, Ronald
Shamir, Adi
|
|
|
