STOC 0221 : ACM Symposium on Theory of Computing

Typical but not exclusive topics of interest for STOC papers include foundational areas such as algorithms and data structures, computational complexity, parallel and distributed algorithms, quantum computing, continuous and discrete optimization, randomness in computing, approximation algorithms, combinatorics and algorithmic graph theory, cryptography, computational geometry, algebraic computation, computational applications of logic, and algorithmic coding theory. Typical topics also include computation and foundational aspects of areas such as machine learning, economics, fairness, privacy, networks, data management, and biology. Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.