(CC) "Calm by the river today" by Pear Biter/flickr


General Informations

The 42th ACM Symposium on Theory of Computing (STOC 2010), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory, will be held in Cambridge, MA, Sunday, June 6 - Tuesday, June 8, 2010, at the Hyatt Regency Cambridge. There will be a welcome reception Saturday, June 5th.

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 2010 is sponsored by SIGACT (ACM Special Interest Group on Algorithms and Computation Theory).

Program Committee:

Timothy Chan, U. Waterloo
Ken Clarkson, IBM Almaden Research
Constantinos Daskalakis, MIT
Irit Dinur, Weizmann Inst.
Faith Ellen, U. Toronto
Alan Frieze, CMU
Parikshit Gopalan, Microsoft Research
Piotr Indyk, MIT
Valentine Kabanets, Simon Fraser U.
Yael Tauman Kalai, Microsoft Research
Howard Karloff, ATT Labs--Research
Robert Kleinberg, Cornell
Assaf Naor, NYU
Noam Nisan, Hebrew U.
Chris Peikert, Georgia Tech
Jaikumar Radhakrishnan, Tata Inst.
Oded Regev, Tel Aviv U.
Alexander Russell, U. Connecticut
Leonard Schulman, Caltech (chair)
Aravind Srinivasan, U. Maryland
Santosh Vempala, Georgia Tech
Andrew Yao, Tsinghua U

Local Arrangements Committee:

Christian Borgs, Jennifer Chayes, Henry Cohn, Erik Demaine, Yael Tauman Kalai and Paul Oka.

Co-Located Conferences and Events