STOC 2016 - The 48th ACM Symposium on Theory of Computing (STOC 2016)

Topics of interest include but are not limited to: algorithms and data structures, computational complexity, algorithmic coding theory, algorithmic graph theory and combinatorics, approximation algorithms, computational geometry, computational learning theory, cryptography, economics and computation, optimization, parallel and distributed algorithms, quantum computing, randomness in computing, and theoretical aspects of other CS-research areas, e.g., computational science, databases, information retrieval, networking, privacy, and security.
Program Chair: David Shmoys (Cornell)
Program Committee: STOC 2014 will have a traditional-style Program Committee (PC), with members excluded from submitting to the conference.
Boris Aronov (NYU-Poly)
Moshe Babaioff (Microsoft Research)
Nikhil Bansal (Eindhoven)
Glencora Borradaile (Oregon State)
Mark Braverman (Princeton)
Petros Drineas (RPI)
Moritz Hardt (IBM Almaden)
Jochen Koenemann (Waterloo)
Katrina Ligett (Caltech)
Brendan Lucier (Microsoft Research)
Prasad Raghavendra (Berkeley)
Ronitt Rubinfeld (MIT and Tel Aviv)
Piotr Sankowski (Warsaw)
David Shmoys (Cornell)
Adam Smith (Penn State)
Ola Svensson (EPFL)
Mikkel Thorup (Copenhagen)
Chris Umans (Caltech)
Vinod Vaikuntanathan (MIT and Toronto)
Gregory Valiant (Stanford)
Thomas Vidick (Newton Institute-Cambridge/NUS)
Lisa Zhang (Bell Labs)