Wednesday, May 28, 2008

CONCUR 2008: Accepted Papers

The list of accepted papers for CONCUR 2008 is now available here. There will be plenty of reading to do once the ICALP organization and the course I am delivering now are over.

On a separate, but ICALP-related, note, the winner of the 2008 Gödel Prize is the paper 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 results in the paper were first presented at the Annual ACM Symposium on the Theory of Computing (STOC 01), 2001, pp. 296-305.

The prize will be awarded at the conference during the award ceremony held on Thursday, 10 July. Both Daniel A. Spielman and Shang-Hua Teng will attend the ceremony.

No comments: