STOC 2017 : ACM Symposium on Theory of Computing
Місто: Los Angeles
Тези до: 03.11.2017
Дати: 25.06.18 — 29.06.18
Е-мейл Оргкомітету: http://acm-stoc.org/stoc2018/Call%20for%20Papers%20STOC%202018.pdf
Організатори: ACM Special Interest Group on Algorithms and Comput ation Theory
STOC 2018 will be part of a 5-day TheoryFest with an expanded program of STOC papers, poster sessions, and a broad cross-section of invited talks, workshops and tutorials. This will include a special celebration for the 50th anniversary of the founding of SIGACT and STOC, which was first held in the Los Angeles area.
Typical but not exclusive topics of interest for STOC papers include: algorithms and data structures, computational complexity, cryptography, privacy, computational geometry, algorithmic graph theory and combinatorics, optimization, randomness in computing, approximation algorithms, parallel and distributed computation, machine learning, applications of logic, algorithmic algebra and coding theory, computational biology, computational game theory, quantum computing, and theoretical aspects of areas such as robotics, databases, information retrieval, and networks. Papers that broaden the reach of theory, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.
Веб-сторінка конференції: http://acm-stoc.org/stoc2018/