Computational Complexity

Wednesday, June 25, 2008

 
Podcasting from the Conference

Posted by Lance

Bill and I revived the Complexitycast by talking about the Complexity Conference. The discussion ran long so we will post the podcasts in parts. In Part I (18:33, 16.9MB) we talk about the award winning papers:

• Ronald V. Book Best Student Paper Award: Alexander Sherstov for Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions
• Best Paper co-Winner: Ran Raz and Amir Yehudayoff for Lower Bounds and Separations for Constant Depth Multilinear Circuits
• Best Paper co-Winner: Emanuele Viola for The Sum of d Small-Bias Generators Fools Polynomials of Degree d

and the beginning of the business meeting including future Complexity Conferences in Paris (July 7-10, 2009) and Cambridge, Massachusetts co-located with STOC in 2010.

8:14 AM # 2 comments

1.  Anonymous says:  
   
   How do you know that the fellow from Nigeria didn't actually want to attend the conference?
   

   10:10 AM, June 25, 2008

2.  Anonymous says:  
   
   Thanks Lance for a clear commentary. Unfortunately your sidekick needs to work harder on diction and content, especially having left grad school earlier than you.
   

   6:42 PM, June 25, 2008

Comment Feeds: This Post All