Loading ...
Sorry, an error occurred while loading the content.

[Computational Complexity] Spielman Receives the Nevanlinna Prize

Expand Messages
  • Lance
    Dan Spielman wins the Nevanlinna prize for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to
    Message 1 of 1 , Aug 19, 2010
    • 0 Attachment
      Dan Spielman wins the Nevanlinna prize for "smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing." Let's also not forget that as an undergrad Spielman co-authored one of my favorite complexity results, PP is Closed Under Intersection. A nice recognition for just a brilliant career.

      In other other IMU prizes awarded at the ICM opening ceremonies in Hyderabad, India: The Field medals goes to Elon Lindenstrauss (Ergodic Theory), Ngô Bảo Châu (Algebraic Geometry), Stanislav Smirnov (Statistical Physics) and Cédric Villani (Mathematical Physics). The Gauss Prize goes to Yves Meyer (Number Theory) and the first Chern medal goes to Louis Nirenberg.

      Tim Gowers is blogging the meeting and the ICM is offering live streaming of the plenary sessions. The Nevanlinna Prize lecture will be given Saturday at 4:15 AM Eastern time. Also notable is Irit Dinur on PCPs at 12:45 AM Eastern Saturday morning.




      --
      Posted By Lance to Computational Complexity at 8/19/2010 07:00:00 AM
    Your message has been successfully submitted and would be delivered to recipients shortly.