CCC 2014: Call for Papers
Wednesday, November 27, 2013, 23:59 EST
The conference seeks original research papers in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. We also encourage contributions from other areas of computer science and mathematics motivated by topics in complexity theory. Possible topics include but are not limited to:
Papers must be submitted electronically, and received by
November 27, 2013, 23:59 EST.
The submission server is active.
The submission deadline has passed.
Notification of acceptance will be sent in early February
and final camera-ready copies of accepted papers will be due
around mid-March 2014.
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. A submission must contain within its first 10 pages a clear presentation of the merits of the paper, including discussion of its importance, prior work, and an outline of key technical ideas and methods used to achieve the main claims (similar to the content of a brief oral presentation). There is no bound on the total length of a submission, but material other than the abstract, references, and the first 10 pages is considered as supplementary and will be read at the committee's discretion.
Submissions are expected to include all ideas necessary for an expert to fully verify the central claims in the paper.
The submission should be in single-column format, use at least 11-point font, and have standard margins and spacing between lines. Submissions deviating from these guidelines risk rejection without consideration of their merits. Instructions for formatting camera-ready versions will be communicated to the authors of accepted papers.
Simultaneous submission policy: Material which has been previously published in a journal or another conference proceedings, or which is scheduled for publication prior to June 2014, will not be considered for acceptance. Simultaneous submission of the same or essentially the same material to another conference with published proceedings is not allowed.
Confidentiality: All submissions will be treated as confidential, and will only be disclosed to the committee and their chosen sub-referees.
Online posting: Authors are encouraged to post full versions of their submissions in a freely accessible on-line repository such as the Electronic Colloquium on Computational Complexity or the arXiv. It is hoped that authors of accepted papers will make full versions of their papers, with proofs, publicly available by the camera-ready deadline. This should be done in a manner consistent with the IEEE Copyright Policy.
Presentation: Authors of accepted papers are expected to present their work at the conference. The program committee will determine time allocations for presentations (between 15 and 45 minutes).
Proceedings: Conference proceedings will be published by the IEEE Computer Society. Publication in the conference proceedings does not preclude subsequent journal publication.
Ronald V. Book prize for best student paper: This award will be given to the best paper written solely by one or more students. An abstract is eligible if all authors are full-time students at the time of submission. The online submission form contains a check box for authors to indicate that this criterion is satisfied. The program committee may decline to make the award or may split it among several papers.
Best paper award: This award will be given to the best paper submitted to the conference as judged by the program committee. The program committee may decline to make the award or may split it among two or more papers. Authors of papers that receive this award are automatically invited to publish the full version of the paper in the Journal of the ACM .
Special journal issue: The program committee will invite full versions of a select number of conference submissions to a special issue of the journal Computational Complexity. The special issue is scheduled to appear by the 2015 conference, where free hard copies will be distributed.
- Paul Beame, University of Washington
- Lance Fortnow,Georgia Institute of Technology
- Elena Grigorescu, Purdue University
- Yuval Ishai, Technion
- Shachar Lovett, University of California, San Diego
- Michael Saks (chair), Rutgers University
- Alexander Sherstov, University of California, Los Angeles
- Srikanth Srinivasan, Indian Institute of Technology, Bombay
- Madhur Tulsiani, Toyota Technological Institute at Chicago
- Ryan Williams , Stanford University
- Ronald de Wolf, CWI and University of Amsterdam
Location and dates: The conference will be held
from June 11th to June
14th 13th, 2014 in
Vancouver, British Columbia, Canada. More information will be available on
local arrangements webpage.
Student travel allowances: In order to defray the costs of attending the conference, some travel allowances will be available for students. More information will be made available on the conference webpage in due time.
Visas: A visa for Canada may be needed for attending the conference. This website has details. If a visa is needed, please get in touch with your local Canadian consulate as soon as possible; the whole process may take several months. Feel free to contact the conference organizers if you need a letter to obtain your visa.
Local Arrangements Committee
- Valentine Kabanets (chair), Simon Fraser University
Conference Steering Committee
- Eric Allender, Rutgers University
- Venkatesan Guruswami, Carnegie Mellon University
- Jeff Kinne (publicity), Indiana State University
- Dieter van Melkebeek (chair), University of Wisconsin
- Amir Shpilka, Technion
- Madhu Sudan, Microsoft Research New England
- Osamu Watanabe, Tokyo Institute of Technology
- Ryan Williams, Stanford University
The conference is sponsored by the IEEE Computer Society Technical Committee for Mathematical Foundations of Computing in cooperation with the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the European Association of Theoretical Computer Science (EATCS).
If you have any questions, please e-mail Jeff Kinne, the publicity chair.