2008 Gödel Prize (Wednesday, May 28, 2008)

The 2008 Gödel Prize for outstanding papers in the area of theoretical computer science is awarded to "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time" by Daniel A. Spielman and Shang-Hua Teng, Journal of the ACM (JACM), 51(3), May 2004, 385 – 463. The paper was first presented at the Annual ACM Symposium on the Theory of Computing (STOC '01), 2001, 296 – 305. The Prize will be presented at ICALP 2008 in Reykjavik on July 10.

More information
e-max.it: your social media marketing partner
 
European Association for Theoretical Computer Science - Maintained and hosted by RU1 / CTI.