Daniel Spielman has been chosen for the 2010 Rolf Nevanlinna Prize for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing. The full details are here.
Congrats to Daniel for landing another prize after the Goedel prize 2008, which he received in Reykjavik during ICALP 2008.
Details about the other prize winners are here.
No comments:
Post a Comment