Subject Area and Category
Publication type
Conferences and Proceedings
Coverage
1969-1982, 1984, 1988, 1991-1994, 1996, 2000-2001, 2003-2023
Scope
ACM Symposium on Theory of Computing (STOC)
The Annual ACM Symposium on Theory of Computing (STOC), is the flagship conference of SIGACT, the Special Interest Group on Algorithms and Computation Theory, a special interest group of the Association for Computing Machinery (ACM). It has been held annually since 1969, traditionally in May/June.
STOC covers all areas of research within Algorithms and Computation Theory. 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. Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.
menu
Universities and research institutions in United States
Media Ranking in United States
Join the conversation about this journal
Powered by:
SCImago Graphica