[Computational Complexity] ACM Awards
The 2005 ACM Awards have been announced. Omer Reingold received the Grace Hopper Award given to the best "outstanding young computer professional of the year, selected on the basis of a single recent major technical or service contribution" in this case for his log-space algorithm for undirected connectivity. The previous theoretician to receive the award was Shafi Goldwasser in 1996 and before that Donald Knuth in 1971. Congratulations Omer!
Peter Naur won the Turing Award (the closest CS has to a Nobel Prize) for his work on Algol 60.
Gerald Holzmann, Robert Kurshan, Moshe Vardi and Pierre Wolper won the Paris Kanellakis Theory and Practice Award for their use of automata theory in program verification.
Thanks to Moni Naor for the pointer.
Posted by Lance to Computational Complexity at 2/21/2006 12:10:00 PM