STOC 2009Program Chair’s Report

Michael Mitzenmacher

Thanks 1 :Program CommitteeSusanne AlbersAndris AmbainisNikhil BansalPaul BeameAndrej BogdanovRan CanettiDavid EppsteinDmitry GavinskyLeslie Ann GoldbergShafi GoldwasserNicole ImmorlicaAnna Karlin

Jonathan KatzJonathan KelnerSubhash KhotRavi KumarKamesh MunagalaRasmus PaghAnup RaoRocco ServedioMikkel ThorupChris UmansLisa Zhang

Thanks 2

• Richard Ladner• Jonathan Katz, David Mount, Aravind

Srinivasan (Local Arrangements)• Shai Halevi• Cynthia Dwork

321 (Final) Submissions77 Accepted

• algorithms and data structures 20/71• algorithmic algebra and coding theory 6/19• algorithmic graph theory and combinatorics

9/34• computational biology 0/5• computational complexity 9/40• computational game theory 4/27• computational geometry 1/6

• cryptography 7/23• machine learning 1/13• none 2/14• other 2/10• parallel and distributed computation 3/12• quantum computing and alternative models of

computation 4/22• randomness in computing 8/19• theory of information retrieval 0/2• theory of networks 1/4

Best Paper Award Shared

• Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem – Chris Peikert

• A Constructive Proof of the Lovász Local Lemma– Robin A. Moser

The second also selected for the Danny Lewin Best Student Paper Award

Issues for the Future(see blog discussions)

• Software consistency / maintenence• Encouraging detailed reviews• Online vs. face-to-face PC meetings• Conflict of interest policies• Consistent, usable scoring methods• Size/structure of PC• Conceptual papers and simplicity