Announcements

• New! There has been a change to the Conference Schedule. The Business Meeting on Sunday has been delayed (to provide more time for dinner). It will be from 8:30-10:00pm.
   
• If you are seeking a roommate for the conference hotel, please visit the Room Sharing page to learn how to post a request.
   
• Visit the Registration page to register for the conference.
   

General Information

The 41st ACM Symposium on Theory of Computing (STOC 2009) will be held in Bethesda, Maryland, just outside Washington, DC, Sunday, May 31 - Tuesday, June 2, 2009, at the Hyatt Regency Bethesda. There will be a welcome reception Saturday, May 30.

Typical but not exclusive topics of interest include: algorithms and data structures, computational complexity, cryptography, computational geometry, algorithmic graph theory and combinatorics, randomness in computing, parallel and distributed computation, machine learning, applications of logic, algorithmic algebra and coding theory, computational biology, computational game theory, quantum computing and other alternative models of computation, and theoretical aspects of areas such as databases, information retrieval, and networks.

STOC 2009 is sponsored by SIGACT (ACM Special Interest Group on Algorithms and Computation Theory).

Additional Events

Visit the Special Events page for further information about the following events:

• On Friday, May 29, there will be a Workshop on Theory and Many-Cores (T&MC) on the campus of the University of Maryland, College Park.
   
• On Saturday, May 30 there will be workshop in honor of Leslie Valiant's 60th Birthday.
   
• Shafi Goldwasser is this year's recipient of ACM's Athena Lecture Award. She will be presenting the Athena Lecture on Sunday, May 31.
   
• From Wednesday, June 3 to Friday, June 5, there will be a workshop on Complexity and Cryptography: Status of Impagliazzo's Worlds at the Princeton Center for Computational Intractability.
   

Program Committee

Local Arrangements Committee