 | This article needs additional citations for verification .(August 2024) |
The Computational Complexity Conference (CCC) is an academic conference in the field of theoretical computer science whose roots date to 1986. [1] It fosters research in computational complexity theory, and is typically held annually between mid-May and mid-July in North America or Europe. Since 2015, CCC has been organized independently by the Computational Complexity Foundation (CCF).
CCC was first organized in 1986 under the name "Structure in Complexity Theory Conference" (Structures) with support from the US National Science Foundation. [1] The conference was sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing from 1987 to 2014. In 1996, the conference was renamed the "Annual IEEE Conference on Computational Complexity", thus establishing the current acronym "CCC". In 2014, a movement towards independence and open access proceedings led to the establishment of the CCF. [2] Since 2015, CCF has organized the conference independently under the name CCC, and publishes open access proceedings via Leibniz International Proceedings in Informatics. [3] Future and past conference websites, as well as past programs and call for papers, are archived online.
CCC broadly targets research in computational complexity theory. This currently[ when? ] includes(but is not limited to the study of models of computation ranging from deterministic to quantum to algebraic, as well as resource constraints such as time, randomness and input queries.
CCC is held annually between mid-May and mid-July, with a scientific program running for approximately three days. The conference is composed of a single-track. Activities in addition to the scientific program typically include an opening reception, a rump session and a business meeting.
CCC annually confers up to two awards: a "Best Student Paper Award", aimed at papers authored solely by students and, since 2001, a "Best Paper Award", given to the most outstanding paper at the year's conference.
Computer science is the study of computation, information, and automation. Computer science spans theoretical disciplines to applied disciplines.
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.
Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland.
Russell Graham Impagliazzo is a professor of computer science at the University of California, San Diego, specializing in computational complexity theory.
ICALP, the International Colloquium on Automata, Languages, and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics.
Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.
Scott Joel Aaronson is an American theoretical computer scientist and Schlumberger Centennial Chair of Computer Science at the University of Texas at Austin. His primary areas of research are computational complexity theory and quantum computing.
The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both Design and Analysis and Engineering and Applications tracks.
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.
The Federated Computing Research Conference, FCRC, is an event that brings together several academic conferences, workshops, and plenary talks in the field of computer science. FCRC has been organized and held in the United States in 1993, 1996, 1999, 2003, 2007, 2011, 2015, 2019, and 2023. The 2023 event was held in Orlando, Florida.
Ran Raz is a computer scientist who works in the area of computational complexity theory. He was a professor in the faculty of mathematics and computer science at the Weizmann Institute. He is now a professor of computer science at Princeton University.
Informatics is the study of computational systems. According to the ACM Europe Council and Informatics Europe, informatics is synonymous with computer science and computing as a profession, in which the central notion is transformation of information. In some cases, the term "informatics" may also be used with different meanings, e.g. in the context of social computing, or in context of library science.
Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.
ISSAC, the International Symposium on Symbolic and Algebraic Computation, is an academic conference in the field of computer algebra. ISSAC has been organized annually since 1988, typically in July. The conference is regularly sponsored by the Association for Computing Machinery special interest group SIGSAM, and the proceedings since 1989 have been published by ACM. ISSAC is considered as being one of the most influential conferences for the publication of scientific computing research.
The International Conference on Computational Intelligence Methods for Bioinformatics and Biostatistics (CIBB) is a yearly scientific conference focused on machine learning and computational intelligence applied to bioinformatics, biostatistics, and medical informatics.
Christopher Umans is a professor of Computer Science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, computational complexity, algebraic complexity, and hardness of approximation.
Ding-Zhu Du is a Professor in the Department of Computer Science at The University of Texas at Dallas. He has received public recognition when he solved two long-standing open problems on the Euclidean minimum Steiner trees, the proof of Gilbert–Pollack conjecture on the Steiner ratio of the Euclidean plane, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio. The proof of Gilbert-Pollak's conjecture on Steiner ratios was later found to have gaps, thus leaving the problem unsolved.
| International | |
|---|---|
| National | |
