CALL FOR PAPERS
Papers presenting new and original research on theory of computation are sought. Typical but not exclusive topics of interest include: algorithms and data structures, computational complexity, cryptography, computational learning theory, computational game theory, parallel and distributed algorithms, quantum computing, computational geometry, computational applications of logic, algorithmic graph theory and combinatorics, optimization, randomness in computing, approximation algorithms, parameterized complexity, algorithmic coding theory, algebraic computation, and theoretical aspects of areas such as networks, privacy, information retrieval, 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.
The authors should submit an extended abstract that is at most 10 pages long, excluding the bibliography and title page (which should consist 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). The page limit only applies to text, and illustrative graphic figures can extend beyond the 10 page limit. 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 at least 1-inch margins all around. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits.
The authors should also include all the technical ideas and proofs necessary for an expert to fully verify the central claims in the paper, by supplementing the extended abstract (if necessary) with a full version. It is recommended that the full version be submitted as a separate file via the "supporting material" field of the submission server. If for some reason the authors prefer to submit a single file (say, if the full paper isn't much longer than 10 pages), the authors can supplement the extended abstract with appendices that extend beyond the main body of 10 pages.
The supplementary material will be read at the committee's discretion. The accept/reject decision will be based mainly on the 10-page extended abstract, which should be readable as a stand alone version, and contain a clear presentation of the interesting aspects of the paper, including discussion of its context and motivation, prior work, significance of the main results, and an outline of key methods and proof ideas used to achieve the main claims. To the extent possible, the extended abstract should be addressed to a broad spectrum of theoretical computer scientists, not solely to experts in the subarea.
All submissions will be treated as confidential, and will only be disclosed to the committee and their chosen sub-referees.
|Arkadev Chattopadhyay||TIFR, Mumbai|
|Irit Dinur||Weizmann Institute|
|Uriel Feige||Weizmann Institute|
|Yuval Filmus||IAS, Princeton|
|Anupam Gupta||Carnegie Mellon University|
|Venkatesan Guruswami (chair)||Carnegie Mellon University|
|Michael Kapralov||IBM Research|
|Shachar Lovett||University of California, San Diego|
|Pinyan Lu||Microsoft Research|
|Claire Mathieu||CNRS and École Normale Supérieure|
|Dániel Marx||Hungarian Academy of Sciences|
|Ruta Mehta||Georgia Tech|
|Cristopher Moore||Santa Fe Institute|
|Huy Le Nguyen||Simons Institute, UC Berkeley|
|Rafael Pass||Cornell University|
|Seth Pettie||University of Michigan|
|Thomas Rothvoss||University of Washington|
|Shubhangi Saraf||Rutgers University|
|Anastasios Sidiropoulos||The Ohio State University|
|Santosh S. Vempala||Georgia Tech|
|Hoeteck Wee||CNRS and École Normale Supérieure|
|Philipp Woelfel||University of Calgary|
|General Chair:||Program Committee Chair:||Local Arrangements Chairs:|
Carnegie Mellon University
(Simons Institute/UC Berkeley)