General Information
The 48th ACM Symposium on Theory of Computing (STOC 2016) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and will be held at the Hyatt Regency in Cambridge, MA on Sunday, June 19 - Tuesday, June 21, 2016 with a reception on the evening of Saturday, June 18, 2016.
There will be a joint STOC/SoCG day of workshops and tutorials on Saturday, June 18, also located at the Hyatt Regency. These will be jointly coordinate with the International Symposium on Computational Geometry (SoCG); SoCG runs Tuesday, June 14 to Friday, June 17 and is located nearby at the Tufts Medical Center in Boston, MA.
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 2016 is sponsored by SIGACT (ACM
Special Interest Group on Algorithms and Computation Theory).
Co-Located Events:
Prior to STOC, the International Symposium on Computational Geometry (SoCG); SoCG runs Tuesday, June 14 to Friday, June 17 and is located nearby at the Tufts Medical Center in Boston, MA. Separate registration is required.
On the afternoon of June 17, there will be a Celebration Workshop for Bernard Chazelle's 60th Birthday. See details on the webpage for this workshop, including schedule, invited speakers and organizers.
A joint STOC/SoCG workshop and tutorial day will take place on Saturday, June 18 immediately preceding STOC at the Hyatt Regency, Cambridge. Registration for this workshop is included as part of the STOC registration.
After STOC, there will be a workshop on
Chaining Methods and their Applications to Computer Science
at Harvard, June 22-23, 2016.
Organizers:
General Chair: Daniel Wichs (Northeastern University)
Program Committee Chair: Yishay Mansour (Microsoft Research and Tel Aviv University)
Program Committee:
- Alexandr Andoni, Columbia University
- Sanjeev Arora, Princeton University
- Allison Bishop, Columbia University
- Avrim Blum, Carnegie Mellon University
- Keren Censor-Hillel, Technion
- Timothy Chan, University of Waterloo
- Chandra Chekuri, University of Illinois, Urbana-Champaign
- Jing Chen, Stony Brook University
- Zeev Dvir, Princeton University
- Fabrizio Grandoni, IDSIA
- Parikshit Gopalan, Microsoft Research
- Kasper Green Larsen, Aarhus University
- Huijia (Rachel) Lin, UC Santa Barbara
- Konstantin Makarychev, Microsoft Research
- Yishay Mansour (chair), Microsoft Research and Tel Aviv University
- Jakob Nordstrom, KTH Royal Institute of Technology
- Debmalya Panigrahi, Duke University
- Prasad Raghavendra, UC Berkeley
- Sofya Raskhodnikova, Pennsylvania State University
- R. Ravi, Carnegie Mellon University
- Mario Szegedy, Rutgers University
- Éva Tardos, Cornell University
- Salil Vadhan, Harvard University and National Chiao Tung University
- Avi Wigderson, Institute for Advanced Study
- Ronald de Wolf, CWI and University of Amsterdam
Supporters
