STOC 2017 - 2017 Symposium on Theory of Computing
Topics/Call fo Papers
Topics of interest include, but are not limited to: algorithms and data structures, computational complexity, randomness in computing, algorithmic graph theory and combinatorics, approximation algorithms, cryptography, computational learning theory, economics and computation, parallel and distributed algorithms, quantum computing, algorithmic coding theory, computational geometry, computational applications of logic, optimization, algebraic algorithms, and theoretical aspects of areas such as networks, privacy, computational biology, and databases.
Other CFPs
Last modified: 2016-01-30 23:24:36