53rd Annual ACM Symposium on Theory of Computing (STOC) 2021
Event submitted on Tuesday, October 13th 2020, approved by Charles Villanueva ✓
This event has been tagged as follows:
Whilst this event has a strong lean towards academia, it would have a significant interest in those working with Cryptography. Incidentally, if you’re interested in learning more about this subject-matter we have a resource listing some of the best Cryptography Conferences we can find.
The following description was either submitted by the Conference Organizer on Tuesday, October 13th 2020, or created by us.
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.