posted by system || 5000 views || tracked by 5 users: [display]

CCC 2011 : The 26th IEEE Conference on Computational Complexity

FacebookTwitterLinkedInGoogle

Link: http://facweb.cs.depaul.edu/jrogers/complexity/
 
When Jun 8, 2011 - Jun 10, 2011
Where San Jose, California
Submission Deadline Dec 8, 2010
Notification Due Feb 18, 2011
Final Version Due Mar 11, 2011
Categories    artificial intelligence   machine learning   computational intelligence   computer science
 

Call For Papers

CCC 2011: Call for Papers
Purpose and Scope
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. Typical models include deterministic, nondeterministic, randomized, and quantum models; uniform and non-uniform models; Boolean,
algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, communication, and entanglement; worst-case as well as average-case. Other, more specific, topics include: probabilistic and interactive proof systems, inapproximability, proof complexity, descriptive complexity, and complexity-theoretic aspects of cryptography and learning theory. The conference also encourages results from other areas of computer science and mathematics motivated by computational complexity theory.

Location and Dates
The 2011 conference will be part of FCRC 2011 and will be held from June 8th to June 10th, 2011, in San Jose, California. The Federated Computing Research Conference (FCRC) is a bringing together of several related conferences in one place and will take place from June 4th to June 11th.

See the navigation list for the local arrangements site and to find travel information.

Sponsors
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).

Submissions
Papers must be submitted electronically to the submissions server, when it becomes available. A submission must be received by December 8th, 2010, 19:59 EST, for consideration. Notification of acceptance will be sent by February 18th, 2011, and final copies will be due by March 11th, 2011.

Format
A submission consists of a title page (containing the title, author names and affiliations, and an abstract), a body of no more than 10 pages, a bibliography, and possible appendices. The paper 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 summary rejection. In the body of the paper (i) explain what the major contributions are, (ii) convey why they are interesting, (iii) tell how they relate to prior work, and (iv) present the main ideas behind them. Use appendices to substantiate technical claims. The appendices will be read at the discretion of the Program Committee.
Exclusivity
Material which has been previously published in a journal or another conference proceedings, or which is scheduled for publication prior to July 2011 will not be considered for acceptance. Simultaneous submission of the same or essentially the same material to a journal or another conference with published proceedings (including
STOC) is not allowed. Authors are encouraged to submit their papers to the Electronic Colloquium on Computational Complexity.

Presenting the work
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). 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. This should be indicated in the submission registration message or cover letter. 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. This will be awarded by the program committee. The program committee may decline to make the award or may split it among several papers.

Program Committee
Albert Atserias, UPC Barcelona
Richard Beigel, Temple U.
Dmitry Gavinsky, NEC Labs, US
Tali Kaufman, Bar-Ilan U. and Weizmann Inst.
Johannes Koebler, Humboldt U.
Toni Pitassi, U. of Toronto
Prasad Raghavendra, Georgia Tech
Anup Rao, U. of Washington
Ran Raz, Weizmann Institute
Omer Reingold (chair), MSR
Nitin Saxena, Hausdorff Center, Bonn

Related Resources

IComputation 2020   The 2020 IEEE Symposium on Immune Computation
ICML 2020   37th International Conference on Machine Learning
COMPLEXIS 2020   5th International Conference on Complexity, Future Information Systems and Risk
ICDMML 2020   【EI SCOPUS】2020 International Conference on Data Mining and Machine Learning
COLING 2020   The 28th International Conference on Computational Linguistics
IJCAI 2020   International Joint Conference on Artificial Intelligence
Journal Special Issue 2019   Machine Learning on Scientific Data and Information
CCC 2019   Conference on Computational Complexity
ISBDAI 2020   【Ei Compendex Scopus】2020 International Symposium on Big Data and Artificial Intelligence
IEEE COINS 2020   Internet of Things IoT | Artificial Intelligence | Machine Learning | Big Data | Blockchain | Edge & Cloud Computing | Security | Embedded Systems | Circuit and Systems | WSN | 5G