General Information

The 44th ACM Symposium on Theory of Computing (STOC 2012), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory, will be held in New York, NY, Saturday, May 19 - Tuesday, May 22, 2012. Saturday will be a day of tutorials and workshops held at NYU, with the main conference program Sunday-Tuesday at the at the New Yorker Hotel.

Typical but not exclusive topics of interest include: algorithms and data structures, computational complexity, cryptography, privacy, computational geometry, algorithmic graph theory and combinatorics, optimization, randomness in computing, approximation algorithms, parallel and distributed computation, machine learning, applications of logic, algorithmic algebra and coding theory, computational biology, computational game theory, quantum computing, and theoretical aspects of areas such as robotics, databases, information retrieval, and networks. Papers that broaden the reach of theory, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.

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

Program Committee:

Richard Cleve (U. Waterloo)
Parikshit Gopalan (Microsoft Research SVC)
Jason Hartline (Northwestern)
Tom Hayes (New Mexico)
Anna Karlin (U. Washington)
Sanjeev Khanna (UPenn)
Andrew McGregor (UMass)
Rina Panigrahy (Microsoft Research SVC)
Toniann Pitassi(U. Toronto, chair)
Ran Raz (Weizmann)
Charles Rackoff (U. Toronto)
Satish Rao (UC Berkeley)
Oded Regev (Tel Aviv & ENS Paris)
Dana Ron (Tel Aviv)
Guy Rothblum (Princeton and Microsoft Research SVC)
Amin Saberi (Stanford)
Rahul Santhanam (Edinburgh)
Shubhangi Saraf (IAS)
Daniel Spielman (Yale)
Madhur Tulsiani (TTI Chicago)
Suresh Venkatasubramanian (Utah)
Avi Wigderson (IAS)
David Williamson (Cornell)

General Chair: Howard Karloff (AT&T Labs-Research)
Local Arrangement Chair: Yevgeniy Dodis (NYU)