The Local Arrangements Team have the preliminary schedule up at the STOC Web site. I hope it helps everyone make their travel plans.
Since it's (more-or-less) apparent from the schedule, I suppose I'll announce here that the Best Paper Prize will be shared by:
A Constructive Proof of the Lovasz Local Lemma
Robin A. Moser
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
The former also was awarded the Best Student Paper. These talks will be given without a parallel talk. (Who wants to give a talk against an award paper?)
Please don't tell the authors, as I haven't let them know yet. Perhaps, if we all keep quiet about it, they'll be surprised at the conference.