Lance Fortnow calls UW CSE PhD candidate Prasad Raghavendra‘s paper Optimal algorithms and inapproximability results for every CSP? the best computational complexity paper of the year in a Computational Complexity blog entry 2008 Complexity Year in Review. Prasad is advised by Venkat Guruswami.