Conference Information
STOC 2017 : ACM Symposium on Theory of Computing
Submission Date:
Notification Date:
Conference Date:
Montreal, Quebec, Canada
CCF: a   CORE: a*   QUALIS: a1   Viewed: 19920   Tracked: 19   Attend: 1

Conference Location
Call For Papers
 The 49th ACM Symposium on Theory of Computing (STOC 2017), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Montreal, Quebec, Canada. This year, STOC will be part of Theory Fest, an expanded program of invited talks, tutorials, poster sessions, and workshops from Monday, June 19 to Friday, June 23, 2017. Papers presenting new and original research on the theory of computation are sought. 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 extend the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged. The program committee will make every effort to consider a broad range of areas.

Submission format: Submissions should start with a title page consisting of the title of the paper; each author's name, affiliation, and email address; and an abstract of 1-2 paragraphs summarizing the paper's contributions. There is no page limit and authors are encouraged to use the "full version" of their paper as the submission. The submission should contain within the initial ten pages following the title page a clear presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. The submission should be addressed to a broad spectrum of theoretical computer science researchers. Proofs must be provided which can enable the main mathematical claims of the paper to be fully verified. Although there is no bound on the length of a submission, material other than the abstract, references, and the first ten pages will be read at the committee's discretion. Authors are encouraged to put the references at the very end of the submission. The submission should be typeset using 11-point or larger fonts, in a single-column, single-space (between lines) format with ample spacing throughout and 1-inch margins all around, on letter-size (8 1/2 x 11 inch) paper. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits.

Submission Instructions: Authors are required to submit their papers electronically, in PDF (without security restrictions on copying or printing). The submission server will be available by early October.

Authors are encouraged to also make full versions of their submissions freely accessible in an online repository such as the arXiv, ECCC, or the Cryptology ePrint archive. (Papers that are not written well enough for public dissemination are probably also not ready for submission to STOC.) It is expected that authors of accepted papers will make their full papers, with proofs, publicly available by the camera-ready deadline.

Prior and Simultaneous Submissions: The conference will follow SIGACT's policy on prior publication and simultaneous submissions. Work that has been previously published in another conference proceedings or journal, or which is scheduled for publication prior to July 2017, will not be considered for acceptance at STOC 2017. The only exception to this policy are prior or simultaneous publications appearing in the Science and Nature journals. SIGACT policy does not allow simultaneous submissions of the same (or essentially the same) material to another conference with published proceedings. The program committee may consult with program chairs of other (past or future) conferences to find out about closely related submissions.
Last updated by Xin Yao in 2016-10-20
Related Publications
Acceptance Ratio
Related Conferences
CCFCOREQUALISShortFull NameSubmissionNotificationConference
NANOARCHACM/IEEE International Symposium on Nanoscale Architectures2016-04-152016-05-152016-07-18
ca1ISCASInternational Symposium on Circuits and Systems2017-10-09 2018-05-27
ACMSEACM Southeast Conference2013-12-022014-01-242014-03-28
ccb1SCCInternational Conference on Service Computing2018-02-212018-04-212018-06-25
cbHPCCInternational Conference on High Performance Computing and Communications2017-07-012017-08-152017-12-13
bSOCCACM Symposium on Cloud Computing2017-05-052017-07-182016-10-05
b4CODASPYACM Conference on Data and Application Security and Privacy2016-09-082016-11-242016-03-09
aa2HypertextACM Conference on Hypertext and Social Media2016-02-222016-04-012016-07-10
b1ICEC'International Conference on Electronic Commerce2013-03-162013-04-242013-08-13
ReHISInternational Workshop Reliability of eHealth Information Systems2014-06-142014-07-152014-10-15
ShortFull NameSubmissionConference
NANOARCHACM/IEEE International Symposium on Nanoscale Architectures2016-04-152016-07-18
ISCASInternational Symposium on Circuits and Systems2017-10-092018-05-27
ACMSEACM Southeast Conference2013-12-022014-03-28
SCCInternational Conference on Service Computing2018-02-212018-06-25
HPCCInternational Conference on High Performance Computing and Communications2017-07-012017-12-13
SOCCACM Symposium on Cloud Computing2017-05-052016-10-05
CODASPYACM Conference on Data and Application Security and Privacy2016-09-082016-03-09
HypertextACM Conference on Hypertext and Social Media2016-02-222016-07-10
ICEC'International Conference on Electronic Commerce2013-03-162013-08-13
ReHISInternational Workshop Reliability of eHealth Information Systems2014-06-142014-10-15